./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:14,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:14,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:02:14,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:14,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:14,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:14,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:14,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:14,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:14,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:14,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:14,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:14,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:14,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:14,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:14,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:14,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:14,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:14,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:14,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:14,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:14,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:14,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:14,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:14,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:14,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:14,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:14,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:14,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:14,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:14,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:14,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:14,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:14,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:14,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:14,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:14,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:14,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:14,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:14,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:14,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:14,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:14,972 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2024-10-31 22:02:15,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:15,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:15,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:15,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:15,272 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:15,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-10-31 22:02:17,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:17,612 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:17,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-31 22:02:17,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/data/f37d5fa18/eadcb4763f234c70ae32bcbbab2178ce/FLAGbf2ec638e [2024-10-31 22:02:17,924 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/data/f37d5fa18/eadcb4763f234c70ae32bcbbab2178ce [2024-10-31 22:02:17,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:17,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:17,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:17,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:17,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:17,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:17" (1/1) ... [2024-10-31 22:02:17,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9f0092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:17, skipping insertion in model container [2024-10-31 22:02:17,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:17" (1/1) ... [2024-10-31 22:02:17,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:18,217 WARN L251 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_aa3fe931-e7e8-47e9-a574-325261035cab/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2024-10-31 22:02:18,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:18,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:18,492 WARN L251 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_aa3fe931-e7e8-47e9-a574-325261035cab/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2024-10-31 22:02:18,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:18,627 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:18,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18 WrapperNode [2024-10-31 22:02:18,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:18,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:18,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:18,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:18,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,711 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-10-31 22:02:18,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:18,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:18,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:18,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:18,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,759 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-10-31 22:02:18,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:18,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:18,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:18,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:18,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (1/1) ... [2024-10-31 22:02:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:18,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:18,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:02:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:02:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:02:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:02:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:02:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:02:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:02:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:02:18,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:18,876 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:02:19,101 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:19,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:19,489 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:02:19,489 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:19,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:19,675 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:02:19,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:19 BoogieIcfgContainer [2024-10-31 22:02:19,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:19,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:19,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:19,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:19,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:17" (1/3) ... [2024-10-31 22:02:19,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5802bc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:19, skipping insertion in model container [2024-10-31 22:02:19,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:18" (2/3) ... [2024-10-31 22:02:19,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5802bc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:19, skipping insertion in model container [2024-10-31 22:02:19,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:19" (3/3) ... [2024-10-31 22:02:19,684 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-10-31 22:02:19,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:19,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:02:19,703 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:02:19,782 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:02:19,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-10-31 22:02:19,862 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-10-31 22:02:19,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:19,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-10-31 22:02:19,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-10-31 22:02:19,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-10-31 22:02:19,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:19,892 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;@7bd2b48b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:19,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:02:19,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:02:19,902 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-31 22:02:19,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:19,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:19,903 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:02:19,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1906582196, now seen corresponding path program 1 times [2024-10-31 22:02:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702706805] [2024-10-31 22:02:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702706805] [2024-10-31 22:02:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702706805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:20,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:02:20,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074367788] [2024-10-31 22:02:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:20,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:20,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-10-31 22:02:20,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:20,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:20,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-10-31 22:02:20,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:21,116 INFO L124 PetriNetUnfolderBase]: 528/983 cut-off events. [2024-10-31 22:02:21,119 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-31 22:02:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 983 events. 528/983 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5745 event pairs, 168 based on Foata normal form. 36/998 useless extension candidates. Maximal degree in co-relation 1820. Up to 652 conditions per place. [2024-10-31 22:02:21,147 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 27 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-10-31 22:02:21,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 166 flow [2024-10-31 22:02:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-10-31 22:02:21,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-10-31 22:02:21,174 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2024-10-31 22:02:21,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 166 flow [2024-10-31 22:02:21,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:02:21,182 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-10-31 22:02:21,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-10-31 22:02:21,191 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-10-31 22:02:21,191 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-10-31 22:02:21,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:21,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:21,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:21,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:21,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:21,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash -103316819, now seen corresponding path program 1 times [2024-10-31 22:02:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297879938] [2024-10-31 22:02:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297879938] [2024-10-31 22:02:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297879938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330677407] [2024-10-31 22:02:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:02:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:02:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:02:21,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-31 22:02:21,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:21,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:21,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-31 22:02:21,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:22,275 INFO L124 PetriNetUnfolderBase]: 1213/2071 cut-off events. [2024-10-31 22:02:22,276 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-10-31 22:02:22,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 2071 events. 1213/2071 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12674 event pairs, 147 based on Foata normal form. 80/2046 useless extension candidates. Maximal degree in co-relation 4073. Up to 1081 conditions per place. [2024-10-31 22:02:22,289 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-10-31 22:02:22,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 220 flow [2024-10-31 22:02:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:02:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:02:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-31 22:02:22,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-10-31 22:02:22,292 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 103 transitions. [2024-10-31 22:02:22,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 220 flow [2024-10-31 22:02:22,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:22,295 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-10-31 22:02:22,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-10-31 22:02:22,298 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-10-31 22:02:22,298 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-10-31 22:02:22,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:22,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:22,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:22,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:22,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:22,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 563689561, now seen corresponding path program 1 times [2024-10-31 22:02:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129017716] [2024-10-31 22:02:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129017716] [2024-10-31 22:02:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129017716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12881611] [2024-10-31 22:02:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:22,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-31 22:02:22,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:22,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:22,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-31 22:02:22,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:23,081 INFO L124 PetriNetUnfolderBase]: 809/1399 cut-off events. [2024-10-31 22:02:23,081 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-10-31 22:02:23,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 1399 events. 809/1399 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7568 event pairs, 73 based on Foata normal form. 68/1401 useless extension candidates. Maximal degree in co-relation 3193. Up to 521 conditions per place. [2024-10-31 22:02:23,092 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-10-31 22:02:23,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 309 flow [2024-10-31 22:02:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:02:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:02:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-10-31 22:02:23,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-31 22:02:23,097 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 130 transitions. [2024-10-31 22:02:23,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 309 flow [2024-10-31 22:02:23,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:23,102 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-10-31 22:02:23,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-10-31 22:02:23,103 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-10-31 22:02:23,104 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-10-31 22:02:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:23,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:23,104 INFO L204 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-10-31 22:02:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:23,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1439963883, now seen corresponding path program 1 times [2024-10-31 22:02:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085164539] [2024-10-31 22:02:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085164539] [2024-10-31 22:02:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085164539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98438241] [2024-10-31 22:02:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:02:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:02:23,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:02:23,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-31 22:02:23,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:23,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:23,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-31 22:02:23,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:24,002 INFO L124 PetriNetUnfolderBase]: 477/811 cut-off events. [2024-10-31 22:02:24,002 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-10-31 22:02:24,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 811 events. 477/811 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3693 event pairs, 59 based on Foata normal form. 36/812 useless extension candidates. Maximal degree in co-relation 2109. Up to 268 conditions per place. [2024-10-31 22:02:24,009 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-10-31 22:02:24,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 320 flow [2024-10-31 22:02:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:02:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:02:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-10-31 22:02:24,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-10-31 22:02:24,012 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 141 transitions. [2024-10-31 22:02:24,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 320 flow [2024-10-31 22:02:24,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-31 22:02:24,017 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-10-31 22:02:24,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-10-31 22:02:24,018 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-10-31 22:02:24,019 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-10-31 22:02:24,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:24,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:24,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:24,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:24,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:24,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 293523438, now seen corresponding path program 1 times [2024-10-31 22:02:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620111531] [2024-10-31 22:02:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620111531] [2024-10-31 22:02:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620111531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554341511] [2024-10-31 22:02:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:02:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:02:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:02:27,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-10-31 22:02:27,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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-10-31 22:02:27,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:27,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-10-31 22:02:27,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:29,006 INFO L124 PetriNetUnfolderBase]: 1296/2316 cut-off events. [2024-10-31 22:02:29,006 INFO L125 PetriNetUnfolderBase]: For 1134/1142 co-relation queries the response was YES. [2024-10-31 22:02:29,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5562 conditions, 2316 events. 1296/2316 cut-off events. For 1134/1142 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13724 event pairs, 316 based on Foata normal form. 16/2268 useless extension candidates. Maximal degree in co-relation 5547. Up to 712 conditions per place. [2024-10-31 22:02:29,030 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 41 selfloop transitions, 8 changer transitions 44/109 dead transitions. [2024-10-31 22:02:29,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 510 flow [2024-10-31 22:02:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:02:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-31 22:02:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions. [2024-10-31 22:02:29,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5547785547785548 [2024-10-31 22:02:29,035 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 11 states and 238 transitions. [2024-10-31 22:02:29,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 510 flow [2024-10-31 22:02:29,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 438 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-10-31 22:02:29,089 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 165 flow [2024-10-31 22:02:29,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=165, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2024-10-31 22:02:29,090 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-10-31 22:02:29,091 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 165 flow [2024-10-31 22:02:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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-10-31 22:02:29,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:29,095 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:29,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:29,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-31 22:02:29,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1066095204, now seen corresponding path program 2 times [2024-10-31 22:02:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413701337] [2024-10-31 22:02:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:29,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:29,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:29,432 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:29,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-31 22:02:29,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-31 22:02:29,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-31 22:02:29,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-31 22:02:29,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-31 22:02:29,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-31 22:02:29,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:29,441 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-10-31 22:02:29,550 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:02:29,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:02:29,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:02:29 BasicIcfg [2024-10-31 22:02:29,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:02:29,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:02:29,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:02:29,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:02:29,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:19" (3/4) ... [2024-10-31 22:02:29,562 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:02:29,689 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:02:29,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:02:29,690 INFO L158 Benchmark]: Toolchain (without parser) took 11762.36ms. Allocated memory was 148.9MB in the beginning and 323.0MB in the end (delta: 174.1MB). Free memory was 113.0MB in the beginning and 100.5MB in the end (delta: 12.5MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,694 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:29,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 698.55ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 87.0MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.68ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 84.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,695 INFO L158 Benchmark]: Boogie Preprocessor took 68.85ms. Allocated memory is still 148.9MB. Free memory was 84.1MB in the beginning and 80.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,695 INFO L158 Benchmark]: RCFGBuilder took 890.13ms. Allocated memory is still 148.9MB. Free memory was 80.3MB in the beginning and 72.3MB in the end (delta: 8.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,695 INFO L158 Benchmark]: TraceAbstraction took 9881.89ms. Allocated memory was 148.9MB in the beginning and 323.0MB in the end (delta: 174.1MB). Free memory was 71.6MB in the beginning and 112.0MB in the end (delta: -40.4MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,713 INFO L158 Benchmark]: Witness Printer took 129.84ms. Allocated memory is still 323.0MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,715 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.33ms. Allocated memory is still 107.0MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 698.55ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 87.0MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.68ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 84.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.85ms. Allocated memory is still 148.9MB. Free memory was 84.1MB in the beginning and 80.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 890.13ms. Allocated memory is still 148.9MB. Free memory was 80.3MB in the beginning and 72.3MB in the end (delta: 8.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9881.89ms. Allocated memory was 148.9MB in the beginning and 323.0MB in the end (delta: 174.1MB). Free memory was 71.6MB in the beginning and 112.0MB in the end (delta: -40.4MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. * Witness Printer took 129.84ms. Allocated memory is still 323.0MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 12 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 29, 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.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 680 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:02:29,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3fe931-e7e8-47e9-a574-325261035cab/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE