./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd --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 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:06:15,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:06:15,807 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 16:06:15,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:06:15,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:06:15,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:06:15,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:06:15,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:06:15,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:06:15,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:06:15,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:06:15,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:06:15,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:06:15,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:06:15,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:06:15,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:06:15,851 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:06:15,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:06:15,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:06:15,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:06:15,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:06:15,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:06:15,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:06:15,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:06:15,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:06:15,854 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2024-11-13 16:06:16,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:06:16,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:06:16,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:06:16,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:06:16,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:06:16,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 16:06:18,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:06:18,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:06:18,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2024-11-13 16:06:18,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/be3c8d8c1/eeb8b7d18095461d92baf55a4ae6148c/FLAGb65367c43 [2024-11-13 16:06:18,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/be3c8d8c1/eeb8b7d18095461d92baf55a4ae6148c [2024-11-13 16:06:18,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:06:18,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:06:18,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:06:18,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:06:18,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:06:18,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:06:18" (1/1) ... [2024-11-13 16:06:18,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc8db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:18, skipping insertion in model container [2024-11-13 16:06:18,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:06:18" (1/1) ... [2024-11-13 16:06:18,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:06:19,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:06:19,325 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:06:19,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:06:19,489 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:06:19,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19 WrapperNode [2024-11-13 16:06:19,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:06:19,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:06:19,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:06:19,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:06:19,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,578 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-11-13 16:06:19,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:06:19,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:06:19,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:06:19,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:06:19,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,614 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-11-13 16:06:19,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:06:19,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:06:19,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:06:19,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:06:19,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (1/1) ... [2024-11-13 16:06:19,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:06:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:19,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:06:19,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:06:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:06:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:06:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:06:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:06:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 16:06:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:06:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 16:06:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 16:06:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 16:06:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 16:06:19,745 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 16:06:19,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 16:06:19,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:06:19,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:06:19,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 16:06:19,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:06:19,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:06:19,747 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:06:19,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:06:19,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:06:20,578 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:06:20,579 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:06:21,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:06:21,375 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 16:06:21,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:21 BoogieIcfgContainer [2024-11-13 16:06:21,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:06:21,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:06:21,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:06:21,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:06:21,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:06:18" (1/3) ... [2024-11-13 16:06:21,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf12aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:06:21, skipping insertion in model container [2024-11-13 16:06:21,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:19" (2/3) ... [2024-11-13 16:06:21,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf12aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:06:21, skipping insertion in model container [2024-11-13 16:06:21,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:21" (3/3) ... [2024-11-13 16:06:21,393 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2024-11-13 16:06:21,416 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:06:21,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi009_rmo.oepc.i that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2024-11-13 16:06:21,419 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:06:21,615 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 16:06:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2024-11-13 16:06:21,794 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2024-11-13 16:06:21,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:21,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 284 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2024-11-13 16:06:21,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2024-11-13 16:06:21,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2024-11-13 16:06:21,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:06:21,840 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;@253242a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:06:21,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-11-13 16:06:21,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:06:21,853 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 16:06:21,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:21,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:21,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 16:06:21,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:21,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 22479624, now seen corresponding path program 1 times [2024-11-13 16:06:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156813530] [2024-11-13 16:06:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:22,354 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-13 16:06:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156813530] [2024-11-13 16:06:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156813530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324685152] [2024-11-13 16:06:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:22,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:22,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:22,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:22,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:22,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:22,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:24,295 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2024-11-13 16:06:24,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:24,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 42100 event pairs, 3375 based on Foata normal form. 224/3774 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2024-11-13 16:06:24,371 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-13 16:06:24,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2024-11-13 16:06:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-13 16:06:24,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2024-11-13 16:06:24,394 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 116 transitions. [2024-11-13 16:06:24,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2024-11-13 16:06:24,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 16:06:24,414 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2024-11-13 16:06:24,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-11-13 16:06:24,423 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2024-11-13 16:06:24,423 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2024-11-13 16:06:24,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:24,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:24,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 16:06:24,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:06:24,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 22479625, now seen corresponding path program 1 times [2024-11-13 16:06:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729776290] [2024-11-13 16:06:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:24,727 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-13 16:06:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729776290] [2024-11-13 16:06:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729776290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355457086] [2024-11-13 16:06:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:24,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:24,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:24,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:24,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:24,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:24,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:25,270 INFO L124 PetriNetUnfolderBase]: 818/1456 cut-off events. [2024-11-13 16:06:25,271 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:25,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1456 events. 818/1456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9876 event pairs, 818 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 2719. Up to 1239 conditions per place. [2024-11-13 16:06:25,282 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-13 16:06:25,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 132 flow [2024-11-13 16:06:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-13 16:06:25,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3670886075949367 [2024-11-13 16:06:25,284 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2024-11-13 16:06:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 132 flow [2024-11-13 16:06:25,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:25,287 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-13 16:06:25,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-13 16:06:25,290 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2024-11-13 16:06:25,290 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-13 16:06:25,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:25,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:25,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:25,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:06:25,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:25,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -354859787, now seen corresponding path program 1 times [2024-11-13 16:06:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:25,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392999603] [2024-11-13 16:06:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:25,598 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-13 16:06:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:25,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392999603] [2024-11-13 16:06:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392999603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65488780] [2024-11-13 16:06:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:25,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:25,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:25,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:25,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:25,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:26,030 INFO L124 PetriNetUnfolderBase]: 685/1362 cut-off events. [2024-11-13 16:06:26,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:26,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1362 events. 685/1362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9056 event pairs, 253 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 2432. Up to 813 conditions per place. [2024-11-13 16:06:26,040 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-13 16:06:26,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2024-11-13 16:06:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-13 16:06:26,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4092827004219409 [2024-11-13 16:06:26,043 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 97 transitions. [2024-11-13 16:06:26,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2024-11-13 16:06:26,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:26,045 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-13 16:06:26,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-13 16:06:26,048 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2024-11-13 16:06:26,048 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-13 16:06:26,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:26,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:26,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:06:26,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:26,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1717768504, now seen corresponding path program 1 times [2024-11-13 16:06:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445786899] [2024-11-13 16:06:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:26,253 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-13 16:06:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445786899] [2024-11-13 16:06:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445786899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:06:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390399388] [2024-11-13 16:06:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:26,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:26,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:26,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:26,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:26,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:26,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:26,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:26,630 INFO L124 PetriNetUnfolderBase]: 639/1360 cut-off events. [2024-11-13 16:06:26,631 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-13 16:06:26,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1360 events. 639/1360 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9582 event pairs, 141 based on Foata normal form. 0/1335 useless extension candidates. Maximal degree in co-relation 2592. Up to 742 conditions per place. [2024-11-13 16:06:26,642 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-13 16:06:26,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2024-11-13 16:06:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-13 16:06:26,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36075949367088606 [2024-11-13 16:06:26,644 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2024-11-13 16:06:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2024-11-13 16:06:26,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:26,646 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-13 16:06:26,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-13 16:06:26,647 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2024-11-13 16:06:26,647 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-13 16:06:26,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:26,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:26,648 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:26,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:06:26,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1717768503, now seen corresponding path program 1 times [2024-11-13 16:06:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931988649] [2024-11-13 16:06:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:27,163 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-13 16:06:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931988649] [2024-11-13 16:06:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931988649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:06:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238519762] [2024-11-13 16:06:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:27,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:27,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:27,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:27,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:27,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:27,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:27,537 INFO L124 PetriNetUnfolderBase]: 593/1222 cut-off events. [2024-11-13 16:06:27,537 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-11-13 16:06:27,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 1222 events. 593/1222 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7985 event pairs, 197 based on Foata normal form. 24/1233 useless extension candidates. Maximal degree in co-relation 2360. Up to 672 conditions per place. [2024-11-13 16:06:27,545 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-13 16:06:27,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-13 16:06:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-13 16:06:27,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3575949367088608 [2024-11-13 16:06:27,547 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2024-11-13 16:06:27,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-13 16:06:27,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 16:06:27,548 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-13 16:06:27,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-13 16:06:27,549 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2024-11-13 16:06:27,549 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-13 16:06:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:27,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:27,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:06:27,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1552881155, now seen corresponding path program 1 times [2024-11-13 16:06:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910344567] [2024-11-13 16:06:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:27,630 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-13 16:06:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910344567] [2024-11-13 16:06:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910344567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84917998] [2024-11-13 16:06:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:27,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2024-11-13 16:06:27,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:27,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:27,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2024-11-13 16:06:27,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:28,026 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2024-11-13 16:06:28,026 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-13 16:06:28,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7116 event pairs, 593 based on Foata normal form. 36/1086 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2024-11-13 16:06:28,036 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 16:06:28,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2024-11-13 16:06:28,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-13 16:06:28,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31645569620253167 [2024-11-13 16:06:28,039 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2024-11-13 16:06:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2024-11-13 16:06:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:28,041 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-13 16:06:28,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-13 16:06:28,042 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places. [2024-11-13 16:06:28,043 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-13 16:06:28,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:28,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:28,044 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:28,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:06:28,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1552882341, now seen corresponding path program 1 times [2024-11-13 16:06:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438854046] [2024-11-13 16:06:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:28,413 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-13 16:06:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438854046] [2024-11-13 16:06:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438854046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:06:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905932814] [2024-11-13 16:06:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:28,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:06:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:06:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:06:28,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 79 [2024-11-13 16:06:28,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:28,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:28,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 79 [2024-11-13 16:06:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:29,240 INFO L124 PetriNetUnfolderBase]: 983/1774 cut-off events. [2024-11-13 16:06:29,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:29,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 1774 events. 983/1774 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11371 event pairs, 137 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 3638. Up to 838 conditions per place. [2024-11-13 16:06:29,251 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 28 selfloop transitions, 2 changer transitions 39/82 dead transitions. [2024-11-13 16:06:29,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 328 flow [2024-11-13 16:06:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:06:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 16:06:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-11-13 16:06:29,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3275316455696203 [2024-11-13 16:06:29,254 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 207 transitions. [2024-11-13 16:06:29,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 328 flow [2024-11-13 16:06:29,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:29,256 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2024-11-13 16:06:29,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-13 16:06:29,259 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2024-11-13 16:06:29,260 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2024-11-13 16:06:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:29,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:29,262 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-13 16:06:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:06:29,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1514501302, now seen corresponding path program 1 times [2024-11-13 16:06:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414579125] [2024-11-13 16:06:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:29,810 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-13 16:06:29,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:29,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414579125] [2024-11-13 16:06:29,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414579125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:29,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:06:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555348683] [2024-11-13 16:06:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:29,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:06:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:06:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:06:29,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2024-11-13 16:06:29,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:29,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:29,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2024-11-13 16:06:29,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:30,378 INFO L124 PetriNetUnfolderBase]: 557/1146 cut-off events. [2024-11-13 16:06:30,378 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-13 16:06:30,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 1146 events. 557/1146 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7331 event pairs, 181 based on Foata normal form. 36/1161 useless extension candidates. Maximal degree in co-relation 2406. Up to 555 conditions per place. [2024-11-13 16:06:30,387 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 29 selfloop transitions, 2 changer transitions 27/72 dead transitions. [2024-11-13 16:06:30,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 305 flow [2024-11-13 16:06:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:06:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 16:06:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-11-13 16:06:30,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33634719710669075 [2024-11-13 16:06:30,390 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 7 states and 186 transitions. [2024-11-13 16:06:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 305 flow [2024-11-13 16:06:30,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 285 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 16:06:30,397 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 97 flow [2024-11-13 16:06:30,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-11-13 16:06:30,398 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -27 predicate places. [2024-11-13 16:06:30,398 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 97 flow [2024-11-13 16:06:30,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:30,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:30,398 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] [2024-11-13 16:06:30,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:06:30,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2128305549, now seen corresponding path program 1 times [2024-11-13 16:06:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800156725] [2024-11-13 16:06:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:31,966 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-13 16:06:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800156725] [2024-11-13 16:06:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800156725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:31,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:06:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298329023] [2024-11-13 16:06:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:31,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:06:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:06:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:06:31,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2024-11-13 16:06:31,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-13 16:06:31,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:31,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2024-11-13 16:06:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:32,654 INFO L124 PetriNetUnfolderBase]: 466/875 cut-off events. [2024-11-13 16:06:32,655 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-11-13 16:06:32,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 875 events. 466/875 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5107 event pairs, 58 based on Foata normal form. 24/889 useless extension candidates. Maximal degree in co-relation 2029. Up to 487 conditions per place. [2024-11-13 16:06:32,661 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 32 selfloop transitions, 4 changer transitions 21/71 dead transitions. [2024-11-13 16:06:32,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 308 flow [2024-11-13 16:06:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:06:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 16:06:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-11-13 16:06:32,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3212025316455696 [2024-11-13 16:06:32,664 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 97 flow. Second operand 8 states and 203 transitions. [2024-11-13 16:06:32,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 308 flow [2024-11-13 16:06:32,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 286 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 16:06:32,669 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 117 flow [2024-11-13 16:06:32,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2024-11-13 16:06:32,670 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2024-11-13 16:06:32,670 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 117 flow [2024-11-13 16:06:32,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-13 16:06:32,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:32,671 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] [2024-11-13 16:06:32,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:06:32,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1638579814, now seen corresponding path program 1 times [2024-11-13 16:06:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:32,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546552499] [2024-11-13 16:06:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:32,891 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-13 16:06:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546552499] [2024-11-13 16:06:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546552499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:06:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515336869] [2024-11-13 16:06:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:32,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:32,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:32,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:32,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:32,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:33,372 INFO L124 PetriNetUnfolderBase]: 1179/1899 cut-off events. [2024-11-13 16:06:33,372 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-11-13 16:06:33,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4706 conditions, 1899 events. 1179/1899 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10317 event pairs, 129 based on Foata normal form. 80/1964 useless extension candidates. Maximal degree in co-relation 4689. Up to 1057 conditions per place. [2024-11-13 16:06:33,386 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 46 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2024-11-13 16:06:33,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 315 flow [2024-11-13 16:06:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-13 16:06:33,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34177215189873417 [2024-11-13 16:06:33,388 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 117 flow. Second operand 4 states and 108 transitions. [2024-11-13 16:06:33,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 315 flow [2024-11-13 16:06:33,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 300 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-13 16:06:33,398 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 140 flow [2024-11-13 16:06:33,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2024-11-13 16:06:33,400 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -28 predicate places. [2024-11-13 16:06:33,402 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 140 flow [2024-11-13 16:06:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:33,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:33,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:33,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:06:33,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1716972171, now seen corresponding path program 1 times [2024-11-13 16:06:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395324732] [2024-11-13 16:06:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:33,758 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-13 16:06:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395324732] [2024-11-13 16:06:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395324732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:33,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:06:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356433631] [2024-11-13 16:06:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:33,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:06:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:33,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:06:33,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:06:33,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:33,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-13 16:06:33,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:33,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:34,305 INFO L124 PetriNetUnfolderBase]: 815/1347 cut-off events. [2024-11-13 16:06:34,305 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2024-11-13 16:06:34,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 1347 events. 815/1347 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6733 event pairs, 59 based on Foata normal form. 68/1400 useless extension candidates. Maximal degree in co-relation 3621. Up to 553 conditions per place. [2024-11-13 16:06:34,316 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-11-13 16:06:34,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 387 flow [2024-11-13 16:06:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:06:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 16:06:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-13 16:06:34,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34430379746835443 [2024-11-13 16:06:34,319 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 140 flow. Second operand 5 states and 136 transitions. [2024-11-13 16:06:34,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 387 flow [2024-11-13 16:06:34,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 377 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:34,324 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 180 flow [2024-11-13 16:06:34,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-11-13 16:06:34,325 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2024-11-13 16:06:34,328 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 180 flow [2024-11-13 16:06:34,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-13 16:06:34,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:34,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:34,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:06:34,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1494342914, now seen corresponding path program 1 times [2024-11-13 16:06:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867746041] [2024-11-13 16:06:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:34,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:34,669 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-13 16:06:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867746041] [2024-11-13 16:06:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867746041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:06:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452691814] [2024-11-13 16:06:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:06:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:06:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:06:34,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:34,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:34,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:34,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:34,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:35,049 INFO L124 PetriNetUnfolderBase]: 475/791 cut-off events. [2024-11-13 16:06:35,049 INFO L125 PetriNetUnfolderBase]: For 816/816 co-relation queries the response was YES. [2024-11-13 16:06:35,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 791 events. 475/791 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3399 event pairs, 45 based on Foata normal form. 36/812 useless extension candidates. Maximal degree in co-relation 2373. Up to 268 conditions per place. [2024-11-13 16:06:35,054 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 48 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-13 16:06:35,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 391 flow [2024-11-13 16:06:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:06:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:06:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-13 16:06:35,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31223628691983124 [2024-11-13 16:06:35,057 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 180 flow. Second operand 6 states and 148 transitions. [2024-11-13 16:06:35,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 391 flow [2024-11-13 16:06:35,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 347 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-13 16:06:35,064 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 181 flow [2024-11-13 16:06:35,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-11-13 16:06:35,065 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2024-11-13 16:06:35,067 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 181 flow [2024-11-13 16:06:35,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:35,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:35,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:35,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:06:35,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:35,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 392205046, now seen corresponding path program 1 times [2024-11-13 16:06:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603872731] [2024-11-13 16:06:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:35,454 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-13 16:06:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603872731] [2024-11-13 16:06:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603872731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:06:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947029663] [2024-11-13 16:06:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:06:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:06:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:06:35,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2024-11-13 16:06:35,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-13 16:06:35,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:35,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2024-11-13 16:06:35,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:35,963 INFO L124 PetriNetUnfolderBase]: 581/1185 cut-off events. [2024-11-13 16:06:35,964 INFO L125 PetriNetUnfolderBase]: For 669/679 co-relation queries the response was YES. [2024-11-13 16:06:35,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 1185 events. 581/1185 cut-off events. For 669/679 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6757 event pairs, 104 based on Foata normal form. 8/1155 useless extension candidates. Maximal degree in co-relation 2871. Up to 475 conditions per place. [2024-11-13 16:06:35,971 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 29 selfloop transitions, 1 changer transitions 23/71 dead transitions. [2024-11-13 16:06:35,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 372 flow [2024-11-13 16:06:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:06:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:06:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-13 16:06:35,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3080168776371308 [2024-11-13 16:06:35,976 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 181 flow. Second operand 6 states and 146 transitions. [2024-11-13 16:06:35,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 372 flow [2024-11-13 16:06:35,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 308 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-13 16:06:35,982 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 136 flow [2024-11-13 16:06:35,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=6, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-13 16:06:35,983 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2024-11-13 16:06:35,984 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 136 flow [2024-11-13 16:06:35,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-13 16:06:35,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:35,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:06:35,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1119357086, now seen corresponding path program 2 times [2024-11-13 16:06:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362355235] [2024-11-13 16:06:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:37,975 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-13 16:06:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362355235] [2024-11-13 16:06:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362355235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:06:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182874559] [2024-11-13 16:06:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:06:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:06:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:06:37,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2024-11-13 16:06:37,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 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-13 16:06:37,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:37,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2024-11-13 16:06:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:38,752 INFO L124 PetriNetUnfolderBase]: 529/1105 cut-off events. [2024-11-13 16:06:38,752 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-13 16:06:38,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 1105 events. 529/1105 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6471 event pairs, 134 based on Foata normal form. 8/1055 useless extension candidates. Maximal degree in co-relation 2321. Up to 316 conditions per place. [2024-11-13 16:06:38,759 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 39 selfloop transitions, 9 changer transitions 17/85 dead transitions. [2024-11-13 16:06:38,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 367 flow [2024-11-13 16:06:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:06:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 16:06:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-11-13 16:06:38,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31139240506329113 [2024-11-13 16:06:38,761 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 136 flow. Second operand 10 states and 246 transitions. [2024-11-13 16:06:38,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 367 flow [2024-11-13 16:06:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 354 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-13 16:06:38,764 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 179 flow [2024-11-13 16:06:38,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2024-11-13 16:06:38,764 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2024-11-13 16:06:38,764 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 179 flow [2024-11-13 16:06:38,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 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-13 16:06:38,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:38,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:38,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:06:38,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:38,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash 105433296, now seen corresponding path program 3 times [2024-11-13 16:06:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:38,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784972962] [2024-11-13 16:06:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:06:38,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:06:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:06:39,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:06:39,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:06:39,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2024-11-13 16:06:39,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2024-11-13 16:06:39,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2024-11-13 16:06:39,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2024-11-13 16:06:39,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2024-11-13 16:06:39,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2024-11-13 16:06:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2024-11-13 16:06:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2024-11-13 16:06:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2024-11-13 16:06:39,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2024-11-13 16:06:39,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2024-11-13 16:06:39,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2024-11-13 16:06:39,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2024-11-13 16:06:39,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2024-11-13 16:06:39,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2024-11-13 16:06:39,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2024-11-13 16:06:39,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:06:39,079 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:39,229 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:06:39,230 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:06:39,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:06:39 BasicIcfg [2024-11-13 16:06:39,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:06:39,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:06:39,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:06:39,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:06:39,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:21" (3/4) ... [2024-11-13 16:06:39,243 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:06:39,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:06:39,245 INFO L158 Benchmark]: Toolchain (without parser) took 20473.00ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 118.1MB in the beginning and 373.2MB in the end (delta: -255.1MB). Peak memory consumption was 280.9MB. Max. memory is 16.1GB. [2024-11-13 16:06:39,246 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:39,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.70ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 93.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:06:39,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.15ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:39,246 INFO L158 Benchmark]: Boogie Preprocessor took 77.89ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:39,247 INFO L158 Benchmark]: RCFGBuilder took 1717.35ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 80.3MB in the end (delta: 8.0MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-13 16:06:39,247 INFO L158 Benchmark]: TraceAbstraction took 17856.69ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 79.5MB in the beginning and 373.3MB in the end (delta: -293.8MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. [2024-11-13 16:06:39,247 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 679.5MB. Free memory was 373.3MB in the beginning and 373.2MB in the end (delta: 58.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:39,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.70ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 93.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.15ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.89ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1717.35ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 80.3MB in the end (delta: 8.0MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17856.69ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 79.5MB in the beginning and 373.3MB in the end (delta: -293.8MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 679.5MB. Free memory was 373.3MB in the beginning and 373.2MB in the end (delta: 58.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-1, t1750=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-1, t1750=0, t1751=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-1, t1750=0, t1751=1, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-1, t1750=0, t1751=1, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-1, t1750=0, t1751=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "rfi009_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 854]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 71 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: 17.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1326 IncrementalHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 7 mSDtfsCounter, 1326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 1802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-13 16:06:39,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd --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 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:06:42,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:06:42,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 16:06:42,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:06:42,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:06:42,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:06:42,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:06:42,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:06:42,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:06:42,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:06:42,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:06:42,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:06:42,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:06:42,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:06:42,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:06:42,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:06:42,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:06:42,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:06:42,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:06:42,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:06:42,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:06:42,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:06:42,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:06:42,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:06:42,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:06:42,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:06:42,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:06:42,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:06:42,431 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:06:42,431 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:06:42,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:06:42,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:06:42,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:06:42,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:06:42,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2024-11-13 16:06:42,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:06:42,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:06:42,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:06:42,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:06:42,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:06:42,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 16:06:44,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:06:45,296 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:06:45,300 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2024-11-13 16:06:45,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/3ab0086ad/bef602341a984c62a2601167d0bf6ce0/FLAG5efaa4006 [2024-11-13 16:06:45,347 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/data/3ab0086ad/bef602341a984c62a2601167d0bf6ce0 [2024-11-13 16:06:45,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:06:45,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:06:45,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:06:45,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:06:45,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:06:45,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:06:45" (1/1) ... [2024-11-13 16:06:45,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8716da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:45, skipping insertion in model container [2024-11-13 16:06:45,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:06:45" (1/1) ... [2024-11-13 16:06:45,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:06:45,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:06:45,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:06:46,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:06:46,114 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:06:46,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46 WrapperNode [2024-11-13 16:06:46,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:06:46,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:06:46,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:06:46,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:06:46,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,194 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-13 16:06:46,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:06:46,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:06:46,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:06:46,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:06:46,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,253 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-11-13 16:06:46,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:06:46,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:06:46,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:06:46,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:06:46,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (1/1) ... [2024-11-13 16:06:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:06:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:46,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:06:46,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:06:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 16:06:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 16:06:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 16:06:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 16:06:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 16:06:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 16:06:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 16:06:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 16:06:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 16:06:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 16:06:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 16:06:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:06:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:06:46,369 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:06:46,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:06:46,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:06:47,368 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:06:47,369 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:06:48,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:06:48,266 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 16:06:48,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:48 BoogieIcfgContainer [2024-11-13 16:06:48,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:06:48,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:06:48,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:06:48,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:06:48,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:06:45" (1/3) ... [2024-11-13 16:06:48,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b8f145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:06:48, skipping insertion in model container [2024-11-13 16:06:48,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:06:46" (2/3) ... [2024-11-13 16:06:48,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b8f145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:06:48, skipping insertion in model container [2024-11-13 16:06:48,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:48" (3/3) ... [2024-11-13 16:06:48,283 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2024-11-13 16:06:48,301 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:06:48,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi009_rmo.oepc.i that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2024-11-13 16:06:48,304 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:06:48,542 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 16:06:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2024-11-13 16:06:48,658 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2024-11-13 16:06:48,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:48,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 284 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2024-11-13 16:06:48,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2024-11-13 16:06:48,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2024-11-13 16:06:48,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:06:48,711 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;@1444caab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:06:48,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-11-13 16:06:48,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:06:48,719 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 16:06:48,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:48,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:48,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 16:06:48,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 22541192, now seen corresponding path program 1 times [2024-11-13 16:06:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580283942] [2024-11-13 16:06:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:48,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:48,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:48,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:06:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:48,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:06:48,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:49,067 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-13 16:06:49,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:49,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580283942] [2024-11-13 16:06:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580283942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:49,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:49,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864698720] [2024-11-13 16:06:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:49,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:49,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:49,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:49,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:49,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:51,102 INFO L124 PetriNetUnfolderBase]: 3375/5456 cut-off events. [2024-11-13 16:06:51,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:51,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10375 conditions, 5456 events. 3375/5456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 42100 event pairs, 3375 based on Foata normal form. 224/3774 useless extension candidates. Maximal degree in co-relation 10364. Up to 4872 conditions per place. [2024-11-13 16:06:51,183 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-13 16:06:51,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 161 flow [2024-11-13 16:06:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-13 16:06:51,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2024-11-13 16:06:51,205 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 116 transitions. [2024-11-13 16:06:51,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 161 flow [2024-11-13 16:06:51,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 16:06:51,222 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow [2024-11-13 16:06:51,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-11-13 16:06:51,231 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2024-11-13 16:06:51,232 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow [2024-11-13 16:06:51,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:51,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:51,233 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 16:06:51,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:06:51,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:51,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:51,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 22541193, now seen corresponding path program 1 times [2024-11-13 16:06:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429694716] [2024-11-13 16:06:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:51,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:51,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:51,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:51,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:06:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:51,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:06:51,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:51,727 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-13 16:06:51,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:51,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429694716] [2024-11-13 16:06:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429694716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512648435] [2024-11-13 16:06:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:51,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:51,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:51,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:51,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:51,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:51,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:51,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:51,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:52,232 INFO L124 PetriNetUnfolderBase]: 818/1456 cut-off events. [2024-11-13 16:06:52,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:52,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1456 events. 818/1456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9876 event pairs, 818 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 2719. Up to 1239 conditions per place. [2024-11-13 16:06:52,245 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-13 16:06:52,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 132 flow [2024-11-13 16:06:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-13 16:06:52,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3670886075949367 [2024-11-13 16:06:52,249 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 87 transitions. [2024-11-13 16:06:52,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 132 flow [2024-11-13 16:06:52,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:52,252 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-13 16:06:52,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-13 16:06:52,256 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2024-11-13 16:06:52,256 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-13 16:06:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 16:06:52,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:52,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:52,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 16:06:52,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:52,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:52,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1658063799, now seen corresponding path program 1 times [2024-11-13 16:06:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:52,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526450548] [2024-11-13 16:06:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:52,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:52,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:52,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:52,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:06:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:52,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:06:52,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:52,681 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-13 16:06:52,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:52,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526450548] [2024-11-13 16:06:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526450548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448775098] [2024-11-13 16:06:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:52,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:52,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:52,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:52,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:52,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:53,090 INFO L124 PetriNetUnfolderBase]: 685/1362 cut-off events. [2024-11-13 16:06:53,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:53,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1362 events. 685/1362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9056 event pairs, 253 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 2432. Up to 813 conditions per place. [2024-11-13 16:06:53,101 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 36 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-13 16:06:53,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 197 flow [2024-11-13 16:06:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-13 16:06:53,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4092827004219409 [2024-11-13 16:06:53,105 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 97 transitions. [2024-11-13 16:06:53,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 197 flow [2024-11-13 16:06:53,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:53,108 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-13 16:06:53,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-13 16:06:53,110 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2024-11-13 16:06:53,110 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-13 16:06:53,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:53,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:53,111 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:53,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:06:53,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:53,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -33485494, now seen corresponding path program 1 times [2024-11-13 16:06:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329141592] [2024-11-13 16:06:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:53,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:06:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:53,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:06:53,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:53,658 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-13 16:06:53,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:53,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:53,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329141592] [2024-11-13 16:06:53,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329141592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:53,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:06:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130533770] [2024-11-13 16:06:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:53,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:53,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:53,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:53,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:53,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:53,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:53,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:54,098 INFO L124 PetriNetUnfolderBase]: 639/1292 cut-off events. [2024-11-13 16:06:54,099 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-11-13 16:06:54,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1292 events. 639/1292 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8496 event pairs, 225 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 2524. Up to 742 conditions per place. [2024-11-13 16:06:54,108 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 35 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-13 16:06:54,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 200 flow [2024-11-13 16:06:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-13 16:06:54,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36075949367088606 [2024-11-13 16:06:54,110 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 114 transitions. [2024-11-13 16:06:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 200 flow [2024-11-13 16:06:54,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:54,112 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-13 16:06:54,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-13 16:06:54,113 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2024-11-13 16:06:54,114 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-13 16:06:54,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:54,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:54,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:54,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:06:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:54,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -33485493, now seen corresponding path program 1 times [2024-11-13 16:06:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481840514] [2024-11-13 16:06:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:54,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:54,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:06:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:54,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:06:54,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:54,697 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-13 16:06:54,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:54,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481840514] [2024-11-13 16:06:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481840514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:06:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896890644] [2024-11-13 16:06:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:54,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:54,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 79 [2024-11-13 16:06:54,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:54,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:54,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 79 [2024-11-13 16:06:54,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:55,116 INFO L124 PetriNetUnfolderBase]: 593/1290 cut-off events. [2024-11-13 16:06:55,117 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-13 16:06:55,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1290 events. 593/1290 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9018 event pairs, 129 based on Foata normal form. 24/1301 useless extension candidates. Maximal degree in co-relation 2428. Up to 672 conditions per place. [2024-11-13 16:06:55,125 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-13 16:06:55,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-13 16:06:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-13 16:06:55,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3575949367088608 [2024-11-13 16:06:55,129 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 113 transitions. [2024-11-13 16:06:55,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-13 16:06:55,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 16:06:55,133 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-13 16:06:55,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-13 16:06:55,134 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2024-11-13 16:06:55,134 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-13 16:06:55,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:55,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:55,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:55,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:06:55,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:55,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2135388223, now seen corresponding path program 1 times [2024-11-13 16:06:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897120029] [2024-11-13 16:06:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:55,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:55,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:55,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:06:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:55,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:06:55,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:55,536 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-13 16:06:55,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:55,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897120029] [2024-11-13 16:06:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897120029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:55,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:55,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:06:55,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130045462] [2024-11-13 16:06:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:55,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:06:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:06:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:06:55,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 79 [2024-11-13 16:06:55,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:55,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:55,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 79 [2024-11-13 16:06:55,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:55,819 INFO L124 PetriNetUnfolderBase]: 593/1087 cut-off events. [2024-11-13 16:06:55,820 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-13 16:06:55,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1087 events. 593/1087 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7090 event pairs, 593 based on Foata normal form. 36/1086 useless extension candidates. Maximal degree in co-relation 2225. Up to 906 conditions per place. [2024-11-13 16:06:55,826 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 16:06:55,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 123 flow [2024-11-13 16:06:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:06:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:06:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-13 16:06:55,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31645569620253167 [2024-11-13 16:06:55,828 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 75 transitions. [2024-11-13 16:06:55,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 123 flow [2024-11-13 16:06:55,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:55,830 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-13 16:06:55,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-13 16:06:55,830 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places. [2024-11-13 16:06:55,830 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-13 16:06:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:55,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:55,831 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:55,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:06:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:56,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2135387037, now seen corresponding path program 1 times [2024-11-13 16:06:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949024027] [2024-11-13 16:06:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:56,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:56,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:06:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:56,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:06:56,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:56,220 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-13 16:06:56,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:56,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949024027] [2024-11-13 16:06:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949024027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:06:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719849300] [2024-11-13 16:06:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:06:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:06:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:06:56,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:56,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-13 16:06:56,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:56,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:56,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:56,924 INFO L124 PetriNetUnfolderBase]: 1347/2255 cut-off events. [2024-11-13 16:06:56,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:06:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 2255 events. 1347/2255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13589 event pairs, 141 based on Foata normal form. 80/2320 useless extension candidates. Maximal degree in co-relation 4639. Up to 1297 conditions per place. [2024-11-13 16:06:56,946 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-13 16:06:56,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 226 flow [2024-11-13 16:06:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:06:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 16:06:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-13 16:06:56,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34177215189873417 [2024-11-13 16:06:56,952 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 108 transitions. [2024-11-13 16:06:56,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 226 flow [2024-11-13 16:06:56,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:06:56,954 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-13 16:06:56,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-13 16:06:56,954 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -33 predicate places. [2024-11-13 16:06:56,956 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-13 16:06:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-13 16:06:56,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:56,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:56,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:06:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:57,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1714513541, now seen corresponding path program 1 times [2024-11-13 16:06:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226997632] [2024-11-13 16:06:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:57,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:57,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:06:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:57,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:06:57,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:57,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-13 16:06:57,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:57,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226997632] [2024-11-13 16:06:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226997632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:06:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287900958] [2024-11-13 16:06:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:06:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:06:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:06:57,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:57,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-13 16:06:57,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:57,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:57,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:57,827 INFO L124 PetriNetUnfolderBase]: 863/1471 cut-off events. [2024-11-13 16:06:57,827 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-13 16:06:57,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1471 events. 863/1471 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7815 event pairs, 67 based on Foata normal form. 68/1524 useless extension candidates. Maximal degree in co-relation 3527. Up to 625 conditions per place. [2024-11-13 16:06:57,837 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-13 16:06:57,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 324 flow [2024-11-13 16:06:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:06:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 16:06:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-13 16:06:57,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34430379746835443 [2024-11-13 16:06:57,839 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 136 transitions. [2024-11-13 16:06:57,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 324 flow [2024-11-13 16:06:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 16:06:57,842 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-13 16:06:57,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-13 16:06:57,843 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2024-11-13 16:06:57,843 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-13 16:06:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-13 16:06:57,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:57,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:57,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:06:58,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:58,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:58,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 985495655, now seen corresponding path program 1 times [2024-11-13 16:06:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010544547] [2024-11-13 16:06:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:58,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:58,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:58,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:06:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:58,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:06:58,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:58,327 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-13 16:06:58,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:58,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010544547] [2024-11-13 16:06:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010544547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:06:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701707798] [2024-11-13 16:06:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:06:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:06:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:06:58,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:06:58,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:58,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:58,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:06:58,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:06:58,784 INFO L124 PetriNetUnfolderBase]: 475/799 cut-off events. [2024-11-13 16:06:58,784 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2024-11-13 16:06:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 799 events. 475/799 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3449 event pairs, 53 based on Foata normal form. 36/820 useless extension candidates. Maximal degree in co-relation 2193. Up to 268 conditions per place. [2024-11-13 16:06:58,789 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-13 16:06:58,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 333 flow [2024-11-13 16:06:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:06:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:06:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-13 16:06:58,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31223628691983124 [2024-11-13 16:06:58,791 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 148 transitions. [2024-11-13 16:06:58,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 333 flow [2024-11-13 16:06:58,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 16:06:58,796 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-13 16:06:58,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-13 16:06:58,796 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2024-11-13 16:06:58,797 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-13 16:06:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:06:58,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:06:58,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:58,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:06:58,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:58,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:06:58,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -306386540, now seen corresponding path program 1 times [2024-11-13 16:06:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:06:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923244698] [2024-11-13 16:06:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:59,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:59,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 16:06:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:59,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:06:59,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:59,366 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-13 16:06:59,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:06:59,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:06:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923244698] [2024-11-13 16:06:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923244698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:06:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565121979] [2024-11-13 16:06:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:06:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:06:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:06:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:06:59,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 79 [2024-11-13 16:06:59,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-13 16:06:59,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:06:59,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 79 [2024-11-13 16:06:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:07:00,058 INFO L124 PetriNetUnfolderBase]: 936/1585 cut-off events. [2024-11-13 16:07:00,058 INFO L125 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2024-11-13 16:07:00,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 1585 events. 936/1585 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7889 event pairs, 196 based on Foata normal form. 8/1586 useless extension candidates. Maximal degree in co-relation 4256. Up to 807 conditions per place. [2024-11-13 16:07:00,067 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 43 selfloop transitions, 7 changer transitions 39/98 dead transitions. [2024-11-13 16:07:00,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 559 flow [2024-11-13 16:07:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:07:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 16:07:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-11-13 16:07:00,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28270042194092826 [2024-11-13 16:07:00,069 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 9 states and 201 transitions. [2024-11-13 16:07:00,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 559 flow [2024-11-13 16:07:00,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 442 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-13 16:07:00,084 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 155 flow [2024-11-13 16:07:00,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-13 16:07:00,086 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2024-11-13 16:07:00,087 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 155 flow [2024-11-13 16:07:00,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-13 16:07:00,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:07:00,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:00,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 16:07:00,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:00,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:07:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 435936740, now seen corresponding path program 2 times [2024-11-13 16:07:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667463436] [2024-11-13 16:07:00,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:07:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:00,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:00,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 16:07:00,477 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 16:07:00,477 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:07:00,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 16:07:00,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:00,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 16:07:00,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:07:01,341 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-13 16:07:01,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:07:01,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667463436] [2024-11-13 16:07:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667463436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:07:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022702330] [2024-11-13 16:07:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:07:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:07:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:07:01,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:07:01,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-13 16:07:01,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:07:01,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:07:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:07:02,483 INFO L124 PetriNetUnfolderBase]: 752/1306 cut-off events. [2024-11-13 16:07:02,484 INFO L125 PetriNetUnfolderBase]: For 486/491 co-relation queries the response was YES. [2024-11-13 16:07:02,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1306 events. 752/1306 cut-off events. For 486/491 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6461 event pairs, 210 based on Foata normal form. 9/1259 useless extension candidates. Maximal degree in co-relation 3324. Up to 701 conditions per place. [2024-11-13 16:07:02,492 INFO L140 encePairwiseOnDemand]: 68/79 looper letters, 35 selfloop transitions, 13 changer transitions 37/97 dead transitions. [2024-11-13 16:07:02,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 514 flow [2024-11-13 16:07:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:07:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 16:07:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-13 16:07:02,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28607594936708863 [2024-11-13 16:07:02,495 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 155 flow. Second operand 10 states and 226 transitions. [2024-11-13 16:07:02,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 514 flow [2024-11-13 16:07:02,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 468 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 16:07:02,499 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 223 flow [2024-11-13 16:07:02,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=223, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-13 16:07:02,500 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2024-11-13 16:07:02,500 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 223 flow [2024-11-13 16:07:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-13 16:07:02,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:07:02,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:02,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 16:07:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:02,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:07:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2035735950, now seen corresponding path program 3 times [2024-11-13 16:07:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:02,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585144667] [2024-11-13 16:07:02,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:07:02,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:02,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:02,705 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:02,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 16:07:02,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 16:07:02,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:07:02,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:07:02,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:03,076 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-13 16:07:03,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:07:03,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:03,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585144667] [2024-11-13 16:07:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585144667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:03,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:07:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543873988] [2024-11-13 16:07:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:03,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:07:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:07:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:07:03,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 79 [2024-11-13 16:07:03,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 223 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-13 16:07:03,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:07:03,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 79 [2024-11-13 16:07:03,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:07:03,851 INFO L124 PetriNetUnfolderBase]: 862/1521 cut-off events. [2024-11-13 16:07:03,851 INFO L125 PetriNetUnfolderBase]: For 784/784 co-relation queries the response was YES. [2024-11-13 16:07:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 1521 events. 862/1521 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7578 event pairs, 178 based on Foata normal form. 8/1522 useless extension candidates. Maximal degree in co-relation 4136. Up to 710 conditions per place. [2024-11-13 16:07:03,859 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 51 selfloop transitions, 13 changer transitions 33/106 dead transitions. [2024-11-13 16:07:03,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 602 flow [2024-11-13 16:07:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:07:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 16:07:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2024-11-13 16:07:03,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2841068917018284 [2024-11-13 16:07:03,861 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 223 flow. Second operand 9 states and 202 transitions. [2024-11-13 16:07:03,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 602 flow [2024-11-13 16:07:03,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 569 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-13 16:07:03,868 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 245 flow [2024-11-13 16:07:03,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=245, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2024-11-13 16:07:03,869 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2024-11-13 16:07:03,871 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 245 flow [2024-11-13 16:07:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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-13 16:07:03,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:07:03,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:03,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 16:07:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:04,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:07:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 819485538, now seen corresponding path program 4 times [2024-11-13 16:07:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654674719] [2024-11-13 16:07:04,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:07:04,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:04,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:04,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:04,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 16:07:04,281 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:07:04,281 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:07:04,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 16:07:04,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:04,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 16:07:04,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:07:05,049 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-13 16:07:05,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:07:05,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654674719] [2024-11-13 16:07:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654674719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:05,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:07:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334018949] [2024-11-13 16:07:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:05,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:07:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:07:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:07:05,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2024-11-13 16:07:05,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 245 flow. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-13 16:07:05,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:07:05,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2024-11-13 16:07:05,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:07:06,051 INFO L124 PetriNetUnfolderBase]: 1044/1818 cut-off events. [2024-11-13 16:07:06,051 INFO L125 PetriNetUnfolderBase]: For 1175/1205 co-relation queries the response was YES. [2024-11-13 16:07:06,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 1818 events. 1044/1818 cut-off events. For 1175/1205 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9567 event pairs, 228 based on Foata normal form. 12/1791 useless extension candidates. Maximal degree in co-relation 4746. Up to 755 conditions per place. [2024-11-13 16:07:06,058 INFO L140 encePairwiseOnDemand]: 66/79 looper letters, 46 selfloop transitions, 16 changer transitions 42/116 dead transitions. [2024-11-13 16:07:06,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 116 transitions, 650 flow [2024-11-13 16:07:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:07:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 16:07:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2024-11-13 16:07:06,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29344073647871116 [2024-11-13 16:07:06,061 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 245 flow. Second operand 11 states and 255 transitions. [2024-11-13 16:07:06,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 116 transitions, 650 flow [2024-11-13 16:07:06,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 611 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-11-13 16:07:06,065 INFO L231 Difference]: Finished difference. Result has 76 places, 53 transitions, 290 flow [2024-11-13 16:07:06,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=76, PETRI_TRANSITIONS=53} [2024-11-13 16:07:06,066 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2024-11-13 16:07:06,066 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 53 transitions, 290 flow [2024-11-13 16:07:06,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-13 16:07:06,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:07:06,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:06,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 16:07:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:06,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-11-13 16:07:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1874572896, now seen corresponding path program 5 times [2024-11-13 16:07:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705702599] [2024-11-13 16:07:06,268 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 16:07:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:06,270 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:06,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 16:07:06,440 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 16:07:06,440 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 16:07:06,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:07:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:07:06,590 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 16:07:06,590 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:07:06,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2024-11-13 16:07:06,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2024-11-13 16:07:06,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2024-11-13 16:07:06,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2024-11-13 16:07:06,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2024-11-13 16:07:06,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2024-11-13 16:07:06,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2024-11-13 16:07:06,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2024-11-13 16:07:06,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2024-11-13 16:07:06,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2024-11-13 16:07:06,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2024-11-13 16:07:06,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2024-11-13 16:07:06,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2024-11-13 16:07:06,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2024-11-13 16:07:06,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2024-11-13 16:07:06,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2024-11-13 16:07:06,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2024-11-13 16:07:06,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2024-11-13 16:07:06,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2024-11-13 16:07:06,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2024-11-13 16:07:06,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 16:07:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:06,803 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:06,905 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:07:06,905 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:07:06,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:07:06 BasicIcfg [2024-11-13 16:07:06,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:07:06,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:07:06,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:07:06,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:07:06,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:06:48" (3/4) ... [2024-11-13 16:07:06,914 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:07:06,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:07:06,916 INFO L158 Benchmark]: Toolchain (without parser) took 21564.06ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 91.2MB in the beginning and 412.3MB in the end (delta: -321.1MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,916 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:07:06,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.98ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 66.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.35ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:07:06,917 INFO L158 Benchmark]: Boogie Preprocessor took 96.82ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.1MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,917 INFO L158 Benchmark]: RCFGBuilder took 1974.18ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 61.1MB in the beginning and 165.6MB in the end (delta: -104.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,918 INFO L158 Benchmark]: TraceAbstraction took 18640.68ms. Allocated memory was 268.4MB in the beginning and 562.0MB in the end (delta: 293.6MB). Free memory was 164.8MB in the beginning and 412.5MB in the end (delta: -247.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,918 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 562.0MB. Free memory was 412.5MB in the beginning and 412.3MB in the end (delta: 224.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:07:06,919 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.55ms. Allocated memory is still 117.4MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.98ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 66.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.35ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 96.82ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.1MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1974.18ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 61.1MB in the beginning and 165.6MB in the end (delta: -104.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18640.68ms. Allocated memory was 268.4MB in the beginning and 562.0MB in the end (delta: 293.6MB). Free memory was 164.8MB in the beginning and 412.5MB in the end (delta: -247.7MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 562.0MB. Free memory was 412.5MB in the beginning and 412.3MB in the end (delta: 224.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-2, t1750=-1, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749=-2, t1750=-1, t1751=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-2, t1750=-1, t1751=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-2, t1750=-1, t1751=0, weak$$choice0=0, weak$$choice1=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749=-2, t1750=-1, t1751=0, weak$$choice0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "rfi009_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 854]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 71 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: 18.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 584 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1923 IncrementalHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 17 mSDtfsCounter, 1923 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=13, InterpolantAutomatonStates: 74, 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.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1789 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-13 16:07:06,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b20459a7-9d88-46b0-a204-0a74c1bdb982/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample