./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:09:56,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:09:57,009 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:09:57,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:09:57,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:09:57,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:09:57,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:09:57,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:09:57,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:09:57,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:09:57,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:09:57,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:09:57,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:09:57,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:09:57,057 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:09:57,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:09:57,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:09:57,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:09:57,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:09:57,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:09:57,063 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:09:57,066 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:09:57,066 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:09:57,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:09:57,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:09:57,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:09:57,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:09:57,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:09:57,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:09:57,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:09:57,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:09:57,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:09:57,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:09:57,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:57,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:09:57,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:09:57,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:09:57,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:09:57,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:09:57,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:09:57,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:09:57,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:09:57,073 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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2024-11-08 18:09:57,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:09:57,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:09:57,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:09:57,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:09:57,446 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:09:57,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i Unable to find full path for "g++" [2024-11-08 18:09:59,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:09:59,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:09:59,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-11-08 18:09:59,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/1e66fb345/4e52d21477ea4b0ba5efa1e530f2dbe8/FLAGdb0ba755d [2024-11-08 18:09:59,964 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/1e66fb345/4e52d21477ea4b0ba5efa1e530f2dbe8 [2024-11-08 18:09:59,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:09:59,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:09:59,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:59,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:09:59,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:09:59,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:59" (1/1) ... [2024-11-08 18:09:59,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297c6072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:59, skipping insertion in model container [2024-11-08 18:09:59,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:59" (1/1) ... [2024-11-08 18:10:00,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:10:00,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:00,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:10:00,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:00,754 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:10:00,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00 WrapperNode [2024-11-08 18:10:00,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:00,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:00,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:10:00,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:10:00,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,830 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2024-11-08 18:10:00,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:00,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:10:00,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:10:00,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:10:00,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,894 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-08 18:10:00,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:10:00,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:10:00,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:10:00,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:10:00,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (1/1) ... [2024-11-08 18:10:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:01,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:10:01,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:10:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:10:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:10:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:10:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:10:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:10:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:10:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 18:10:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 18:10:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 18:10:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 18:10:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:10:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:10:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:10:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:10:01,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:10:01,119 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:10:01,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:10:01,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:10:01,907 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:10:01,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:10:02,566 WARN L1754 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-08 18:10:02,826 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:10:02,827 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:10:02,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:02 BoogieIcfgContainer [2024-11-08 18:10:02,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:10:02,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:10:02,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:10:02,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:10:02,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:09:59" (1/3) ... [2024-11-08 18:10:02,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f15dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:02, skipping insertion in model container [2024-11-08 18:10:02,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:00" (2/3) ... [2024-11-08 18:10:02,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735f15dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:02, skipping insertion in model container [2024-11-08 18:10:02,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:02" (3/3) ... [2024-11-08 18:10:02,839 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2024-11-08 18:10:02,858 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:10:02,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-08 18:10:02,859 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:10:03,115 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 18:10:03,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 92 transitions, 192 flow [2024-11-08 18:10:03,236 INFO L124 PetriNetUnfolderBase]: 29/90 cut-off events. [2024-11-08 18:10:03,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:10:03,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 29/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 283 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2024-11-08 18:10:03,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 92 transitions, 192 flow [2024-11-08 18:10:03,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 90 transitions, 186 flow [2024-11-08 18:10:03,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:10:03,274 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=None, 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;@165abdbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:10:03,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-08 18:10:03,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:10:03,280 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-11-08 18:10:03,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:10:03,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:03,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:10:03,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:03,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 743923976, now seen corresponding path program 1 times [2024-11-08 18:10:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613906705] [2024-11-08 18:10:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:03,866 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-08 18:10:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:03,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613906705] [2024-11-08 18:10:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613906705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674443938] [2024-11-08 18:10:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:03,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:03,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:03,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:03,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 18:10:03,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:03,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:03,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:05,913 INFO L124 PetriNetUnfolderBase]: 3591/6009 cut-off events. [2024-11-08 18:10:05,913 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 18:10:05,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11574 conditions, 6009 events. 3591/6009 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 48304 event pairs, 812 based on Foata normal form. 258/2993 useless extension candidates. Maximal degree in co-relation 11564. Up to 3214 conditions per place. [2024-11-08 18:10:05,967 INFO L140 encePairwiseOnDemand]: 45/92 looper letters, 65 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2024-11-08 18:10:05,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 303 flow [2024-11-08 18:10:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-08 18:10:05,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6920289855072463 [2024-11-08 18:10:05,985 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 186 flow. Second operand 3 states and 191 transitions. [2024-11-08 18:10:05,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 303 flow [2024-11-08 18:10:05,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:05,993 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 122 flow [2024-11-08 18:10:05,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-11-08 18:10:06,004 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2024-11-08 18:10:06,005 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 122 flow [2024-11-08 18:10:06,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 18:10:06,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:06,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:10:06,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:10:06,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1586807637, now seen corresponding path program 1 times [2024-11-08 18:10:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464329328] [2024-11-08 18:10:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:06,190 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-08 18:10:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464329328] [2024-11-08 18:10:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464329328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286361647] [2024-11-08 18:10:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:06,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:06,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:06,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:06,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:06,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:06,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:07,070 INFO L124 PetriNetUnfolderBase]: 1582/2799 cut-off events. [2024-11-08 18:10:07,070 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2024-11-08 18:10:07,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5809 conditions, 2799 events. 1582/2799 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 20036 event pairs, 1387 based on Foata normal form. 0/1752 useless extension candidates. Maximal degree in co-relation 5797. Up to 2466 conditions per place. [2024-11-08 18:10:07,091 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 30 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2024-11-08 18:10:07,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 170 flow [2024-11-08 18:10:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-08 18:10:07,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2753623188405797 [2024-11-08 18:10:07,093 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 122 flow. Second operand 3 states and 76 transitions. [2024-11-08 18:10:07,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 170 flow [2024-11-08 18:10:07,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:07,096 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 104 flow [2024-11-08 18:10:07,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-08 18:10:07,098 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2024-11-08 18:10:07,098 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 104 flow [2024-11-08 18:10:07,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:07,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:07,098 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:10:07,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:10:07,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1586807634, now seen corresponding path program 1 times [2024-11-08 18:10:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834286727] [2024-11-08 18:10:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:07,221 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-08 18:10:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834286727] [2024-11-08 18:10:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834286727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:07,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:07,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:10:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460287256] [2024-11-08 18:10:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:07,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:07,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:07,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:07,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:07,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:07,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:07,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:07,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:08,065 INFO L124 PetriNetUnfolderBase]: 1716/3021 cut-off events. [2024-11-08 18:10:08,066 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-11-08 18:10:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6098 conditions, 3021 events. 1716/3021 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 21454 event pairs, 948 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 6090. Up to 2228 conditions per place. [2024-11-08 18:10:08,089 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 48 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2024-11-08 18:10:08,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 270 flow [2024-11-08 18:10:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-08 18:10:08,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3442028985507246 [2024-11-08 18:10:08,093 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 104 flow. Second operand 3 states and 95 transitions. [2024-11-08 18:10:08,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 270 flow [2024-11-08 18:10:08,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:08,097 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 158 flow [2024-11-08 18:10:08,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2024-11-08 18:10:08,098 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2024-11-08 18:10:08,099 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 158 flow [2024-11-08 18:10:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:08,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:08,100 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:10:08,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:10:08,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1586807636, now seen corresponding path program 1 times [2024-11-08 18:10:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029430578] [2024-11-08 18:10:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:08,199 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-08 18:10:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029430578] [2024-11-08 18:10:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029430578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573435997] [2024-11-08 18:10:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:08,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:08,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:08,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:08,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:08,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:08,644 INFO L124 PetriNetUnfolderBase]: 542/1025 cut-off events. [2024-11-08 18:10:08,644 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2024-11-08 18:10:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 1025 events. 542/1025 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6109 event pairs, 343 based on Foata normal form. 271/1118 useless extension candidates. Maximal degree in co-relation 2615. Up to 858 conditions per place. [2024-11-08 18:10:08,652 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 28 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-08 18:10:08,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 202 flow [2024-11-08 18:10:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-11-08 18:10:08,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-11-08 18:10:08,657 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 158 flow. Second operand 3 states and 69 transitions. [2024-11-08 18:10:08,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 202 flow [2024-11-08 18:10:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 189 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:08,660 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 129 flow [2024-11-08 18:10:08,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2024-11-08 18:10:08,661 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -25 predicate places. [2024-11-08 18:10:08,661 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 129 flow [2024-11-08 18:10:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:08,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:08,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:08,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:10:08,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:08,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash -599412588, now seen corresponding path program 1 times [2024-11-08 18:10:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276924280] [2024-11-08 18:10:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:08,776 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-08 18:10:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276924280] [2024-11-08 18:10:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276924280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054579622] [2024-11-08 18:10:08,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:08,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:08,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:08,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:08,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:08,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:08,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:09,201 INFO L124 PetriNetUnfolderBase]: 448/862 cut-off events. [2024-11-08 18:10:09,201 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-08 18:10:09,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 862 events. 448/862 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4870 event pairs, 70 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 2073. Up to 649 conditions per place. [2024-11-08 18:10:09,208 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 32 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2024-11-08 18:10:09,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 247 flow [2024-11-08 18:10:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-08 18:10:09,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2644927536231884 [2024-11-08 18:10:09,210 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 129 flow. Second operand 3 states and 73 transitions. [2024-11-08 18:10:09,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 247 flow [2024-11-08 18:10:09,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:09,212 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 159 flow [2024-11-08 18:10:09,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-11-08 18:10:09,213 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -24 predicate places. [2024-11-08 18:10:09,213 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 159 flow [2024-11-08 18:10:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:09,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:09,213 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:09,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:10:09,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -509767709, now seen corresponding path program 1 times [2024-11-08 18:10:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470799479] [2024-11-08 18:10:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:09,328 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-08 18:10:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470799479] [2024-11-08 18:10:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470799479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:10:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119558321] [2024-11-08 18:10:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:09,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:09,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:09,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:09,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:09,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:09,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:09,701 INFO L124 PetriNetUnfolderBase]: 414/804 cut-off events. [2024-11-08 18:10:09,702 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2024-11-08 18:10:09,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 804 events. 414/804 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4445 event pairs, 52 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 2190. Up to 590 conditions per place. [2024-11-08 18:10:09,707 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 31 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2024-11-08 18:10:09,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 271 flow [2024-11-08 18:10:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-08 18:10:09,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22826086956521738 [2024-11-08 18:10:09,710 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 159 flow. Second operand 4 states and 84 transitions. [2024-11-08 18:10:09,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 271 flow [2024-11-08 18:10:09,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:09,713 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 155 flow [2024-11-08 18:10:09,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-11-08 18:10:09,717 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -24 predicate places. [2024-11-08 18:10:09,717 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 155 flow [2024-11-08 18:10:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:09,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:09,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:10:09,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash -509767708, now seen corresponding path program 1 times [2024-11-08 18:10:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798754798] [2024-11-08 18:10:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:09,895 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-08 18:10:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798754798] [2024-11-08 18:10:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798754798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:10:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637161934] [2024-11-08 18:10:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:09,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:09,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 18:10:09,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:09,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:09,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:10,186 INFO L124 PetriNetUnfolderBase]: 380/746 cut-off events. [2024-11-08 18:10:10,186 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2024-11-08 18:10:10,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 746 events. 380/746 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4045 event pairs, 34 based on Foata normal form. 24/689 useless extension candidates. Maximal degree in co-relation 2027. Up to 532 conditions per place. [2024-11-08 18:10:10,192 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 30 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-11-08 18:10:10,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 265 flow [2024-11-08 18:10:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-08 18:10:10,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22554347826086957 [2024-11-08 18:10:10,194 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 155 flow. Second operand 4 states and 83 transitions. [2024-11-08 18:10:10,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 265 flow [2024-11-08 18:10:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 18:10:10,197 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 150 flow [2024-11-08 18:10:10,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-11-08 18:10:10,198 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -25 predicate places. [2024-11-08 18:10:10,201 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 150 flow [2024-11-08 18:10:10,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 18:10:10,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:10,201 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:10,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:10:10,202 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:10,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash -343289159, now seen corresponding path program 1 times [2024-11-08 18:10:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374440575] [2024-11-08 18:10:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:10,267 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-08 18:10:10,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:10,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374440575] [2024-11-08 18:10:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374440575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:10,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730455873] [2024-11-08 18:10:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:10,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:10,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 92 [2024-11-08 18:10:10,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:10,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:10,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 92 [2024-11-08 18:10:10,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:10,548 INFO L124 PetriNetUnfolderBase]: 380/747 cut-off events. [2024-11-08 18:10:10,548 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-08 18:10:10,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 747 events. 380/747 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4186 event pairs, 241 based on Foata normal form. 29/689 useless extension candidates. Maximal degree in co-relation 2028. Up to 609 conditions per place. [2024-11-08 18:10:10,553 INFO L140 encePairwiseOnDemand]: 90/92 looper letters, 25 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-08 18:10:10,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 202 flow [2024-11-08 18:10:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-08 18:10:10,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20652173913043478 [2024-11-08 18:10:10,554 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 150 flow. Second operand 3 states and 57 transitions. [2024-11-08 18:10:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 202 flow [2024-11-08 18:10:10,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:10,556 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 138 flow [2024-11-08 18:10:10,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-11-08 18:10:10,557 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -26 predicate places. [2024-11-08 18:10:10,557 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 138 flow [2024-11-08 18:10:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:10,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:10,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:10:10,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash -343288051, now seen corresponding path program 1 times [2024-11-08 18:10:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866498176] [2024-11-08 18:10:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:10,790 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-08 18:10:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866498176] [2024-11-08 18:10:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866498176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:10:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158955448] [2024-11-08 18:10:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:10,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 92 [2024-11-08 18:10:10,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 18:10:10,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:10,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 92 [2024-11-08 18:10:10,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:11,191 INFO L124 PetriNetUnfolderBase]: 429/824 cut-off events. [2024-11-08 18:10:11,191 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-11-08 18:10:11,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 824 events. 429/824 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4168 event pairs, 49 based on Foata normal form. 41/793 useless extension candidates. Maximal degree in co-relation 2127. Up to 433 conditions per place. [2024-11-08 18:10:11,198 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 50 selfloop transitions, 4 changer transitions 1/62 dead transitions. [2024-11-08 18:10:11,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 370 flow [2024-11-08 18:10:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-11-08 18:10:11,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2391304347826087 [2024-11-08 18:10:11,201 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 138 flow. Second operand 4 states and 88 transitions. [2024-11-08 18:10:11,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 370 flow [2024-11-08 18:10:11,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:11,204 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 163 flow [2024-11-08 18:10:11,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-11-08 18:10:11,204 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -23 predicate places. [2024-11-08 18:10:11,205 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 163 flow [2024-11-08 18:10:11,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 18:10:11,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:11,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:11,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:10:11,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash -888524235, now seen corresponding path program 1 times [2024-11-08 18:10:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194495325] [2024-11-08 18:10:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:11,512 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-08 18:10:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194495325] [2024-11-08 18:10:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194495325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827784692] [2024-11-08 18:10:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:11,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 92 [2024-11-08 18:10:11,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-08 18:10:11,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:11,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 92 [2024-11-08 18:10:11,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:11,764 INFO L124 PetriNetUnfolderBase]: 202/403 cut-off events. [2024-11-08 18:10:11,764 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-11-08 18:10:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 403 events. 202/403 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1575 event pairs, 28 based on Foata normal form. 28/400 useless extension candidates. Maximal degree in co-relation 1158. Up to 152 conditions per place. [2024-11-08 18:10:11,767 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 40 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2024-11-08 18:10:11,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 326 flow [2024-11-08 18:10:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:10:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-11-08 18:10:11,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2 [2024-11-08 18:10:11,769 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 163 flow. Second operand 5 states and 92 transitions. [2024-11-08 18:10:11,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 326 flow [2024-11-08 18:10:11,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 315 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:11,771 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 173 flow [2024-11-08 18:10:11,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-11-08 18:10:11,772 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2024-11-08 18:10:11,772 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 173 flow [2024-11-08 18:10:11,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-08 18:10:11,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:11,773 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] [2024-11-08 18:10:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:10:11,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2070502020, now seen corresponding path program 1 times [2024-11-08 18:10:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850423931] [2024-11-08 18:10:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:12,481 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-08 18:10:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850423931] [2024-11-08 18:10:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850423931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636540707] [2024-11-08 18:10:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:10:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:10:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:12,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 92 [2024-11-08 18:10:12,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-08 18:10:12,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:12,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 92 [2024-11-08 18:10:12,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:12,789 INFO L124 PetriNetUnfolderBase]: 191/422 cut-off events. [2024-11-08 18:10:12,789 INFO L125 PetriNetUnfolderBase]: For 215/219 co-relation queries the response was YES. [2024-11-08 18:10:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 422 events. 191/422 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1825 event pairs, 56 based on Foata normal form. 9/409 useless extension candidates. Maximal degree in co-relation 1136. Up to 140 conditions per place. [2024-11-08 18:10:12,791 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 21 selfloop transitions, 3 changer transitions 25/59 dead transitions. [2024-11-08 18:10:12,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 341 flow [2024-11-08 18:10:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:10:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:10:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-11-08 18:10:12,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19384057971014493 [2024-11-08 18:10:12,793 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 173 flow. Second operand 6 states and 107 transitions. [2024-11-08 18:10:12,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 341 flow [2024-11-08 18:10:12,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 307 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-08 18:10:12,796 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 109 flow [2024-11-08 18:10:12,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2024-11-08 18:10:12,797 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2024-11-08 18:10:12,797 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 109 flow [2024-11-08 18:10:12,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-08 18:10:12,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:12,798 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] [2024-11-08 18:10:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:10:12,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:12,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1323545052, now seen corresponding path program 2 times [2024-11-08 18:10:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114590426] [2024-11-08 18:10:12,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:10:12,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:10:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:10:13,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:10:13,149 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:10:13,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2024-11-08 18:10:13,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (58 of 60 remaining) [2024-11-08 18:10:13,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2024-11-08 18:10:13,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2024-11-08 18:10:13,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2024-11-08 18:10:13,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2024-11-08 18:10:13,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2024-11-08 18:10:13,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2024-11-08 18:10:13,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2024-11-08 18:10:13,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2024-11-08 18:10:13,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2024-11-08 18:10:13,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2024-11-08 18:10:13,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2024-11-08 18:10:13,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2024-11-08 18:10:13,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2024-11-08 18:10:13,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2024-11-08 18:10:13,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2024-11-08 18:10:13,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2024-11-08 18:10:13,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2024-11-08 18:10:13,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2024-11-08 18:10:13,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2024-11-08 18:10:13,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2024-11-08 18:10:13,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2024-11-08 18:10:13,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2024-11-08 18:10:13,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2024-11-08 18:10:13,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2024-11-08 18:10:13,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (27 of 60 remaining) [2024-11-08 18:10:13,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 60 remaining) [2024-11-08 18:10:13,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2024-11-08 18:10:13,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 60 remaining) [2024-11-08 18:10:13,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2024-11-08 18:10:13,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2024-11-08 18:10:13,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2024-11-08 18:10:13,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2024-11-08 18:10:13,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2024-11-08 18:10:13,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2024-11-08 18:10:13,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2024-11-08 18:10:13,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2024-11-08 18:10:13,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2024-11-08 18:10:13,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2024-11-08 18:10:13,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2024-11-08 18:10:13,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2024-11-08 18:10:13,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2024-11-08 18:10:13,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2024-11-08 18:10:13,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2024-11-08 18:10:13,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2024-11-08 18:10:13,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2024-11-08 18:10:13,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2024-11-08 18:10:13,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2024-11-08 18:10:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:10:13,168 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:13,273 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:10:13,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:10:13,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:10:13 BasicIcfg [2024-11-08 18:10:13,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:10:13,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:10:13,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:10:13,280 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:10:13,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:02" (3/4) ... [2024-11-08 18:10:13,286 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:10:13,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:10:13,288 INFO L158 Benchmark]: Toolchain (without parser) took 13320.72ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 137.6MB in the beginning and 364.5MB in the end (delta: -226.8MB). Peak memory consumption was 233.1MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,288 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:10:13,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.84ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 113.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.57ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,290 INFO L158 Benchmark]: Boogie Preprocessor took 104.59ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,290 INFO L158 Benchmark]: RCFGBuilder took 1891.24ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 106.9MB in the beginning and 148.2MB in the end (delta: -41.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,291 INFO L158 Benchmark]: TraceAbstraction took 10447.62ms. Allocated memory was 205.5MB in the beginning and 629.1MB in the end (delta: 423.6MB). Free memory was 147.2MB in the beginning and 364.5MB in the end (delta: -217.3MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. [2024-11-08 18:10:13,291 INFO L158 Benchmark]: Witness Printer took 8.04ms. Allocated memory is still 629.1MB. Free memory is still 364.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:10:13,293 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.23ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.84ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 113.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.57ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.59ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1891.24ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 106.9MB in the beginning and 148.2MB in the end (delta: -41.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10447.62ms. Allocated memory was 205.5MB in the beginning and 629.1MB in the end (delta: 423.6MB). Free memory was 147.2MB in the beginning and 364.5MB in the end (delta: -217.3MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. * Witness Printer took 8.04ms. Allocated memory is still 629.1MB. Free memory is still 364.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=0] [L800] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 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) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 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=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L17] 0 __assert_fail ("0", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 826]: 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, 105 locations, 60 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: 10.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 3 mSDtfsCounter, 588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:10:13,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:10:15,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:10:15,809 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 18:10:15,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:10:15,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:10:15,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:10:15,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:10:15,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:10:15,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:10:15,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:10:15,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:10:15,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:10:15,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:10:15,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:10:15,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:10:15,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:10:15,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:10:15,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:10:15,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:10:15,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:10:15,867 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:10:15,871 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:10:15,871 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:10:15,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:10:15,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:10:15,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:15,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:10:15,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:10:15,878 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:10:15,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:10:15,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:10:15,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:10:15,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:10:15,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:10:15,880 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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/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_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2024-11-08 18:10:16,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:10:16,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:10:16,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:10:16,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:10:16,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:10:16,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i Unable to find full path for "g++" [2024-11-08 18:10:18,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:10:18,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:10:18,774 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-11-08 18:10:18,790 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/91ec3227c/8154b85e69b848cd880ca8559cb5a5a0/FLAG6eee83c3f [2024-11-08 18:10:19,030 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/data/91ec3227c/8154b85e69b848cd880ca8559cb5a5a0 [2024-11-08 18:10:19,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:10:19,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:10:19,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:19,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:10:19,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:10:19,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6952eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19, skipping insertion in model container [2024-11-08 18:10:19,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:10:19,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:19,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:10:19,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:19,840 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:10:19,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19 WrapperNode [2024-11-08 18:10:19,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:19,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:19,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:10:19,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:10:19,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,903 INFO L138 Inliner]: procedures = 178, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2024-11-08 18:10:19,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:19,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:10:19,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:10:19,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:10:19,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,960 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-08 18:10:19,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:19,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:10:19,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:10:19,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:10:19,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:10:20,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (1/1) ... [2024-11-08 18:10:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:20,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:10:20,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:10:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:10:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:10:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:10:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:10:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 18:10:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 18:10:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 18:10:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 18:10:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 18:10:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:10:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:10:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:10:20,082 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:10:20,273 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:10:20,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:10:20,981 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:10:20,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:10:21,656 WARN L1754 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-08 18:10:21,902 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:10:21,903 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:10:21,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:21 BoogieIcfgContainer [2024-11-08 18:10:21,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:10:21,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:10:21,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:10:21,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:10:21,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:10:19" (1/3) ... [2024-11-08 18:10:21,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccb2d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:21, skipping insertion in model container [2024-11-08 18:10:21,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:19" (2/3) ... [2024-11-08 18:10:21,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccb2d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:21, skipping insertion in model container [2024-11-08 18:10:21,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:21" (3/3) ... [2024-11-08 18:10:21,916 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2024-11-08 18:10:21,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:10:21,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-08 18:10:21,936 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:10:22,254 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 18:10:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 92 transitions, 192 flow [2024-11-08 18:10:22,364 INFO L124 PetriNetUnfolderBase]: 29/90 cut-off events. [2024-11-08 18:10:22,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:10:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 29/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 283 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2024-11-08 18:10:22,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 92 transitions, 192 flow [2024-11-08 18:10:22,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 90 transitions, 186 flow [2024-11-08 18:10:22,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:10:22,397 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=None, 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;@5c6902b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:10:22,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-08 18:10:22,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:10:22,404 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-11-08 18:10:22,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:10:22,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:22,405 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:10:22,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 745832586, now seen corresponding path program 1 times [2024-11-08 18:10:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030707870] [2024-11-08 18:10:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:22,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:22,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:22,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:22,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:10:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:22,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:10:22,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:22,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-11-08 18:10:22,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:22,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030707870] [2024-11-08 18:10:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030707870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035806349] [2024-11-08 18:10:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:22,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:22,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:22,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:22,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 18:10:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:22,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:22,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:24,872 INFO L124 PetriNetUnfolderBase]: 3591/6009 cut-off events. [2024-11-08 18:10:24,873 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 18:10:24,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11574 conditions, 6009 events. 3591/6009 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 48304 event pairs, 812 based on Foata normal form. 258/2993 useless extension candidates. Maximal degree in co-relation 11564. Up to 3214 conditions per place. [2024-11-08 18:10:24,924 INFO L140 encePairwiseOnDemand]: 45/92 looper letters, 65 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2024-11-08 18:10:24,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 303 flow [2024-11-08 18:10:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-08 18:10:24,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6920289855072463 [2024-11-08 18:10:24,939 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 186 flow. Second operand 3 states and 191 transitions. [2024-11-08 18:10:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 303 flow [2024-11-08 18:10:24,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:24,946 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 122 flow [2024-11-08 18:10:24,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-11-08 18:10:24,951 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2024-11-08 18:10:24,952 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 122 flow [2024-11-08 18:10:24,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-08 18:10:24,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:24,952 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:10:24,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:10:25,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:25,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1645974549, now seen corresponding path program 1 times [2024-11-08 18:10:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539116816] [2024-11-08 18:10:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:25,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:25,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:25,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:25,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:10:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:10:25,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:25,452 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-08 18:10:25,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:25,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539116816] [2024-11-08 18:10:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539116816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055338729] [2024-11-08 18:10:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:25,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:25,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:25,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:25,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:26,340 INFO L124 PetriNetUnfolderBase]: 1582/2799 cut-off events. [2024-11-08 18:10:26,340 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2024-11-08 18:10:26,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5809 conditions, 2799 events. 1582/2799 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 20016 event pairs, 1387 based on Foata normal form. 0/1752 useless extension candidates. Maximal degree in co-relation 5797. Up to 2466 conditions per place. [2024-11-08 18:10:26,363 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 30 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2024-11-08 18:10:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 170 flow [2024-11-08 18:10:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-08 18:10:26,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2753623188405797 [2024-11-08 18:10:26,368 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 122 flow. Second operand 3 states and 76 transitions. [2024-11-08 18:10:26,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 170 flow [2024-11-08 18:10:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:26,372 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 104 flow [2024-11-08 18:10:26,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-08 18:10:26,374 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2024-11-08 18:10:26,374 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 104 flow [2024-11-08 18:10:26,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:26,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:26,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:10:26,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:10:26,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:26,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:26,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1645974546, now seen corresponding path program 1 times [2024-11-08 18:10:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984657466] [2024-11-08 18:10:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:26,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:26,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:26,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:10:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:26,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:10:26,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:26,791 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-08 18:10:26,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:26,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984657466] [2024-11-08 18:10:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984657466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496771740] [2024-11-08 18:10:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:26,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:26,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:26,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:26,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:26,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:27,197 INFO L124 PetriNetUnfolderBase]: 477/903 cut-off events. [2024-11-08 18:10:27,198 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-08 18:10:27,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 903 events. 477/903 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5315 event pairs, 378 based on Foata normal form. 44/784 useless extension candidates. Maximal degree in co-relation 1861. Up to 761 conditions per place. [2024-11-08 18:10:27,204 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 22 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-08 18:10:27,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 138 flow [2024-11-08 18:10:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-11-08 18:10:27,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-11-08 18:10:27,206 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 104 flow. Second operand 3 states and 69 transitions. [2024-11-08 18:10:27,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 138 flow [2024-11-08 18:10:27,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:27,208 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 89 flow [2024-11-08 18:10:27,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-11-08 18:10:27,209 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -27 predicate places. [2024-11-08 18:10:27,209 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 89 flow [2024-11-08 18:10:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 18:10:27,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:27,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:27,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:27,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1105473430, now seen corresponding path program 1 times [2024-11-08 18:10:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090196420] [2024-11-08 18:10:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:27,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:27,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:27,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:10:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:10:27,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:27,583 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-08 18:10:27,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:27,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090196420] [2024-11-08 18:10:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090196420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:27,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152657734] [2024-11-08 18:10:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:27,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:27,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:27,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:27,891 INFO L124 PetriNetUnfolderBase]: 400/790 cut-off events. [2024-11-08 18:10:27,891 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-08 18:10:27,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 790 events. 400/790 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4535 event pairs, 55 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 1593. Up to 584 conditions per place. [2024-11-08 18:10:27,897 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 27 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-08 18:10:27,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 177 flow [2024-11-08 18:10:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-08 18:10:27,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2644927536231884 [2024-11-08 18:10:27,899 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 89 flow. Second operand 3 states and 73 transitions. [2024-11-08 18:10:27,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 177 flow [2024-11-08 18:10:27,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:27,901 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 110 flow [2024-11-08 18:10:27,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-11-08 18:10:27,902 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -26 predicate places. [2024-11-08 18:10:27,902 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 110 flow [2024-11-08 18:10:27,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:27,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:27,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:27,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:28,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:28,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:28,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1503155877, now seen corresponding path program 1 times [2024-11-08 18:10:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388530439] [2024-11-08 18:10:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:28,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:28,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:28,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:10:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:10:28,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:28,383 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-08 18:10:28,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:28,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:28,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388530439] [2024-11-08 18:10:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388530439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:28,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:10:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270798612] [2024-11-08 18:10:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:28,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:28,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:28,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:28,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:28,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:28,733 INFO L124 PetriNetUnfolderBase]: 371/740 cut-off events. [2024-11-08 18:10:28,733 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-11-08 18:10:28,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 740 events. 371/740 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4191 event pairs, 41 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 1719. Up to 533 conditions per place. [2024-11-08 18:10:28,738 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 26 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-08 18:10:28,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 192 flow [2024-11-08 18:10:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-08 18:10:28,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22826086956521738 [2024-11-08 18:10:28,740 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 110 flow. Second operand 4 states and 84 transitions. [2024-11-08 18:10:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 192 flow [2024-11-08 18:10:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:28,742 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 106 flow [2024-11-08 18:10:28,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-11-08 18:10:28,743 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -26 predicate places. [2024-11-08 18:10:28,743 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 106 flow [2024-11-08 18:10:28,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:28,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:28,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:28,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:10:28,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:28,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:28,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1503155878, now seen corresponding path program 1 times [2024-11-08 18:10:28,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011455219] [2024-11-08 18:10:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:28,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:28,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:28,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:28,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:10:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:10:29,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:29,228 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-08 18:10:29,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:29,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011455219] [2024-11-08 18:10:29,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011455219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:29,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:10:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871682304] [2024-11-08 18:10:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:29,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:29,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:29,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 92 [2024-11-08 18:10:29,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:29,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:29,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 92 [2024-11-08 18:10:29,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:29,525 INFO L124 PetriNetUnfolderBase]: 342/690 cut-off events. [2024-11-08 18:10:29,525 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-08 18:10:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 690 events. 342/690 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3820 event pairs, 27 based on Foata normal form. 21/637 useless extension candidates. Maximal degree in co-relation 1595. Up to 483 conditions per place. [2024-11-08 18:10:29,530 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 25 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-11-08 18:10:29,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 186 flow [2024-11-08 18:10:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-08 18:10:29,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22554347826086957 [2024-11-08 18:10:29,532 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 106 flow. Second operand 4 states and 83 transitions. [2024-11-08 18:10:29,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 186 flow [2024-11-08 18:10:29,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 173 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 18:10:29,534 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 101 flow [2024-11-08 18:10:29,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-08 18:10:29,535 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -27 predicate places. [2024-11-08 18:10:29,535 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 101 flow [2024-11-08 18:10:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:29,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:29,536 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:29,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:29,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:29,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:29,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1340993851, now seen corresponding path program 1 times [2024-11-08 18:10:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039362422] [2024-11-08 18:10:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:29,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:29,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:10:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:10:29,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:29,926 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-08 18:10:29,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:29,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039362422] [2024-11-08 18:10:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039362422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:29,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:29,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:10:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736495146] [2024-11-08 18:10:29,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:29,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:10:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:10:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:10:29,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 92 [2024-11-08 18:10:29,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:29,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:29,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 92 [2024-11-08 18:10:29,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:30,156 INFO L124 PetriNetUnfolderBase]: 342/668 cut-off events. [2024-11-08 18:10:30,157 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2024-11-08 18:10:30,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 668 events. 342/668 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3689 event pairs, 270 based on Foata normal form. 25/607 useless extension candidates. Maximal degree in co-relation 1573. Up to 551 conditions per place. [2024-11-08 18:10:30,162 INFO L140 encePairwiseOnDemand]: 90/92 looper letters, 19 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-08 18:10:30,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 141 flow [2024-11-08 18:10:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:10:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:10:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-08 18:10:30,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20652173913043478 [2024-11-08 18:10:30,163 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 101 flow. Second operand 3 states and 57 transitions. [2024-11-08 18:10:30,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 141 flow [2024-11-08 18:10:30,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:30,165 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 92 flow [2024-11-08 18:10:30,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-08 18:10:30,166 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -28 predicate places. [2024-11-08 18:10:30,166 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 92 flow [2024-11-08 18:10:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 18:10:30,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:30,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:30,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:30,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1340994959, now seen corresponding path program 1 times [2024-11-08 18:10:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049250658] [2024-11-08 18:10:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:30,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:30,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:10:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:10:30,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:30,541 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-08 18:10:30,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:30,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049250658] [2024-11-08 18:10:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049250658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:30,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:30,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:10:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3406340] [2024-11-08 18:10:30,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:30,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:30,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 92 [2024-11-08 18:10:30,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 18:10:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 92 [2024-11-08 18:10:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:30,956 INFO L124 PetriNetUnfolderBase]: 432/824 cut-off events. [2024-11-08 18:10:30,956 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-08 18:10:30,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 824 events. 432/824 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4204 event pairs, 52 based on Foata normal form. 41/789 useless extension candidates. Maximal degree in co-relation 1894. Up to 433 conditions per place. [2024-11-08 18:10:30,962 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 42 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2024-11-08 18:10:30,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 272 flow [2024-11-08 18:10:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:10:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-11-08 18:10:30,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2391304347826087 [2024-11-08 18:10:30,967 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 92 flow. Second operand 4 states and 88 transitions. [2024-11-08 18:10:30,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 272 flow [2024-11-08 18:10:30,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:10:30,969 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 117 flow [2024-11-08 18:10:30,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-11-08 18:10:30,970 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -25 predicate places. [2024-11-08 18:10:30,970 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 117 flow [2024-11-08 18:10:30,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 18:10:30,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:30,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:30,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:31,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:31,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1803815819, now seen corresponding path program 1 times [2024-11-08 18:10:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:31,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223883884] [2024-11-08 18:10:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:31,177 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:31,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:10:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:31,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:10:31,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:31,367 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-08 18:10:31,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:31,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223883884] [2024-11-08 18:10:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223883884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:31,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:31,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291573443] [2024-11-08 18:10:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:31,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:31,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:31,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:31,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 92 [2024-11-08 18:10:31,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-08 18:10:31,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:31,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 92 [2024-11-08 18:10:31,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:31,663 INFO L124 PetriNetUnfolderBase]: 204/403 cut-off events. [2024-11-08 18:10:31,663 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-08 18:10:31,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 403 events. 204/403 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1578 event pairs, 34 based on Foata normal form. 28/397 useless extension candidates. Maximal degree in co-relation 1066. Up to 152 conditions per place. [2024-11-08 18:10:31,666 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 34 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2024-11-08 18:10:31,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 254 flow [2024-11-08 18:10:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:10:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-11-08 18:10:31,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2 [2024-11-08 18:10:31,668 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 117 flow. Second operand 5 states and 92 transitions. [2024-11-08 18:10:31,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 254 flow [2024-11-08 18:10:31,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-08 18:10:31,670 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 133 flow [2024-11-08 18:10:31,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2024-11-08 18:10:31,671 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2024-11-08 18:10:31,672 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 133 flow [2024-11-08 18:10:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-08 18:10:31,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:31,672 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] [2024-11-08 18:10:31,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 18:10:31,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:31,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:31,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2059218746, now seen corresponding path program 1 times [2024-11-08 18:10:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136683485] [2024-11-08 18:10:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:31,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:31,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:31,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:10:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:32,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 18:10:32,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:32,217 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-08 18:10:32,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:32,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136683485] [2024-11-08 18:10:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136683485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:10:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050937675] [2024-11-08 18:10:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:10:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:10:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:10:32,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 92 [2024-11-08 18:10:32,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 133 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-08 18:10:32,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:10:32,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 92 [2024-11-08 18:10:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:10:32,668 INFO L124 PetriNetUnfolderBase]: 267/519 cut-off events. [2024-11-08 18:10:32,669 INFO L125 PetriNetUnfolderBase]: For 310/312 co-relation queries the response was YES. [2024-11-08 18:10:32,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 519 events. 267/519 cut-off events. For 310/312 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2041 event pairs, 95 based on Foata normal form. 8/503 useless extension candidates. Maximal degree in co-relation 1403. Up to 218 conditions per place. [2024-11-08 18:10:32,672 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 25 selfloop transitions, 5 changer transitions 33/68 dead transitions. [2024-11-08 18:10:32,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 395 flow [2024-11-08 18:10:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:10:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:10:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-11-08 18:10:32,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18167701863354038 [2024-11-08 18:10:32,674 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 133 flow. Second operand 7 states and 117 transitions. [2024-11-08 18:10:32,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 395 flow [2024-11-08 18:10:32,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 338 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-08 18:10:32,677 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 116 flow [2024-11-08 18:10:32,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2024-11-08 18:10:32,678 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -16 predicate places. [2024-11-08 18:10:32,678 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 116 flow [2024-11-08 18:10:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-08 18:10:32,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:10:32,679 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] [2024-11-08 18:10:32,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 18:10:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:32,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-08 18:10:32,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2032613860, now seen corresponding path program 2 times [2024-11-08 18:10:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917579852] [2024-11-08 18:10:32,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:10:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:32,883 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:32,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:10:33,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:10:33,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 18:10:33,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:10:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:10:33,228 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-08 18:10:33,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:10:33,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2024-11-08 18:10:33,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (58 of 60 remaining) [2024-11-08 18:10:33,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2024-11-08 18:10:33,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2024-11-08 18:10:33,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2024-11-08 18:10:33,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2024-11-08 18:10:33,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2024-11-08 18:10:33,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2024-11-08 18:10:33,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2024-11-08 18:10:33,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2024-11-08 18:10:33,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2024-11-08 18:10:33,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2024-11-08 18:10:33,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2024-11-08 18:10:33,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2024-11-08 18:10:33,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2024-11-08 18:10:33,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2024-11-08 18:10:33,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2024-11-08 18:10:33,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2024-11-08 18:10:33,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2024-11-08 18:10:33,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2024-11-08 18:10:33,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2024-11-08 18:10:33,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2024-11-08 18:10:33,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2024-11-08 18:10:33,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2024-11-08 18:10:33,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2024-11-08 18:10:33,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2024-11-08 18:10:33,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2024-11-08 18:10:33,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2024-11-08 18:10:33,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2024-11-08 18:10:33,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2024-11-08 18:10:33,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2024-11-08 18:10:33,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2024-11-08 18:10:33,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (27 of 60 remaining) [2024-11-08 18:10:33,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 60 remaining) [2024-11-08 18:10:33,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2024-11-08 18:10:33,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 60 remaining) [2024-11-08 18:10:33,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2024-11-08 18:10:33,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2024-11-08 18:10:33,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2024-11-08 18:10:33,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2024-11-08 18:10:33,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2024-11-08 18:10:33,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2024-11-08 18:10:33,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2024-11-08 18:10:33,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2024-11-08 18:10:33,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2024-11-08 18:10:33,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2024-11-08 18:10:33,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2024-11-08 18:10:33,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2024-11-08 18:10:33,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2024-11-08 18:10:33,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2024-11-08 18:10:33,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2024-11-08 18:10:33,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2024-11-08 18:10:33,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2024-11-08 18:10:33,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2024-11-08 18:10:33,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2024-11-08 18:10:33,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:33,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:33,445 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:33,563 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:10:33,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:10:33,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:10:33 BasicIcfg [2024-11-08 18:10:33,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:10:33,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:10:33,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:10:33,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:10:33,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:21" (3/4) ... [2024-11-08 18:10:33,578 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:10:33,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:10:33,580 INFO L158 Benchmark]: Toolchain (without parser) took 14546.40ms. Allocated memory was 79.7MB in the beginning and 710.9MB in the end (delta: 631.2MB). Free memory was 55.0MB in the beginning and 630.6MB in the end (delta: -575.6MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,581 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 79.7MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 143.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.15ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 49.6MB in the end (delta: 4.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.38ms. Allocated memory is still 79.7MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,583 INFO L158 Benchmark]: Boogie Preprocessor took 93.16ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 42.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,585 INFO L158 Benchmark]: RCFGBuilder took 1905.73ms. Allocated memory was 79.7MB in the beginning and 138.4MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 66.7MB in the end (delta: -24.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,586 INFO L158 Benchmark]: TraceAbstraction took 11666.87ms. Allocated memory was 138.4MB in the beginning and 710.9MB in the end (delta: 572.5MB). Free memory was 66.7MB in the beginning and 630.6MB in the end (delta: -563.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-08 18:10:33,586 INFO L158 Benchmark]: Witness Printer took 5.48ms. Allocated memory is still 710.9MB. Free memory is still 630.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:10:33,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 79.7MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 143.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.15ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 49.6MB in the end (delta: 4.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.38ms. Allocated memory is still 79.7MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.16ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 42.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1905.73ms. Allocated memory was 79.7MB in the beginning and 138.4MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 66.7MB in the end (delta: -24.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11666.87ms. Allocated memory was 138.4MB in the beginning and 710.9MB in the end (delta: 572.5MB). Free memory was 66.7MB in the beginning and 630.6MB in the end (delta: -563.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 5.48ms. Allocated memory is still 710.9MB. Free memory is still 630.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=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={3:0}, y=0] [L800] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=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={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=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={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=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={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 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) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L17] 0 __assert_fail ("0", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 826]: 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, 105 locations, 60 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: 11.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 6 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=0, InterpolantAutomatonStates: 39, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 602 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1040 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:10:33,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78391d3e-53dc-482d-a64f-728528152437/bin/uautomizer-verify-jihMAELWvX/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 Result: UNKNOWN: Overapproximated counterexample