./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:15:19,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:15:19,396 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:15:19,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:15:19,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:15:19,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:15:19,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:15:19,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:15:19,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:15:19,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:15:19,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:15:19,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:15:19,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:15:19,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:15:19,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:15:19,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:15:19,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:15:19,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:15:19,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:19,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:15:19,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:19,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:15:19,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:15:19,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:15:19,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:15:19,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:15:19,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:15:19,444 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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2024-11-23 23:15:19,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:15:19,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:15:19,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:15:19,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:15:19,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:15:19,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-11-23 23:15:22,836 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/data/7b2caa058/6a72dd9df5524bf094b7540872efefa8/FLAGd90ec5359 [2024-11-23 23:15:23,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:15:23,187 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-11-23 23:15:23,209 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/data/7b2caa058/6a72dd9df5524bf094b7540872efefa8/FLAGd90ec5359 [2024-11-23 23:15:23,233 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/data/7b2caa058/6a72dd9df5524bf094b7540872efefa8 [2024-11-23 23:15:23,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:15:23,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:15:23,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:15:23,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:15:23,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:15:23,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d6bcbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23, skipping insertion in model container [2024-11-23 23:15:23,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:15:23,500 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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2024-11-23 23:15:23,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:15:23,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:15:23,774 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_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2024-11-23 23:15:23,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:15:23,879 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:15:23,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23 WrapperNode [2024-11-23 23:15:23,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:15:23,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:15:23,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:15:23,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:15:23,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,941 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2024-11-23 23:15:23,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:15:23,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:15:23,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:15:23,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:15:23,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,978 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-23 23:15:23,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:23,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:24,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:24,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:24,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:15:24,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:15:24,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:15:24,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:15:24,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (1/1) ... [2024-11-23 23:15:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:15:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:15:24,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:15:24,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:15:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-23 23:15:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-23 23:15:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-23 23:15:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:15:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:15:24,120 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 23:15:24,314 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:15:24,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:15:24,731 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 23:15:24,731 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:15:25,018 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:15:25,018 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:15:25,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:25 BoogieIcfgContainer [2024-11-23 23:15:25,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:15:25,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:15:25,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:15:25,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:15:25,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:23" (1/3) ... [2024-11-23 23:15:25,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2dd531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:25, skipping insertion in model container [2024-11-23 23:15:25,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:23" (2/3) ... [2024-11-23 23:15:25,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2dd531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:25, skipping insertion in model container [2024-11-23 23:15:25,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:25" (3/3) ... [2024-11-23 23:15:25,034 INFO L128 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-11-23 23:15:25,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:15:25,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i that has 3 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-23 23:15:25,057 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 23:15:25,137 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 23:15:25,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow [2024-11-23 23:15:25,236 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2024-11-23 23:15:25,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:15:25,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-11-23 23:15:25,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow [2024-11-23 23:15:25,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow [2024-11-23 23:15:25,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:15:25,289 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;@6eb3afc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:15:25,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-23 23:15:25,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 23:15:25,297 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-23 23:15:25,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:15:25,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:25,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-23 23:15:25,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash 9773938, now seen corresponding path program 1 times [2024-11-23 23:15:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:25,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016924220] [2024-11-23 23:15:25,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:25,927 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-23 23:15:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016924220] [2024-11-23 23:15:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016924220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:15:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116330405] [2024-11-23 23:15:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:15:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:25,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:15:25,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:15:25,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 31 [2024-11-23 23:15:25,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-23 23:15:25,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:25,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 31 [2024-11-23 23:15:25,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:26,204 INFO L124 PetriNetUnfolderBase]: 135/295 cut-off events. [2024-11-23 23:15:26,205 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-23 23:15:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 295 events. 135/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1381 event pairs, 51 based on Foata normal form. 15/303 useless extension candidates. Maximal degree in co-relation 539. Up to 199 conditions per place. [2024-11-23 23:15:26,229 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 21 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2024-11-23 23:15:26,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 133 flow [2024-11-23 23:15:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:15:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:15:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-23 23:15:26,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7526881720430108 [2024-11-23 23:15:26,246 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 70 transitions. [2024-11-23 23:15:26,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 133 flow [2024-11-23 23:15:26,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 23:15:26,254 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 60 flow [2024-11-23 23:15:26,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-11-23 23:15:26,260 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-11-23 23:15:26,261 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 60 flow [2024-11-23 23:15:26,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-23 23:15:26,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:26,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:26,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:15:26,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:26,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -351493509, now seen corresponding path program 1 times [2024-11-23 23:15:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120782991] [2024-11-23 23:15:26,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:26,749 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-23 23:15:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120782991] [2024-11-23 23:15:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120782991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:26,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647093113] [2024-11-23 23:15:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:26,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:26,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:26,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-11-23 23:15:26,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-23 23:15:26,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:26,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-11-23 23:15:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:27,351 INFO L124 PetriNetUnfolderBase]: 385/741 cut-off events. [2024-11-23 23:15:27,351 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-23 23:15:27,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 741 events. 385/741 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3938 event pairs, 148 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 1463. Up to 415 conditions per place. [2024-11-23 23:15:27,363 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 23 selfloop transitions, 3 changer transitions 36/69 dead transitions. [2024-11-23 23:15:27,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 284 flow [2024-11-23 23:15:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:15:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:15:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-11-23 23:15:27,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-11-23 23:15:27,366 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 60 flow. Second operand 8 states and 136 transitions. [2024-11-23 23:15:27,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 284 flow [2024-11-23 23:15:27,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 23:15:27,372 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 89 flow [2024-11-23 23:15:27,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2024-11-23 23:15:27,373 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-11-23 23:15:27,373 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 89 flow [2024-11-23 23:15:27,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-23 23:15:27,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:27,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:15:27,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:27,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 340962222, now seen corresponding path program 1 times [2024-11-23 23:15:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164756179] [2024-11-23 23:15:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:27,739 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-23 23:15:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164756179] [2024-11-23 23:15:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164756179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:27,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:27,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137388637] [2024-11-23 23:15:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:27,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:27,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:27,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-11-23 23:15:27,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-23 23:15:27,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:27,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-11-23 23:15:27,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:28,087 INFO L124 PetriNetUnfolderBase]: 252/505 cut-off events. [2024-11-23 23:15:28,087 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-11-23 23:15:28,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 505 events. 252/505 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2473 event pairs, 60 based on Foata normal form. 15/512 useless extension candidates. Maximal degree in co-relation 1193. Up to 330 conditions per place. [2024-11-23 23:15:28,095 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 3 changer transitions 19/52 dead transitions. [2024-11-23 23:15:28,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 247 flow [2024-11-23 23:15:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:15:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:15:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-11-23 23:15:28,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253456221198156 [2024-11-23 23:15:28,097 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 89 flow. Second operand 7 states and 114 transitions. [2024-11-23 23:15:28,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 247 flow [2024-11-23 23:15:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 230 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-23 23:15:28,106 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 99 flow [2024-11-23 23:15:28,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2024-11-23 23:15:28,108 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2024-11-23 23:15:28,108 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 99 flow [2024-11-23 23:15:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-23 23:15:28,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:28,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:15:28,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2087940875, now seen corresponding path program 1 times [2024-11-23 23:15:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149433483] [2024-11-23 23:15:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:28,311 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-23 23:15:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149433483] [2024-11-23 23:15:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149433483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:15:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756106100] [2024-11-23 23:15:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:28,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:15:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:15:28,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:15:28,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-11-23 23:15:28,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:28,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:28,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-11-23 23:15:28,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:28,535 INFO L124 PetriNetUnfolderBase]: 193/429 cut-off events. [2024-11-23 23:15:28,535 INFO L125 PetriNetUnfolderBase]: For 209/211 co-relation queries the response was YES. [2024-11-23 23:15:28,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 429 events. 193/429 cut-off events. For 209/211 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2005 event pairs, 42 based on Foata normal form. 29/444 useless extension candidates. Maximal degree in co-relation 971. Up to 165 conditions per place. [2024-11-23 23:15:28,540 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-11-23 23:15:28,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2024-11-23 23:15:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:15:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-23 23:15:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-23 23:15:28,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2024-11-23 23:15:28,545 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 99 flow. Second operand 4 states and 81 transitions. [2024-11-23 23:15:28,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2024-11-23 23:15:28,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 191 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-23 23:15:28,551 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 113 flow [2024-11-23 23:15:28,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-23 23:15:28,553 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-11-23 23:15:28,553 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 113 flow [2024-11-23 23:15:28,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:15:28,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:28,554 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-23 23:15:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:15:28,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -424603396, now seen corresponding path program 1 times [2024-11-23 23:15:28,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:28,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889571591] [2024-11-23 23:15:28,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:28,898 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-23 23:15:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889571591] [2024-11-23 23:15:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889571591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:15:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876519382] [2024-11-23 23:15:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:28,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:15:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:28,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:15:28,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:15:28,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-11-23 23:15:28,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-23 23:15:28,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:28,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-11-23 23:15:28,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:29,086 INFO L124 PetriNetUnfolderBase]: 130/286 cut-off events. [2024-11-23 23:15:29,086 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-23 23:15:29,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 286 events. 130/286 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1123 event pairs, 43 based on Foata normal form. 18/289 useless extension candidates. Maximal degree in co-relation 698. Up to 117 conditions per place. [2024-11-23 23:15:29,088 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 27 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-23 23:15:29,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 210 flow [2024-11-23 23:15:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:15:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-23 23:15:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-11-23 23:15:29,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-11-23 23:15:29,090 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 113 flow. Second operand 5 states and 90 transitions. [2024-11-23 23:15:29,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 210 flow [2024-11-23 23:15:29,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 192 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-23 23:15:29,092 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 125 flow [2024-11-23 23:15:29,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-23 23:15:29,093 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-11-23 23:15:29,093 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 125 flow [2024-11-23 23:15:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-23 23:15:29,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:29,094 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-23 23:15:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:15:29,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:29,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash -136152366, now seen corresponding path program 1 times [2024-11-23 23:15:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690480568] [2024-11-23 23:15:29,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:15:30,308 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-23 23:15:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:15:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690480568] [2024-11-23 23:15:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690480568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:15:30,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:15:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:15:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44112998] [2024-11-23 23:15:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:15:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:15:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:30,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:15:30,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:15:30,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-11-23 23:15:30,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-23 23:15:30,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:15:30,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-11-23 23:15:30,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:15:30,700 INFO L124 PetriNetUnfolderBase]: 118/292 cut-off events. [2024-11-23 23:15:30,701 INFO L125 PetriNetUnfolderBase]: For 212/226 co-relation queries the response was YES. [2024-11-23 23:15:30,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 292 events. 118/292 cut-off events. For 212/226 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1278 event pairs, 19 based on Foata normal form. 7/275 useless extension candidates. Maximal degree in co-relation 713. Up to 63 conditions per place. [2024-11-23 23:15:30,703 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 22 selfloop transitions, 4 changer transitions 17/58 dead transitions. [2024-11-23 23:15:30,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 277 flow [2024-11-23 23:15:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:15:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:15:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-11-23 23:15:30,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-11-23 23:15:30,705 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 125 flow. Second operand 9 states and 143 transitions. [2024-11-23 23:15:30,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 277 flow [2024-11-23 23:15:30,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 268 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-23 23:15:30,708 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 134 flow [2024-11-23 23:15:30,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2024-11-23 23:15:30,709 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2024-11-23 23:15:30,709 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 134 flow [2024-11-23 23:15:30,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-23 23:15:30,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:15:30,709 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-23 23:15:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:15:30,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-23 23:15:30,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 123253494, now seen corresponding path program 2 times [2024-11-23 23:15:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250063184] [2024-11-23 23:15:30,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:15:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:30,793 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:15:30,793 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 23:15:30,793 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:15:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:15:30,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:15:30,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:15:30,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-23 23:15:30,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-23 23:15:30,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-23 23:15:30,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-23 23:15:30,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-23 23:15:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:15:30,925 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-23 23:15:30,977 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-23 23:15:30,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:15:30,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:15:30 BasicIcfg [2024-11-23 23:15:30,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:15:30,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:15:30,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:15:30,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:15:30,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:25" (3/4) ... [2024-11-23 23:15:30,989 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 23:15:31,117 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-23 23:15:31,171 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 23:15:31,171 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 23:15:31,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:15:31,173 INFO L158 Benchmark]: Toolchain (without parser) took 7934.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 116.7MB in the beginning and 98.5MB in the end (delta: 18.2MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-23 23:15:31,173 INFO L158 Benchmark]: CDTParser took 1.73ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:15:31,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.94ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 93.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 23:15:31,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.60ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:15:31,174 INFO L158 Benchmark]: Boogie Preprocessor took 68.19ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:15:31,174 INFO L158 Benchmark]: RCFGBuilder took 1007.42ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 114.4MB in the end (delta: -25.9MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-11-23 23:15:31,174 INFO L158 Benchmark]: TraceAbstraction took 5965.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-23 23:15:31,175 INFO L158 Benchmark]: Witness Printer took 184.72ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 98.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:15:31,176 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.73ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.94ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 93.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.60ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.19ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1007.42ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 114.4MB in the end (delta: -25.9MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5965.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 184.72ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 98.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 537 IncrementalHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 20 mSDtfsCounter, 537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-23 23:15:31,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d1be94-f0b9-4565-aa4a-14ebd3dfed29/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE