./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB --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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:39:16,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:39:16,230 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:39:16,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:39:16,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:39:16,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:39:16,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:39:16,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:39:16,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:39:16,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:39:16,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:39:16,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:39:16,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:39:16,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:39:16,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:39:16,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:39:16,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:39:16,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:39:16,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:39:16,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:39:16,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:16,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:16,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:16,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:39:16,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:39:16,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:39:16,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:39:16,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:39:16,283 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB 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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2024-11-28 02:39:16,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:39:16,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:39:16,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:39:16,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:39:16,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:39:16,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:19,642 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/data/27dc92505/23676da51af14ab6aab41225e4446780/FLAG5e556cf0b [2024-11-28 02:39:19,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:39:19,997 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:20,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/data/27dc92505/23676da51af14ab6aab41225e4446780/FLAG5e556cf0b [2024-11-28 02:39:20,034 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/data/27dc92505/23676da51af14ab6aab41225e4446780 [2024-11-28 02:39:20,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:39:20,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:39:20,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:20,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:39:20,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:39:20,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e3218e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20, skipping insertion in model container [2024-11-28 02:39:20,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:39:20,316 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_94f72f97-d474-4d1b-9f9d-37540d8ae648/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2024-11-28 02:39:20,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:20,705 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:39:20,721 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_94f72f97-d474-4d1b-9f9d-37540d8ae648/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2024-11-28 02:39:20,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:20,851 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:39:20,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20 WrapperNode [2024-11-28 02:39:20,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:20,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:20,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:39:20,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:39:20,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,907 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-28 02:39:20,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:20,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:39:20,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:39:20,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:39:20,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,956 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-28 02:39:20,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:39:20,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:39:20,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:39:20,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:39:20,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (1/1) ... [2024-11-28 02:39:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:21,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:21,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:39:21,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:39:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 02:39:21,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:39:21,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 02:39:21,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 02:39:21,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 02:39:21,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 02:39:21,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:39:21,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 02:39:21,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:39:21,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:39:21,063 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:39:21,210 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:39:21,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:39:21,541 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:39:21,541 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:39:21,876 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:39:21,876 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 02:39:21,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:21 BoogieIcfgContainer [2024-11-28 02:39:21,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:39:21,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:39:21,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:39:21,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:39:21,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:39:20" (1/3) ... [2024-11-28 02:39:21,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d05d301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:21, skipping insertion in model container [2024-11-28 02:39:21,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:20" (2/3) ... [2024-11-28 02:39:21,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d05d301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:21, skipping insertion in model container [2024-11-28 02:39:21,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:21" (3/3) ... [2024-11-28 02:39:21,893 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:21,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:39:21,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi000_power.opt_pso.opt_rmo.opt.i that has 3 procedures, 32 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-28 02:39:21,914 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:39:21,985 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 02:39:22,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow [2024-11-28 02:39:22,088 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2024-11-28 02:39:22,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:39:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-28 02:39:22,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow [2024-11-28 02:39:22,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow [2024-11-28 02:39:22,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:39:22,128 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;@4d1947d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:39:22,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-28 02:39:22,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:39:22,144 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-28 02:39:22,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:39:22,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:22,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:39:22,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 774395167, now seen corresponding path program 1 times [2024-11-28 02:39:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723094751] [2024-11-28 02:39:22,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723094751] [2024-11-28 02:39:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723094751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:39:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873622766] [2024-11-28 02:39:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:22,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:22,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:22,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:22,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2024-11-28 02:39:22,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-28 02:39:22,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:22,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2024-11-28 02:39:22,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:23,014 INFO L124 PetriNetUnfolderBase]: 112/306 cut-off events. [2024-11-28 02:39:23,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:39:23,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 306 events. 112/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1646 event pairs, 16 based on Foata normal form. 12/312 useless extension candidates. Maximal degree in co-relation 511. Up to 160 conditions per place. [2024-11-28 02:39:23,018 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 19 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2024-11-28 02:39:23,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 124 flow [2024-11-28 02:39:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:39:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-28 02:39:23,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2024-11-28 02:39:23,039 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions. [2024-11-28 02:39:23,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 124 flow [2024-11-28 02:39:23,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:39:23,047 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 62 flow [2024-11-28 02:39:23,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-28 02:39:23,056 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-28 02:39:23,056 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 62 flow [2024-11-28 02:39:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-28 02:39:23,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:23,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:23,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:39:23,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:23,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash 602078094, now seen corresponding path program 1 times [2024-11-28 02:39:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:23,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445068322] [2024-11-28 02:39:23,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:23,533 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-28 02:39:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445068322] [2024-11-28 02:39:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445068322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:23,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192527428] [2024-11-28 02:39:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:23,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:23,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:23,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:23,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-28 02:39:23,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-28 02:39:23,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:23,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-28 02:39:23,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:23,789 INFO L124 PetriNetUnfolderBase]: 161/353 cut-off events. [2024-11-28 02:39:23,789 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-28 02:39:23,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 353 events. 161/353 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1711 event pairs, 24 based on Foata normal form. 20/349 useless extension candidates. Maximal degree in co-relation 679. Up to 166 conditions per place. [2024-11-28 02:39:23,795 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 28 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-11-28 02:39:23,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 166 flow [2024-11-28 02:39:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:39:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:39:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-28 02:39:23,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2024-11-28 02:39:23,798 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 62 flow. Second operand 4 states and 83 transitions. [2024-11-28 02:39:23,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 166 flow [2024-11-28 02:39:23,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:39:23,803 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 84 flow [2024-11-28 02:39:23,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-28 02:39:23,804 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-28 02:39:23,804 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 84 flow [2024-11-28 02:39:23,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-28 02:39:23,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:23,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:23,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:39:23,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:23,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 994939398, now seen corresponding path program 1 times [2024-11-28 02:39:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742942591] [2024-11-28 02:39:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:24,269 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-28 02:39:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742942591] [2024-11-28 02:39:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742942591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780856076] [2024-11-28 02:39:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:24,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-28 02:39:24,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-28 02:39:24,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:24,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-28 02:39:24,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:24,491 INFO L124 PetriNetUnfolderBase]: 84/190 cut-off events. [2024-11-28 02:39:24,491 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-28 02:39:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 190 events. 84/190 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 638 event pairs, 16 based on Foata normal form. 14/192 useless extension candidates. Maximal degree in co-relation 433. Up to 71 conditions per place. [2024-11-28 02:39:24,496 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 24 selfloop transitions, 6 changer transitions 1/41 dead transitions. [2024-11-28 02:39:24,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 175 flow [2024-11-28 02:39:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:39:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-11-28 02:39:24,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58125 [2024-11-28 02:39:24,497 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 84 flow. Second operand 5 states and 93 transitions. [2024-11-28 02:39:24,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 175 flow [2024-11-28 02:39:24,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 02:39:24,499 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 100 flow [2024-11-28 02:39:24,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2024-11-28 02:39:24,503 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2024-11-28 02:39:24,504 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 100 flow [2024-11-28 02:39:24,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-28 02:39:24,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:24,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:24,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:39:24,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:24,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1956459733, now seen corresponding path program 1 times [2024-11-28 02:39:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:24,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906485479] [2024-11-28 02:39:24,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:25,138 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-28 02:39:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906485479] [2024-11-28 02:39:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906485479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321560514] [2024-11-28 02:39:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:25,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:25,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-28 02:39:25,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-28 02:39:25,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:25,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-28 02:39:25,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:25,387 INFO L124 PetriNetUnfolderBase]: 108/275 cut-off events. [2024-11-28 02:39:25,387 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-28 02:39:25,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 275 events. 108/275 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1132 event pairs, 55 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 587. Up to 127 conditions per place. [2024-11-28 02:39:25,390 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 18 selfloop transitions, 2 changer transitions 11/43 dead transitions. [2024-11-28 02:39:25,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 196 flow [2024-11-28 02:39:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:39:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-11-28 02:39:25,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-28 02:39:25,392 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 100 flow. Second operand 5 states and 92 transitions. [2024-11-28 02:39:25,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 196 flow [2024-11-28 02:39:25,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 162 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 02:39:25,396 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 84 flow [2024-11-28 02:39:25,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-11-28 02:39:25,397 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2024-11-28 02:39:25,397 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 84 flow [2024-11-28 02:39:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-28 02:39:25,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:25,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:39:25,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1947584931, now seen corresponding path program 2 times [2024-11-28 02:39:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520969594] [2024-11-28 02:39:25,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:39:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:25,494 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:39:25,494 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:39:28,389 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-28 02:39:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520969594] [2024-11-28 02:39:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520969594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:39:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533627616] [2024-11-28 02:39:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:39:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:39:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:39:28,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-28 02:39:28,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 84 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:28,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:28,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-28 02:39:28,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:28,935 INFO L124 PetriNetUnfolderBase]: 116/268 cut-off events. [2024-11-28 02:39:28,935 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-28 02:39:28,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 268 events. 116/268 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 975 event pairs, 26 based on Foata normal form. 4/266 useless extension candidates. Maximal degree in co-relation 559. Up to 87 conditions per place. [2024-11-28 02:39:28,937 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 23 selfloop transitions, 8 changer transitions 16/56 dead transitions. [2024-11-28 02:39:28,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 239 flow [2024-11-28 02:39:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:39:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 02:39:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-11-28 02:39:28,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-11-28 02:39:28,939 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 84 flow. Second operand 10 states and 138 transitions. [2024-11-28 02:39:28,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 239 flow [2024-11-28 02:39:28,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 223 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 02:39:28,942 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 110 flow [2024-11-28 02:39:28,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2024-11-28 02:39:28,943 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-28 02:39:28,943 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 110 flow [2024-11-28 02:39:28,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:39:28,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:28,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:28,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:39:28,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 02:39:28,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 718177827, now seen corresponding path program 3 times [2024-11-28 02:39:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979853115] [2024-11-28 02:39:28,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:39:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:29,027 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:39:29,027 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 02:39:29,027 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:39:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:39:29,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:39:29,133 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:39:29,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-28 02:39:29,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-28 02:39:29,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-28 02:39:29,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-28 02:39:29,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-28 02:39:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:39:29,137 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-11-28 02:39:29,221 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 02:39:29,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:39:29,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:39:29 BasicIcfg [2024-11-28 02:39:29,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:39:29,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:39:29,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:39:29,230 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:39:29,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:21" (3/4) ... [2024-11-28 02:39:29,232 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 02:39:29,303 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-28 02:39:29,349 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:39:29,349 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:39:29,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:39:29,350 INFO L158 Benchmark]: Toolchain (without parser) took 9311.78ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.5MB in the beginning and 93.1MB in the end (delta: -1.6MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2024-11-28 02:39:29,351 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:39:29,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.87ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:39:29,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.18ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:39:29,351 INFO L158 Benchmark]: Boogie Preprocessor took 65.18ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:39:29,352 INFO L158 Benchmark]: RCFGBuilder took 904.23ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 73.7MB in the end (delta: -10.4MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-28 02:39:29,352 INFO L158 Benchmark]: TraceAbstraction took 7348.47ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 73.1MB in the beginning and 104.9MB in the end (delta: -31.8MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-28 02:39:29,352 INFO L158 Benchmark]: Witness Printer took 120.09ms. Allocated memory is still 234.9MB. Free memory was 104.9MB in the beginning and 93.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:39:29,354 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 812.87ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.18ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.18ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 904.23ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 73.7MB in the end (delta: -10.4MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7348.47ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 73.1MB in the beginning and 104.9MB in the end (delta: -31.8MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 120.09ms. Allocated memory is still 234.9MB. Free memory was 104.9MB in the beginning and 93.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L738] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 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) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 801]: 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, 51 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: 7.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 8 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, InterpolantAutomatonStates: 27, 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.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-28 02:39:29,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94f72f97-d474-4d1b-9f9d-37540d8ae648/bin/uautomizer-verify-aQ6SnzHsRB/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