./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC --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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 02:05:33,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 02:05:33,233 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 02:05:33,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 02:05:33,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 02:05:33,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 02:05:33,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 02:05:33,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 02:05:33,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 02:05:33,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 02:05:33,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 02:05:33,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 02:05:33,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 02:05:33,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 02:05:33,306 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 02:05:33,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 02:05:33,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 02:05:33,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 02:05:33,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 02:05:33,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 02:05:33,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 02:05:33,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 02:05:33,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 02:05:33,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 02:05:33,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 02:05:33,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 02:05:33,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:33,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 02:05:33,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:33,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 02:05:33,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 02:05:33,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 02:05:33,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 02:05:33,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 02:05:33,312 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_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2024-11-24 02:05:33,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 02:05:33,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 02:05:33,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 02:05:33,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 02:05:33,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 02:05:33,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 02:05:37,434 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/data/2e5517782/dc30fb9f31aa4683810f4364835eb97f/FLAG56d77c79f [2024-11-24 02:05:37,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 02:05:37,821 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 02:05:37,841 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/data/2e5517782/dc30fb9f31aa4683810f4364835eb97f/FLAG56d77c79f [2024-11-24 02:05:38,013 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/data/2e5517782/dc30fb9f31aa4683810f4364835eb97f [2024-11-24 02:05:38,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 02:05:38,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 02:05:38,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 02:05:38,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 02:05:38,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 02:05:38,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333d1dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38, skipping insertion in model container [2024-11-24 02:05:38,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 02:05:38,285 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_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-24 02:05:38,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:05:38,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 02:05:38,600 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_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/sv-benchmarks/c/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-24 02:05:38,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:05:38,781 INFO L204 MainTranslator]: Completed translation [2024-11-24 02:05:38,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38 WrapperNode [2024-11-24 02:05:38,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 02:05:38,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 02:05:38,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 02:05:38,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 02:05:38,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,878 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2024-11-24 02:05:38,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 02:05:38,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 02:05:38,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 02:05:38,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 02:05:38,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 02:05:38,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 02:05:38,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 02:05:38,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 02:05:38,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 02:05:38,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (1/1) ... [2024-11-24 02:05:38,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:38,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:39,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 02:05:39,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 02:05:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 02:05:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 02:05:39,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 02:05:39,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 02:05:39,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 02:05:39,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 02:05:39,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 02:05:39,055 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 02:05:39,260 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 02:05:39,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 02:05:39,856 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 02:05:39,856 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 02:05:40,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 02:05:40,179 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 02:05:40,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:40 BoogieIcfgContainer [2024-11-24 02:05:40,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 02:05:40,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 02:05:40,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 02:05:40,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 02:05:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:05:38" (1/3) ... [2024-11-24 02:05:40,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c114981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:05:40, skipping insertion in model container [2024-11-24 02:05:40,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:38" (2/3) ... [2024-11-24 02:05:40,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c114981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:05:40, skipping insertion in model container [2024-11-24 02:05:40,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:40" (3/3) ... [2024-11-24 02:05:40,197 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-24 02:05:40,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 02:05:40,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-24 02:05:40,222 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 02:05:40,310 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 02:05:40,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-11-24 02:05:40,415 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-11-24 02:05:40,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:05:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-24 02:05:40,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-11-24 02:05:40,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-11-24 02:05:40,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:05:40,452 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;@1401790e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:05:40,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-24 02:05:40,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 02:05:40,459 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-24 02:05:40,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:05:40,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:40,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 02:05:40,460 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-11-24 02:05:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1756285544, now seen corresponding path program 1 times [2024-11-24 02:05:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184598414] [2024-11-24 02:05:40,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184598414] [2024-11-24 02:05:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184598414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 02:05:41,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428615863] [2024-11-24 02:05:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:41,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:05:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:05:41,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:05:41,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-11-24 02:05:41,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:41,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:41,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-11-24 02:05:41,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:41,883 INFO L124 PetriNetUnfolderBase]: 453/885 cut-off events. [2024-11-24 02:05:41,883 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-24 02:05:41,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 885 events. 453/885 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5499 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1611. Up to 562 conditions per place. [2024-11-24 02:05:41,901 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-11-24 02:05:41,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow [2024-11-24 02:05:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:05:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:05:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-24 02:05:41,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-11-24 02:05:41,929 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 92 transitions. [2024-11-24 02:05:41,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow [2024-11-24 02:05:41,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 02:05:41,943 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-11-24 02:05:41,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-24 02:05:41,953 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-11-24 02:05:41,954 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-11-24 02:05:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:41,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:41,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 02:05:41,956 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-11-24 02:05:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1077292502, now seen corresponding path program 1 times [2024-11-24 02:05:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:41,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555702371] [2024-11-24 02:05:41,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555702371] [2024-11-24 02:05:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555702371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:05:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110373200] [2024-11-24 02:05:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:42,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:05:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:42,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:05:42,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:05:42,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-24 02:05:42,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:42,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:42,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-24 02:05:42,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:43,489 INFO L124 PetriNetUnfolderBase]: 1471/2502 cut-off events. [2024-11-24 02:05:43,490 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-11-24 02:05:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4928 conditions, 2502 events. 1471/2502 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15639 event pairs, 411 based on Foata normal form. 0/2431 useless extension candidates. Maximal degree in co-relation 4918. Up to 1402 conditions per place. [2024-11-24 02:05:43,513 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 30 selfloop transitions, 3 changer transitions 43/88 dead transitions. [2024-11-24 02:05:43,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 88 transitions, 354 flow [2024-11-24 02:05:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 02:05:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 02:05:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-24 02:05:43,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-11-24 02:05:43,520 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 198 transitions. [2024-11-24 02:05:43,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 88 transitions, 354 flow [2024-11-24 02:05:43,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:05:43,525 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 107 flow [2024-11-24 02:05:43,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-11-24 02:05:43,526 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-24 02:05:43,527 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 107 flow [2024-11-24 02:05:43,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:43,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:43,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 02:05:43,529 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-11-24 02:05:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash 710736299, now seen corresponding path program 1 times [2024-11-24 02:05:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:43,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089989205] [2024-11-24 02:05:43,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:43,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089989205] [2024-11-24 02:05:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089989205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:05:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798431535] [2024-11-24 02:05:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:43,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:43,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:43,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:44,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-11-24 02:05:44,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:44,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:44,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-11-24 02:05:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:45,244 INFO L124 PetriNetUnfolderBase]: 1902/3287 cut-off events. [2024-11-24 02:05:45,244 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-11-24 02:05:45,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7529 conditions, 3287 events. 1902/3287 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22450 event pairs, 207 based on Foata normal form. 108/3368 useless extension candidates. Maximal degree in co-relation 7514. Up to 1169 conditions per place. [2024-11-24 02:05:45,278 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 6 changer transitions 49/105 dead transitions. [2024-11-24 02:05:45,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 105 transitions, 486 flow [2024-11-24 02:05:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:05:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 02:05:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-11-24 02:05:45,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2024-11-24 02:05:45,285 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 107 flow. Second operand 10 states and 236 transitions. [2024-11-24 02:05:45,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 105 transitions, 486 flow [2024-11-24 02:05:45,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 462 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-24 02:05:45,321 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 140 flow [2024-11-24 02:05:45,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2024-11-24 02:05:45,322 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-11-24 02:05:45,322 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 140 flow [2024-11-24 02:05:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:45,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:45,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:45,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 02:05:45,323 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-11-24 02:05:45,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1694049196, now seen corresponding path program 1 times [2024-11-24 02:05:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185696655] [2024-11-24 02:05:45,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185696655] [2024-11-24 02:05:45,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185696655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:05:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698138275] [2024-11-24 02:05:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:45,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:45,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:45,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:45,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-24 02:05:45,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 36 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:45,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:45,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-24 02:05:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:46,897 INFO L124 PetriNetUnfolderBase]: 2001/3511 cut-off events. [2024-11-24 02:05:46,898 INFO L125 PetriNetUnfolderBase]: For 5064/5222 co-relation queries the response was YES. [2024-11-24 02:05:46,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 3511 events. 2001/3511 cut-off events. For 5064/5222 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25487 event pairs, 500 based on Foata normal form. 154/3570 useless extension candidates. Maximal degree in co-relation 9354. Up to 1139 conditions per place. [2024-11-24 02:05:46,924 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 33 selfloop transitions, 3 changer transitions 39/89 dead transitions. [2024-11-24 02:05:46,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 483 flow [2024-11-24 02:05:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 02:05:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 02:05:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-11-24 02:05:46,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-24 02:05:46,927 INFO L175 Difference]: Start difference. First operand has 61 places, 36 transitions, 140 flow. Second operand 8 states and 190 transitions. [2024-11-24 02:05:46,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 483 flow [2024-11-24 02:05:46,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 447 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-24 02:05:46,951 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 142 flow [2024-11-24 02:05:46,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2024-11-24 02:05:46,952 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-11-24 02:05:46,953 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 142 flow [2024-11-24 02:05:46,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:46,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:46,953 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] [2024-11-24 02:05:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 02:05:46,954 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-11-24 02:05:46,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash -948289132, now seen corresponding path program 1 times [2024-11-24 02:05:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578377211] [2024-11-24 02:05:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578377211] [2024-11-24 02:05:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578377211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:47,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:05:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323147340] [2024-11-24 02:05:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:05:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:47,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:05:47,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:05:47,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-11-24 02:05:47,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:47,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:47,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-11-24 02:05:47,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:47,987 INFO L124 PetriNetUnfolderBase]: 1787/3056 cut-off events. [2024-11-24 02:05:47,988 INFO L125 PetriNetUnfolderBase]: For 3781/3875 co-relation queries the response was YES. [2024-11-24 02:05:48,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 3056 events. 1787/3056 cut-off events. For 3781/3875 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19611 event pairs, 281 based on Foata normal form. 193/3175 useless extension candidates. Maximal degree in co-relation 7812. Up to 1535 conditions per place. [2024-11-24 02:05:48,018 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-11-24 02:05:48,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 306 flow [2024-11-24 02:05:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:05:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 02:05:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-24 02:05:48,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-24 02:05:48,020 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 142 flow. Second operand 4 states and 110 transitions. [2024-11-24 02:05:48,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 306 flow [2024-11-24 02:05:48,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 286 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-24 02:05:48,046 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 156 flow [2024-11-24 02:05:48,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-11-24 02:05:48,048 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-11-24 02:05:48,048 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 156 flow [2024-11-24 02:05:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:48,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:48,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] [2024-11-24 02:05:48,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 02:05:48,049 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-11-24 02:05:48,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:48,050 INFO L85 PathProgramCache]: Analyzing trace with hash -514326429, now seen corresponding path program 1 times [2024-11-24 02:05:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:48,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534489458] [2024-11-24 02:05:48,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:48,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534489458] [2024-11-24 02:05:48,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534489458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:48,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:05:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523559155] [2024-11-24 02:05:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:48,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:05:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:05:48,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:05:48,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-11-24 02:05:48,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:48,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:48,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-11-24 02:05:48,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:48,960 INFO L124 PetriNetUnfolderBase]: 1193/2044 cut-off events. [2024-11-24 02:05:48,961 INFO L125 PetriNetUnfolderBase]: For 1606/1652 co-relation queries the response was YES. [2024-11-24 02:05:48,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 2044 events. 1193/2044 cut-off events. For 1606/1652 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11422 event pairs, 117 based on Foata normal form. 154/2149 useless extension candidates. Maximal degree in co-relation 5459. Up to 729 conditions per place. [2024-11-24 02:05:48,977 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 50 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-11-24 02:05:48,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 387 flow [2024-11-24 02:05:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:05:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 02:05:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-24 02:05:48,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685 [2024-11-24 02:05:48,979 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 156 flow. Second operand 5 states and 137 transitions. [2024-11-24 02:05:48,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 387 flow [2024-11-24 02:05:48,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 377 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 02:05:48,984 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 196 flow [2024-11-24 02:05:48,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-24 02:05:48,985 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-11-24 02:05:48,985 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 196 flow [2024-11-24 02:05:48,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:48,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:48,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:48,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 02:05:48,986 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-11-24 02:05:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash 5062764, now seen corresponding path program 1 times [2024-11-24 02:05:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:48,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004951099] [2024-11-24 02:05:48,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:48,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004951099] [2024-11-24 02:05:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004951099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:05:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260412745] [2024-11-24 02:05:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:49,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:49,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:49,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-11-24 02:05:49,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:49,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:49,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-11-24 02:05:49,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:49,934 INFO L124 PetriNetUnfolderBase]: 721/1204 cut-off events. [2024-11-24 02:05:49,935 INFO L125 PetriNetUnfolderBase]: For 1574/1596 co-relation queries the response was YES. [2024-11-24 02:05:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3523 conditions, 1204 events. 721/1204 cut-off events. For 1574/1596 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5708 event pairs, 73 based on Foata normal form. 86/1248 useless extension candidates. Maximal degree in co-relation 3501. Up to 432 conditions per place. [2024-11-24 02:05:49,944 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 39 selfloop transitions, 11 changer transitions 6/70 dead transitions. [2024-11-24 02:05:49,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 390 flow [2024-11-24 02:05:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:05:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 02:05:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-24 02:05:49,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-11-24 02:05:49,946 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 196 flow. Second operand 6 states and 151 transitions. [2024-11-24 02:05:49,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 390 flow [2024-11-24 02:05:49,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 335 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-11-24 02:05:49,954 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 188 flow [2024-11-24 02:05:49,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-24 02:05:49,955 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-11-24 02:05:49,955 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 188 flow [2024-11-24 02:05:49,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:49,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:49,956 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, 1] [2024-11-24 02:05:49,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 02:05:49,956 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-11-24 02:05:49,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 464091976, now seen corresponding path program 1 times [2024-11-24 02:05:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264815405] [2024-11-24 02:05:49,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264815405] [2024-11-24 02:05:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264815405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:50,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:05:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702865824] [2024-11-24 02:05:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:50,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:50,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:50,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:50,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-11-24 02:05:50,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:50,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:50,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-11-24 02:05:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:50,954 INFO L124 PetriNetUnfolderBase]: 681/1310 cut-off events. [2024-11-24 02:05:50,954 INFO L125 PetriNetUnfolderBase]: For 879/915 co-relation queries the response was YES. [2024-11-24 02:05:50,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1310 events. 681/1310 cut-off events. For 879/915 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7176 event pairs, 175 based on Foata normal form. 8/1265 useless extension candidates. Maximal degree in co-relation 3230. Up to 514 conditions per place. [2024-11-24 02:05:50,966 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 26 selfloop transitions, 4 changer transitions 21/68 dead transitions. [2024-11-24 02:05:50,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 359 flow [2024-11-24 02:05:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:05:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 02:05:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-11-24 02:05:50,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-24 02:05:50,968 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 188 flow. Second operand 6 states and 135 transitions. [2024-11-24 02:05:50,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 359 flow [2024-11-24 02:05:50,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 295 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-24 02:05:50,975 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 134 flow [2024-11-24 02:05:50,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-11-24 02:05:50,976 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-11-24 02:05:50,976 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 134 flow [2024-11-24 02:05:50,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:50,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:50,976 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, 1] [2024-11-24 02:05:50,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 02:05:50,977 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-11-24 02:05:50,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2058518806, now seen corresponding path program 2 times [2024-11-24 02:05:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:50,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501816809] [2024-11-24 02:05:50,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:05:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:51,049 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 02:05:51,050 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501816809] [2024-11-24 02:05:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501816809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:52,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 02:05:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573463494] [2024-11-24 02:05:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:05:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:05:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:05:52,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-11-24 02:05:52,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:52,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:52,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-11-24 02:05:52,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:05:52,938 INFO L124 PetriNetUnfolderBase]: 302/604 cut-off events. [2024-11-24 02:05:52,939 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-24 02:05:52,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 604 events. 302/604 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2673 event pairs, 88 based on Foata normal form. 8/574 useless extension candidates. Maximal degree in co-relation 1259. Up to 230 conditions per place. [2024-11-24 02:05:52,947 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 22 selfloop transitions, 3 changer transitions 26/71 dead transitions. [2024-11-24 02:05:52,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 312 flow [2024-11-24 02:05:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 02:05:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 02:05:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-11-24 02:05:52,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-11-24 02:05:52,950 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 134 flow. Second operand 9 states and 205 transitions. [2024-11-24 02:05:52,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 312 flow [2024-11-24 02:05:52,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 278 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-24 02:05:52,953 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 126 flow [2024-11-24 02:05:52,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2024-11-24 02:05:52,955 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-11-24 02:05:52,956 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 126 flow [2024-11-24 02:05:52,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:05:52,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:05:52,957 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, 1] [2024-11-24 02:05:52,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 02:05:52,957 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-11-24 02:05:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash -519495582, now seen corresponding path program 3 times [2024-11-24 02:05:52,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:52,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952406747] [2024-11-24 02:05:52,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:05:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:53,097 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 02:05:53,097 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 02:05:53,097 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 02:05:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:05:53,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 02:05:53,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 02:05:53,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-24 02:05:53,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-24 02:05:53,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-24 02:05:53,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-24 02:05:53,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-24 02:05:53,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-24 02:05:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 02:05:53,269 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:53,370 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 02:05:53,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 02:05:53,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 02:05:53 BasicIcfg [2024-11-24 02:05:53,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 02:05:53,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 02:05:53,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 02:05:53,381 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 02:05:53,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:40" (3/4) ... [2024-11-24 02:05:53,383 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 02:05:53,552 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-24 02:05:53,630 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-24 02:05:53,630 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-24 02:05:53,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 02:05:53,633 INFO L158 Benchmark]: Toolchain (without parser) took 15613.87ms. Allocated memory was 117.4MB in the beginning and 385.9MB in the end (delta: 268.4MB). Free memory was 91.4MB in the beginning and 332.8MB in the end (delta: -241.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-24 02:05:53,634 INFO L158 Benchmark]: CDTParser took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:53,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.72ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 68.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 02:05:53,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.91ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:53,636 INFO L158 Benchmark]: Boogie Preprocessor took 90.07ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:53,637 INFO L158 Benchmark]: RCFGBuilder took 1210.13ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 69.6MB in the end (delta: -6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-24 02:05:53,638 INFO L158 Benchmark]: TraceAbstraction took 13196.84ms. Allocated memory was 117.4MB in the beginning and 385.9MB in the end (delta: 268.4MB). Free memory was 69.1MB in the beginning and 349.6MB in the end (delta: -280.5MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. [2024-11-24 02:05:53,638 INFO L158 Benchmark]: Witness Printer took 249.77ms. Allocated memory is still 385.9MB. Free memory was 349.6MB in the beginning and 332.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 02:05:53,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.86ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.72ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 68.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.91ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.07ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1210.13ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 69.6MB in the end (delta: -6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13196.84ms. Allocated memory was 117.4MB in the beginning and 385.9MB in the end (delta: 268.4MB). Free memory was 69.1MB in the beginning and 349.6MB in the end (delta: -280.5MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. * Witness Printer took 249.77ms. Allocated memory is still 385.9MB. Free memory was 349.6MB in the beginning and 332.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-3, 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, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-3, t2074=-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, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073=-3, t2074=-2, t2075=-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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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_p0_EAX=0, __unbuffered_p2_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-3, t2074=-2, t2075=-1, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 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_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-3, t2074=-2, t2075=-1, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073=-3, t2074=-2, t2075=-1, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: 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: 832]: 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: 836]: 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: 834]: 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, 66 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: 12.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 953 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 32 mSDtfsCounter, 953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 935 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-11-24 02:05:53,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ed7fdf8-9b0c-4ba2-9bf8-f931781051ee/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE