./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:41:02,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:41:02,470 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:41:02,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:41:02,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:41:02,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:41:02,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:41:02,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:41:02,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:41:02,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:41:02,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:41:02,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:41:02,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:41:02,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:41:02,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:41:02,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:41:02,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:41:02,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:41:02,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:41:02,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:41:02,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:41:02,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:41:02,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:41:02,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:41:02,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:41:02,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:41:02,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:02,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:41:02,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:41:02,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:41:02,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:41:02,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:41:02,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:41:02,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:41:02,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:41:02,537 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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2024-11-13 14:41:03,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:41:03,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:41:03,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:41:03,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:41:03,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:41:03,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i Unable to find full path for "g++" [2024-11-13 14:41:05,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:41:06,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:41:06,282 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-13 14:41:06,307 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/dd228ae77/0402d3c448e44fa1b4bd0f58c107c0a4/FLAG9a06249f2 [2024-11-13 14:41:06,339 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/dd228ae77/0402d3c448e44fa1b4bd0f58c107c0a4 [2024-11-13 14:41:06,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:41:06,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:41:06,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:06,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:41:06,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:41:06,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:06" (1/1) ... [2024-11-13 14:41:06,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f28c439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:06, skipping insertion in model container [2024-11-13 14:41:06,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:06" (1/1) ... [2024-11-13 14:41:06,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:41:07,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:07,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:41:07,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:07,261 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:41:07,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07 WrapperNode [2024-11-13 14:41:07,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:07,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:07,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:41:07,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:41:07,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,335 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2024-11-13 14:41:07,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:07,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:41:07,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:41:07,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:41:07,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,413 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [24, 2]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 8 writes are split as follows [8, 0]. [2024-11-13 14:41:07,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:41:07,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:41:07,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:41:07,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:41:07,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (1/1) ... [2024-11-13 14:41:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:41:07,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:41:07,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:41:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:41:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:41:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:41:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:41:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:41:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:41:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:41:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:41:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:41:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:41:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:41:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:41:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 14:41:07,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 14:41:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:41:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:41:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:41:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:41:07,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:41:07,552 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 14:41:07,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:41:07,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:41:08,899 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:41:08,899 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:41:10,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:41:10,084 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:41:10,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:10 BoogieIcfgContainer [2024-11-13 14:41:10,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:41:10,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:41:10,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:41:10,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:41:10,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:41:06" (1/3) ... [2024-11-13 14:41:10,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb96e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:10, skipping insertion in model container [2024-11-13 14:41:10,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:07" (2/3) ... [2024-11-13 14:41:10,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb96e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:10, skipping insertion in model container [2024-11-13 14:41:10,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:10" (3/3) ... [2024-11-13 14:41:10,100 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-11-13 14:41:10,124 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:41:10,129 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe027_power.opt.i that has 5 procedures, 96 locations, 1 initial locations, 0 loop locations, and 49 error locations. [2024-11-13 14:41:10,130 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:41:10,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:41:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 97 transitions, 210 flow [2024-11-13 14:41:10,749 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-11-13 14:41:10,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:41:10,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 394 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-11-13 14:41:10,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 97 transitions, 210 flow [2024-11-13 14:41:10,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 198 flow [2024-11-13 14:41:10,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:41:10,817 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;@3e3c08f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:41:10,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-13 14:41:10,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:41:10,837 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-13 14:41:10,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:41:10,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:10,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 14:41:10,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:10,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 980986844, now seen corresponding path program 1 times [2024-11-13 14:41:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654519011] [2024-11-13 14:41:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:11,417 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 14:41:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654519011] [2024-11-13 14:41:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654519011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:41:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325678764] [2024-11-13 14:41:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:11,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:41:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:41:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:41:11,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:11,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:41:11,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:11,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:11,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:25,747 INFO L124 PetriNetUnfolderBase]: 41670/60435 cut-off events. [2024-11-13 14:41:25,748 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-13 14:41:25,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115766 conditions, 60435 events. 41670/60435 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3712. Compared 491337 event pairs, 41670 based on Foata normal form. 1960/38305 useless extension candidates. Maximal degree in co-relation 115754. Up to 54867 conditions per place. [2024-11-13 14:41:26,296 INFO L140 encePairwiseOnDemand]: 60/97 looper letters, 38 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2024-11-13 14:41:26,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 202 flow [2024-11-13 14:41:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:41:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:41:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-13 14:41:26,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4742268041237113 [2024-11-13 14:41:26,326 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 198 flow. Second operand 3 states and 138 transitions. [2024-11-13 14:41:26,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 202 flow [2024-11-13 14:41:26,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 14:41:26,376 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 122 flow [2024-11-13 14:41:26,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-11-13 14:41:26,388 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-13 14:41:26,389 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 122 flow [2024-11-13 14:41:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:41:26,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:26,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 14:41:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:41:26,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 980986845, now seen corresponding path program 1 times [2024-11-13 14:41:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687820611] [2024-11-13 14:41:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:26,740 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 14:41:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687820611] [2024-11-13 14:41:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687820611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:26,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:41:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152338742] [2024-11-13 14:41:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:26,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:41:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:41:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:41:26,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:26,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:41:26,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:26,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:26,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:30,263 INFO L124 PetriNetUnfolderBase]: 5844/9113 cut-off events. [2024-11-13 14:41:30,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:41:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 9113 events. 5844/9113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 64985 event pairs, 5844 based on Foata normal form. 0/8156 useless extension candidates. Maximal degree in co-relation 17250. Up to 7981 conditions per place. [2024-11-13 14:41:30,337 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 28 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-13 14:41:30,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 46 transitions, 160 flow [2024-11-13 14:41:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:41:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:41:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-13 14:41:30,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35051546391752575 [2024-11-13 14:41:30,340 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 122 flow. Second operand 3 states and 102 transitions. [2024-11-13 14:41:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 46 transitions, 160 flow [2024-11-13 14:41:30,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 46 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:41:30,342 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 103 flow [2024-11-13 14:41:30,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=103, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-13 14:41:30,343 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:41:30,343 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 103 flow [2024-11-13 14:41:30,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:41:30,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:30,344 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:41:30,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:41:30,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:30,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 343889124, now seen corresponding path program 1 times [2024-11-13 14:41:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:30,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163681657] [2024-11-13 14:41:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:30,722 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 14:41:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163681657] [2024-11-13 14:41:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163681657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:41:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892410645] [2024-11-13 14:41:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:30,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:41:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:41:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:41:30,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:30,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:41:30,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:30,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:30,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:32,524 INFO L124 PetriNetUnfolderBase]: 4591/7092 cut-off events. [2024-11-13 14:41:32,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:41:32,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13527 conditions, 7092 events. 4591/7092 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 47575 event pairs, 1360 based on Foata normal form. 0/6756 useless extension candidates. Maximal degree in co-relation 13520. Up to 5038 conditions per place. [2024-11-13 14:41:32,567 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2024-11-13 14:41:32,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 245 flow [2024-11-13 14:41:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:41:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:41:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-13 14:41:32,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2024-11-13 14:41:32,570 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 103 flow. Second operand 3 states and 113 transitions. [2024-11-13 14:41:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 245 flow [2024-11-13 14:41:32,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:41:32,571 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 102 flow [2024-11-13 14:41:32,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-13 14:41:32,573 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:41:32,573 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 102 flow [2024-11-13 14:41:32,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:41:32,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:32,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:41:32,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2128680646, now seen corresponding path program 1 times [2024-11-13 14:41:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264663467] [2024-11-13 14:41:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:32,801 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 14:41:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264663467] [2024-11-13 14:41:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264663467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:41:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150014569] [2024-11-13 14:41:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:32,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:41:32,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:41:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:41:32,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:32,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:41:32,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:32,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:34,564 INFO L124 PetriNetUnfolderBase]: 3961/6222 cut-off events. [2024-11-13 14:41:34,564 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-13 14:41:34,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12184 conditions, 6222 events. 3961/6222 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41240 event pairs, 1309 based on Foata normal form. 0/5967 useless extension candidates. Maximal degree in co-relation 12176. Up to 4477 conditions per place. [2024-11-13 14:41:34,623 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 41 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-13 14:41:34,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 224 flow [2024-11-13 14:41:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:41:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:41:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-13 14:41:34,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3711340206185567 [2024-11-13 14:41:34,626 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 102 flow. Second operand 3 states and 108 transitions. [2024-11-13 14:41:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 224 flow [2024-11-13 14:41:34,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:41:34,631 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2024-11-13 14:41:34,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-13 14:41:34,632 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:41:34,632 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2024-11-13 14:41:34,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:41:34,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:34,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:41:34,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:34,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1257550359, now seen corresponding path program 1 times [2024-11-13 14:41:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578206093] [2024-11-13 14:41:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:34,929 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 14:41:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578206093] [2024-11-13 14:41:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578206093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:41:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620455485] [2024-11-13 14:41:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:34,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:34,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:41:34,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:34,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:34,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:36,372 INFO L124 PetriNetUnfolderBase]: 3664/5817 cut-off events. [2024-11-13 14:41:36,372 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-13 14:41:36,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11735 conditions, 5817 events. 3664/5817 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38526 event pairs, 1165 based on Foata normal form. 0/5778 useless extension candidates. Maximal degree in co-relation 11726. Up to 4071 conditions per place. [2024-11-13 14:41:36,427 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 40 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-13 14:41:36,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 222 flow [2024-11-13 14:41:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:41:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-13 14:41:36,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.327319587628866 [2024-11-13 14:41:36,430 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 127 transitions. [2024-11-13 14:41:36,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 222 flow [2024-11-13 14:41:36,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:41:36,437 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2024-11-13 14:41:36,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-11-13 14:41:36,438 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:41:36,438 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2024-11-13 14:41:36,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:41:36,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:36,439 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:36,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:41:36,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1257550358, now seen corresponding path program 1 times [2024-11-13 14:41:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268320736] [2024-11-13 14:41:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,934 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 14:41:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268320736] [2024-11-13 14:41:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268320736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:41:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342910752] [2024-11-13 14:41:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:36,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:41:36,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:41:36,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:36,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:41:36,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:38,291 INFO L124 PetriNetUnfolderBase]: 3367/5412 cut-off events. [2024-11-13 14:41:38,291 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-13 14:41:38,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 5412 events. 3367/5412 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35645 event pairs, 1021 based on Foata normal form. 108/5481 useless extension candidates. Maximal degree in co-relation 10808. Up to 3666 conditions per place. [2024-11-13 14:41:38,329 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-13 14:41:38,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 216 flow [2024-11-13 14:41:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:41:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-11-13 14:41:38,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2024-11-13 14:41:38,331 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 126 transitions. [2024-11-13 14:41:38,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 216 flow [2024-11-13 14:41:38,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:41:38,334 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2024-11-13 14:41:38,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-13 14:41:38,335 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -47 predicate places. [2024-11-13 14:41:38,335 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2024-11-13 14:41:38,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:41:38,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:38,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:41:38,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1699449141, now seen corresponding path program 1 times [2024-11-13 14:41:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171727360] [2024-11-13 14:41:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,436 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 14:41:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171727360] [2024-11-13 14:41:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171727360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:38,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:41:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999425540] [2024-11-13 14:41:38,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:41:38,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:41:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:41:38,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:41:38,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:41:38,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:38,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:41:38,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:40,351 INFO L124 PetriNetUnfolderBase]: 3367/5409 cut-off events. [2024-11-13 14:41:40,351 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-13 14:41:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10813 conditions, 5409 events. 3367/5409 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 36945 event pairs, 3367 based on Foata normal form. 144/5415 useless extension candidates. Maximal degree in co-relation 10805. Up to 4646 conditions per place. [2024-11-13 14:41:40,386 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 23 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-13 14:41:40,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 147 flow [2024-11-13 14:41:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:41:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:41:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-13 14:41:40,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29553264604810997 [2024-11-13 14:41:40,388 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 86 transitions. [2024-11-13 14:41:40,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 147 flow [2024-11-13 14:41:40,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:41:40,391 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2024-11-13 14:41:40,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-13 14:41:40,392 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -48 predicate places. [2024-11-13 14:41:40,392 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2024-11-13 14:41:40,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:41:40,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:40,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:40,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:41:40,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1699450990, now seen corresponding path program 1 times [2024-11-13 14:41:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007014881] [2024-11-13 14:41:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:40,767 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 14:41:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007014881] [2024-11-13 14:41:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007014881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:40,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898692315] [2024-11-13 14:41:40,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:40,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:41:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:41:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:41:40,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 97 [2024-11-13 14:41:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 14:41:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:40,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 97 [2024-11-13 14:41:40,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:43,735 INFO L124 PetriNetUnfolderBase]: 5559/8770 cut-off events. [2024-11-13 14:41:43,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:41:43,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 8770 events. 5559/8770 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 59483 event pairs, 1255 based on Foata normal form. 0/8549 useless extension candidates. Maximal degree in co-relation 17610. Up to 4327 conditions per place. [2024-11-13 14:41:43,779 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 40 selfloop transitions, 2 changer transitions 54/110 dead transitions. [2024-11-13 14:41:43,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 444 flow [2024-11-13 14:41:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:41:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:41:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2024-11-13 14:41:43,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32216494845360827 [2024-11-13 14:41:43,781 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 8 states and 250 transitions. [2024-11-13 14:41:43,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 444 flow [2024-11-13 14:41:43,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:41:43,787 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 107 flow [2024-11-13 14:41:43,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2024-11-13 14:41:43,789 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2024-11-13 14:41:43,789 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 107 flow [2024-11-13 14:41:43,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 14:41:43,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:43,790 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 14:41:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:41:43,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:43,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1865231953, now seen corresponding path program 1 times [2024-11-13 14:41:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294631430] [2024-11-13 14:41:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:44,160 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 14:41:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294631430] [2024-11-13 14:41:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294631430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:44,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:41:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352818267] [2024-11-13 14:41:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:41:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:44,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:41:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:41:44,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 97 [2024-11-13 14:41:44,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 14:41:44,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:44,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 97 [2024-11-13 14:41:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:47,010 INFO L124 PetriNetUnfolderBase]: 6991/10691 cut-off events. [2024-11-13 14:41:47,010 INFO L125 PetriNetUnfolderBase]: For 1210/1210 co-relation queries the response was YES. [2024-11-13 14:41:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23613 conditions, 10691 events. 6991/10691 cut-off events. For 1210/1210 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 71666 event pairs, 1143 based on Foata normal form. 192/10712 useless extension candidates. Maximal degree in co-relation 23599. Up to 3913 conditions per place. [2024-11-13 14:41:47,077 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 43 selfloop transitions, 3 changer transitions 47/106 dead transitions. [2024-11-13 14:41:47,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 454 flow [2024-11-13 14:41:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:41:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:41:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-11-13 14:41:47,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3079896907216495 [2024-11-13 14:41:47,079 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 107 flow. Second operand 8 states and 239 transitions. [2024-11-13 14:41:47,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 454 flow [2024-11-13 14:41:47,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 432 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 14:41:47,153 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 117 flow [2024-11-13 14:41:47,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2024-11-13 14:41:47,154 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-13 14:41:47,155 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 117 flow [2024-11-13 14:41:47,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 14:41:47,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:47,155 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] [2024-11-13 14:41:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:41:47,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -239763760, now seen corresponding path program 1 times [2024-11-13 14:41:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89359519] [2024-11-13 14:41:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:47,478 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 14:41:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89359519] [2024-11-13 14:41:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89359519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021531399] [2024-11-13 14:41:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:47,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:41:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:41:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:41:47,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:41:47,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 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 14:41:47,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:47,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:41:47,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:48,968 INFO L124 PetriNetUnfolderBase]: 3142/5112 cut-off events. [2024-11-13 14:41:48,968 INFO L125 PetriNetUnfolderBase]: For 1708/1724 co-relation queries the response was YES. [2024-11-13 14:41:48,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11163 conditions, 5112 events. 3142/5112 cut-off events. For 1708/1724 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 33780 event pairs, 493 based on Foata normal form. 144/5208 useless extension candidates. Maximal degree in co-relation 11147. Up to 2938 conditions per place. [2024-11-13 14:41:49,006 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 34 selfloop transitions, 2 changer transitions 37/88 dead transitions. [2024-11-13 14:41:49,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 381 flow [2024-11-13 14:41:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:41:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:41:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-11-13 14:41:49,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3166421207658321 [2024-11-13 14:41:49,009 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 117 flow. Second operand 7 states and 215 transitions. [2024-11-13 14:41:49,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 381 flow [2024-11-13 14:41:49,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 349 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-13 14:41:49,044 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 113 flow [2024-11-13 14:41:49,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2024-11-13 14:41:49,045 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2024-11-13 14:41:49,045 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 113 flow [2024-11-13 14:41:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 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 14:41:49,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:49,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:41:49,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash -485852255, now seen corresponding path program 1 times [2024-11-13 14:41:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487598565] [2024-11-13 14:41:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:51,325 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 14:41:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487598565] [2024-11-13 14:41:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487598565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:41:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905386569] [2024-11-13 14:41:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:41:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:41:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:41:51,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:41:51,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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 14:41:51,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:41:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:52,962 INFO L124 PetriNetUnfolderBase]: 3166/5082 cut-off events. [2024-11-13 14:41:52,962 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2024-11-13 14:41:52,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11027 conditions, 5082 events. 3166/5082 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32431 event pairs, 1460 based on Foata normal form. 134/5154 useless extension candidates. Maximal degree in co-relation 11012. Up to 2763 conditions per place. [2024-11-13 14:41:52,985 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 51 selfloop transitions, 9 changer transitions 49/124 dead transitions. [2024-11-13 14:41:52,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 534 flow [2024-11-13 14:41:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:41:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 14:41:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-11-13 14:41:52,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31115276476101217 [2024-11-13 14:41:52,988 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 113 flow. Second operand 11 states and 332 transitions. [2024-11-13 14:41:52,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 534 flow [2024-11-13 14:41:53,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 508 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-13 14:41:53,010 INFO L231 Difference]: Finished difference. Result has 75 places, 46 transitions, 191 flow [2024-11-13 14:41:53,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=191, PETRI_PLACES=75, PETRI_TRANSITIONS=46} [2024-11-13 14:41:53,011 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -29 predicate places. [2024-11-13 14:41:53,011 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 46 transitions, 191 flow [2024-11-13 14:41:53,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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 14:41:53,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:53,012 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] [2024-11-13 14:41:53,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:41:53,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:53,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 516583743, now seen corresponding path program 1 times [2024-11-13 14:41:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795455036] [2024-11-13 14:41:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,325 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 14:41:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795455036] [2024-11-13 14:41:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795455036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:53,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:41:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437765001] [2024-11-13 14:41:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:53,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:53,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:53,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:41:53,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 46 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 14:41:53,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:53,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:41:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:55,455 INFO L124 PetriNetUnfolderBase]: 9491/13456 cut-off events. [2024-11-13 14:41:55,456 INFO L125 PetriNetUnfolderBase]: For 17221/17516 co-relation queries the response was YES. [2024-11-13 14:41:55,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41454 conditions, 13456 events. 9491/13456 cut-off events. For 17221/17516 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 78484 event pairs, 1015 based on Foata normal form. 466/13809 useless extension candidates. Maximal degree in co-relation 41434. Up to 7909 conditions per place. [2024-11-13 14:41:55,558 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 71 selfloop transitions, 6 changer transitions 1/88 dead transitions. [2024-11-13 14:41:55,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 545 flow [2024-11-13 14:41:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:41:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-11-13 14:41:55,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32216494845360827 [2024-11-13 14:41:55,560 INFO L175 Difference]: Start difference. First operand has 75 places, 46 transitions, 191 flow. Second operand 4 states and 125 transitions. [2024-11-13 14:41:55,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 545 flow [2024-11-13 14:41:55,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 520 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-13 14:41:55,618 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 218 flow [2024-11-13 14:41:55,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-13 14:41:55,618 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -35 predicate places. [2024-11-13 14:41:55,619 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 218 flow [2024-11-13 14:41:55,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 14:41:55,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:55,619 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 14:41:55,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:41:55,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -976245280, now seen corresponding path program 1 times [2024-11-13 14:41:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:55,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934994316] [2024-11-13 14:41:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:55,979 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 14:41:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934994316] [2024-11-13 14:41:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934994316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555010002] [2024-11-13 14:41:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:41:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:41:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:41:55,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:41:55,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 14:41:55,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:55,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:41:55,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:41:57,972 INFO L124 PetriNetUnfolderBase]: 7275/10444 cut-off events. [2024-11-13 14:41:57,973 INFO L125 PetriNetUnfolderBase]: For 14378/14646 co-relation queries the response was YES. [2024-11-13 14:41:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33719 conditions, 10444 events. 7275/10444 cut-off events. For 14378/14646 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 58701 event pairs, 429 based on Foata normal form. 431/10783 useless extension candidates. Maximal degree in co-relation 33700. Up to 5101 conditions per place. [2024-11-13 14:41:58,031 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 90 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2024-11-13 14:41:58,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 717 flow [2024-11-13 14:41:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:41:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:41:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-13 14:41:58,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32577319587628867 [2024-11-13 14:41:58,032 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 218 flow. Second operand 5 states and 158 transitions. [2024-11-13 14:41:58,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 717 flow [2024-11-13 14:41:58,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 706 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:41:58,040 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 270 flow [2024-11-13 14:41:58,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2024-11-13 14:41:58,040 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -31 predicate places. [2024-11-13 14:41:58,041 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 270 flow [2024-11-13 14:41:58,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 14:41:58,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:41:58,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:58,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:41:58,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:41:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -107651627, now seen corresponding path program 1 times [2024-11-13 14:41:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585532142] [2024-11-13 14:41:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:41:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:58,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585532142] [2024-11-13 14:41:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585532142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:58,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:41:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710105266] [2024-11-13 14:41:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:58,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:41:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:41:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:41:58,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:41:58,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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 14:41:58,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:41:58,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:41:58,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:00,163 INFO L124 PetriNetUnfolderBase]: 4531/6560 cut-off events. [2024-11-13 14:42:00,163 INFO L125 PetriNetUnfolderBase]: For 12159/12433 co-relation queries the response was YES. [2024-11-13 14:42:00,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22321 conditions, 6560 events. 4531/6560 cut-off events. For 12159/12433 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 33808 event pairs, 263 based on Foata normal form. 297/6771 useless extension candidates. Maximal degree in co-relation 22300. Up to 1885 conditions per place. [2024-11-13 14:42:00,220 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 97 selfloop transitions, 14 changer transitions 1/122 dead transitions. [2024-11-13 14:42:00,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 122 transitions, 842 flow [2024-11-13 14:42:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:42:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-13 14:42:00,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2024-11-13 14:42:00,223 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 270 flow. Second operand 6 states and 189 transitions. [2024-11-13 14:42:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 122 transitions, 842 flow [2024-11-13 14:42:00,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 812 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 14:42:00,255 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 320 flow [2024-11-13 14:42:00,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-11-13 14:42:00,256 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -28 predicate places. [2024-11-13 14:42:00,256 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 320 flow [2024-11-13 14:42:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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 14:42:00,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:00,256 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, 1, 1] [2024-11-13 14:42:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:42:00,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 156717809, now seen corresponding path program 1 times [2024-11-13 14:42:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910173653] [2024-11-13 14:42:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:00,817 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 14:42:00,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:00,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910173653] [2024-11-13 14:42:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910173653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:00,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857957077] [2024-11-13 14:42:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:00,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:42:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:42:00,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:00,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:42:00,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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 14:42:00,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:00,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:42:00,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:02,049 INFO L124 PetriNetUnfolderBase]: 2963/4236 cut-off events. [2024-11-13 14:42:02,049 INFO L125 PetriNetUnfolderBase]: For 10292/10566 co-relation queries the response was YES. [2024-11-13 14:42:02,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15406 conditions, 4236 events. 2963/4236 cut-off events. For 10292/10566 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20168 event pairs, 197 based on Foata normal form. 125/4275 useless extension candidates. Maximal degree in co-relation 15384. Up to 1308 conditions per place. [2024-11-13 14:42:02,077 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 86 selfloop transitions, 18 changer transitions 1/115 dead transitions. [2024-11-13 14:42:02,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 787 flow [2024-11-13 14:42:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:42:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-11-13 14:42:02,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29455081001472755 [2024-11-13 14:42:02,080 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 320 flow. Second operand 7 states and 200 transitions. [2024-11-13 14:42:02,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 787 flow [2024-11-13 14:42:02,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 710 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-13 14:42:02,116 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 305 flow [2024-11-13 14:42:02,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2024-11-13 14:42:02,117 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -28 predicate places. [2024-11-13 14:42:02,117 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 305 flow [2024-11-13 14:42:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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 14:42:02,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:02,117 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, 1, 1, 1, 1, 1] [2024-11-13 14:42:02,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:42:02,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:02,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 903286245, now seen corresponding path program 1 times [2024-11-13 14:42:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:02,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147706945] [2024-11-13 14:42:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:07,863 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 14:42:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147706945] [2024-11-13 14:42:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147706945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:42:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033745591] [2024-11-13 14:42:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:07,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:42:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:07,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:42:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:42:07,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:42:07,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 305 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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 14:42:07,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:07,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:42:07,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:09,663 INFO L124 PetriNetUnfolderBase]: 3201/5400 cut-off events. [2024-11-13 14:42:09,663 INFO L125 PetriNetUnfolderBase]: For 7714/7972 co-relation queries the response was YES. [2024-11-13 14:42:09,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16757 conditions, 5400 events. 3201/5400 cut-off events. For 7714/7972 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 35553 event pairs, 792 based on Foata normal form. 16/5087 useless extension candidates. Maximal degree in co-relation 16737. Up to 2232 conditions per place. [2024-11-13 14:42:09,736 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 69 selfloop transitions, 19 changer transitions 14/129 dead transitions. [2024-11-13 14:42:09,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 808 flow [2024-11-13 14:42:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:42:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:42:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 297 transitions. [2024-11-13 14:42:09,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3061855670103093 [2024-11-13 14:42:09,738 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 305 flow. Second operand 10 states and 297 transitions. [2024-11-13 14:42:09,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 808 flow [2024-11-13 14:42:09,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 129 transitions, 606 flow, removed 70 selfloop flow, removed 12 redundant places. [2024-11-13 14:42:09,793 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 369 flow [2024-11-13 14:42:09,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-11-13 14:42:09,794 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -25 predicate places. [2024-11-13 14:42:09,794 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 369 flow [2024-11-13 14:42:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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 14:42:09,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:09,795 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, 1, 1, 1, 1, 1] [2024-11-13 14:42:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:42:09,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1873062729, now seen corresponding path program 2 times [2024-11-13 14:42:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855440675] [2024-11-13 14:42:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:10,276 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 14:42:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855440675] [2024-11-13 14:42:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855440675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404397950] [2024-11-13 14:42:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:10,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:10,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 97 [2024-11-13 14:42:10,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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 14:42:10,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:10,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 97 [2024-11-13 14:42:10,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:12,064 INFO L124 PetriNetUnfolderBase]: 5811/9403 cut-off events. [2024-11-13 14:42:12,064 INFO L125 PetriNetUnfolderBase]: For 6085/6202 co-relation queries the response was YES. [2024-11-13 14:42:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24589 conditions, 9403 events. 5811/9403 cut-off events. For 6085/6202 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 66019 event pairs, 1393 based on Foata normal form. 16/8726 useless extension candidates. Maximal degree in co-relation 24570. Up to 3664 conditions per place. [2024-11-13 14:42:12,123 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 53 selfloop transitions, 1 changer transitions 50/129 dead transitions. [2024-11-13 14:42:12,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 129 transitions, 823 flow [2024-11-13 14:42:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:42:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-13 14:42:12,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28350515463917525 [2024-11-13 14:42:12,125 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 369 flow. Second operand 6 states and 165 transitions. [2024-11-13 14:42:12,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 129 transitions, 823 flow [2024-11-13 14:42:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 129 transitions, 775 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-11-13 14:42:12,143 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 294 flow [2024-11-13 14:42:12,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-11-13 14:42:12,144 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-11-13 14:42:12,144 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 294 flow [2024-11-13 14:42:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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 14:42:12,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:12,145 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, 1, 1, 1, 1, 1] [2024-11-13 14:42:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:42:12,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:12,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1118536705, now seen corresponding path program 3 times [2024-11-13 14:42:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517155958] [2024-11-13 14:42:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:16,431 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 14:42:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517155958] [2024-11-13 14:42:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517155958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:42:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716274867] [2024-11-13 14:42:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:42:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:42:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:42:16,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:42:16,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 294 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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 14:42:16,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:16,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:42:16,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:19,039 INFO L124 PetriNetUnfolderBase]: 4106/7035 cut-off events. [2024-11-13 14:42:19,039 INFO L125 PetriNetUnfolderBase]: For 3919/4264 co-relation queries the response was YES. [2024-11-13 14:42:19,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17300 conditions, 7035 events. 4106/7035 cut-off events. For 3919/4264 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 50463 event pairs, 953 based on Foata normal form. 40/6499 useless extension candidates. Maximal degree in co-relation 17278. Up to 2238 conditions per place. [2024-11-13 14:42:19,101 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 87 selfloop transitions, 17 changer transitions 17/148 dead transitions. [2024-11-13 14:42:19,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 148 transitions, 817 flow [2024-11-13 14:42:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:42:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 14:42:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 324 transitions. [2024-11-13 14:42:19,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3036551077788191 [2024-11-13 14:42:19,104 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 294 flow. Second operand 11 states and 324 transitions. [2024-11-13 14:42:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 148 transitions, 817 flow [2024-11-13 14:42:19,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 779 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-11-13 14:42:19,112 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 437 flow [2024-11-13 14:42:19,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=437, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2024-11-13 14:42:19,113 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -12 predicate places. [2024-11-13 14:42:19,113 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 437 flow [2024-11-13 14:42:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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 14:42:19,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:19,113 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, 1, 1, 1, 1, 1] [2024-11-13 14:42:19,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:42:19,113 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:19,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1610720557, now seen corresponding path program 4 times [2024-11-13 14:42:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508157778] [2024-11-13 14:42:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:22,903 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 14:42:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508157778] [2024-11-13 14:42:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508157778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:42:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208885860] [2024-11-13 14:42:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:42:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:42:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:42:22,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:42:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 437 flow. Second operand has 11 states, 11 states have (on average 21.818181818181817) internal successors, (240), 11 states have internal predecessors, (240), 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 14:42:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:22,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:42:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:24,812 INFO L124 PetriNetUnfolderBase]: 4782/8172 cut-off events. [2024-11-13 14:42:24,812 INFO L125 PetriNetUnfolderBase]: For 10871/11380 co-relation queries the response was YES. [2024-11-13 14:42:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22114 conditions, 8172 events. 4782/8172 cut-off events. For 10871/11380 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 60416 event pairs, 1355 based on Foata normal form. 68/7507 useless extension candidates. Maximal degree in co-relation 22089. Up to 2004 conditions per place. [2024-11-13 14:42:24,941 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 68 selfloop transitions, 9 changer transitions 30/134 dead transitions. [2024-11-13 14:42:24,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 852 flow [2024-11-13 14:42:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:42:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 14:42:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2024-11-13 14:42:24,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3035509736540664 [2024-11-13 14:42:24,944 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 437 flow. Second operand 9 states and 265 transitions. [2024-11-13 14:42:24,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 852 flow [2024-11-13 14:42:24,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 826 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-13 14:42:24,980 INFO L231 Difference]: Finished difference. Result has 101 places, 73 transitions, 389 flow [2024-11-13 14:42:24,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=101, PETRI_TRANSITIONS=73} [2024-11-13 14:42:24,981 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -3 predicate places. [2024-11-13 14:42:24,981 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 73 transitions, 389 flow [2024-11-13 14:42:24,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.818181818181817) internal successors, (240), 11 states have internal predecessors, (240), 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 14:42:24,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:24,982 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, 1, 1, 1, 1, 1] [2024-11-13 14:42:24,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:42:24,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1962258549, now seen corresponding path program 5 times [2024-11-13 14:42:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:24,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673377172] [2024-11-13 14:42:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:42:25,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:42:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:42:25,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:42:25,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:42:25,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (93 of 94 remaining) [2024-11-13 14:42:25,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2024-11-13 14:42:25,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2024-11-13 14:42:25,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2024-11-13 14:42:25,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2024-11-13 14:42:25,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2024-11-13 14:42:25,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2024-11-13 14:42:25,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2024-11-13 14:42:25,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2024-11-13 14:42:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2024-11-13 14:42:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2024-11-13 14:42:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2024-11-13 14:42:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2024-11-13 14:42:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (80 of 94 remaining) [2024-11-13 14:42:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2024-11-13 14:42:25,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2024-11-13 14:42:25,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2024-11-13 14:42:25,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2024-11-13 14:42:25,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2024-11-13 14:42:25,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2024-11-13 14:42:25,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2024-11-13 14:42:25,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2024-11-13 14:42:25,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2024-11-13 14:42:25,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2024-11-13 14:42:25,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (45 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2024-11-13 14:42:25,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2024-11-13 14:42:25,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2024-11-13 14:42:25,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2024-11-13 14:42:25,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2024-11-13 14:42:25,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2024-11-13 14:42:25,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2024-11-13 14:42:25,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2024-11-13 14:42:25,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2024-11-13 14:42:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:42:25,528 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:25,739 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:42:25,743 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:42:25,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:42:25 BasicIcfg [2024-11-13 14:42:25,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:42:25,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:42:25,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:42:25,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:42:25,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:10" (3/4) ... [2024-11-13 14:42:25,761 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:42:25,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:42:25,763 INFO L158 Benchmark]: Toolchain (without parser) took 79413.96ms. Allocated memory was 109.1MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 81.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-13 14:42:25,765 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:42:25,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 911.28ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 55.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:42:25,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.02ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 53.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:42:25,766 INFO L158 Benchmark]: Boogie Preprocessor took 108.67ms. Allocated memory is still 109.1MB. Free memory was 53.3MB in the beginning and 48.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:42:25,766 INFO L158 Benchmark]: RCFGBuilder took 2639.38ms. Allocated memory is still 109.1MB. Free memory was 48.7MB in the beginning and 39.7MB in the end (delta: 8.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-13 14:42:25,767 INFO L158 Benchmark]: TraceAbstraction took 75667.92ms. Allocated memory was 109.1MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 38.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-13 14:42:25,767 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 5.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 358.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:42:25,774 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.51ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 911.28ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 55.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.02ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 53.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.67ms. Allocated memory is still 109.1MB. Free memory was 53.3MB in the beginning and 48.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2639.38ms. Allocated memory is still 109.1MB. Free memory was 48.7MB in the beginning and 39.7MB in the end (delta: 8.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 75667.92ms. Allocated memory was 109.1MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 38.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 5.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 358.4kB). 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 4 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] 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) [L775] EXPR 1 \read(x) [L775] 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) [L775] 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) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] 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) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] 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) [L845] 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) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] 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) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] 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) [L897] 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) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 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 [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 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=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L908] 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=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe027_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 882]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 891]: 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: 889]: 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: 885]: 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: 887]: 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 9 procedures, 167 locations, 94 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: 75.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3415 IncrementalHoareTripleChecker+Invalid, 3546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 12 mSDtfsCounter, 3415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=18, InterpolantAutomatonStates: 115, 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, 1.2s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 4190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 14:42:25,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:42:29,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:42:29,938 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 14:42:29,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:42:29,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:42:30,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:42:30,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:42:30,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:42:30,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:42:30,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:42:30,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:42:30,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:42:30,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:42:30,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:42:30,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:42:30,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:42:30,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:42:30,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:42:30,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:42:30,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:42:30,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:42:30,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:42:30,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:42:30,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:42:30,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:42:30,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:42:30,014 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:42:30,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:42:30,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:42:30,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:42:30,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:42:30,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:42:30,016 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_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2024-11-13 14:42:30,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:42:30,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:42:30,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:42:30,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:42:30,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:42:30,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i Unable to find full path for "g++" [2024-11-13 14:42:33,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:42:33,548 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:42:33,549 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-13 14:42:33,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/0872dd241/6280ac60780646cc9ec58f3c49991850/FLAG4ffb5cc29 [2024-11-13 14:42:33,619 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/data/0872dd241/6280ac60780646cc9ec58f3c49991850 [2024-11-13 14:42:33,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:42:33,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:42:33,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:42:33,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:42:33,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:42:33,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:42:33" (1/1) ... [2024-11-13 14:42:33,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f2b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:33, skipping insertion in model container [2024-11-13 14:42:33,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:42:33" (1/1) ... [2024-11-13 14:42:33,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:42:34,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:42:34,365 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:42:34,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:42:34,576 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:42:34,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34 WrapperNode [2024-11-13 14:42:34,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:42:34,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:42:34,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:42:34,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:42:34,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,647 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 184 [2024-11-13 14:42:34,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:42:34,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:42:34,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:42:34,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:42:34,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,693 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [24, 2]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 8 writes are split as follows [8, 0]. [2024-11-13 14:42:34,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:42:34,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:42:34,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:42:34,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:42:34,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (1/1) ... [2024-11-13 14:42:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:42:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:34,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:42:34,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:42:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:42:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:42:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:42:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:42:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:42:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:42:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:42:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:42:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:42:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:42:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:42:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 14:42:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 14:42:34,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:42:34,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:42:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:42:34,864 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 14:42:35,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:42:35,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:42:36,331 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:42:36,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:42:37,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:42:37,549 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:42:37,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:42:37 BoogieIcfgContainer [2024-11-13 14:42:37,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:42:37,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:42:37,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:42:37,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:42:37,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:42:33" (1/3) ... [2024-11-13 14:42:37,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f49022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:42:37, skipping insertion in model container [2024-11-13 14:42:37,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:42:34" (2/3) ... [2024-11-13 14:42:37,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f49022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:42:37, skipping insertion in model container [2024-11-13 14:42:37,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:42:37" (3/3) ... [2024-11-13 14:42:37,561 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-11-13 14:42:37,580 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:42:37,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe027_power.opt.i that has 5 procedures, 96 locations, 1 initial locations, 0 loop locations, and 49 error locations. [2024-11-13 14:42:37,583 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:42:37,947 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:42:38,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 97 transitions, 210 flow [2024-11-13 14:42:38,127 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-11-13 14:42:38,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:42:38,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 387 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-11-13 14:42:38,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 97 transitions, 210 flow [2024-11-13 14:42:38,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 198 flow [2024-11-13 14:42:38,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:42:38,183 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;@5f62eb89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:42:38,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-13 14:42:38,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:42:38,196 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-13 14:42:38,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:42:38,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:38,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 14:42:38,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 982716708, now seen corresponding path program 1 times [2024-11-13 14:42:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:38,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426520707] [2024-11-13 14:42:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:38,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:38,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:38,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:42:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:38,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:42:38,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:38,649 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 14:42:38,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:38,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426520707] [2024-11-13 14:42:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426520707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:38,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:42:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269866005] [2024-11-13 14:42:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:38,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:42:38,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:42:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:42:38,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:42:38,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:42:38,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:38,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:42:38,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:54,470 INFO L124 PetriNetUnfolderBase]: 41670/60463 cut-off events. [2024-11-13 14:42:54,471 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-13 14:42:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115794 conditions, 60463 events. 41670/60463 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 3713. Compared 492533 event pairs, 41670 based on Foata normal form. 1960/38341 useless extension candidates. Maximal degree in co-relation 115782. Up to 54867 conditions per place. [2024-11-13 14:42:55,126 INFO L140 encePairwiseOnDemand]: 60/97 looper letters, 38 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2024-11-13 14:42:55,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 202 flow [2024-11-13 14:42:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:42:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:42:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-13 14:42:55,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4742268041237113 [2024-11-13 14:42:55,151 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 198 flow. Second operand 3 states and 138 transitions. [2024-11-13 14:42:55,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 202 flow [2024-11-13 14:42:55,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 14:42:55,188 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 122 flow [2024-11-13 14:42:55,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-11-13 14:42:55,199 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-13 14:42:55,200 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 122 flow [2024-11-13 14:42:55,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:42:55,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:55,201 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 14:42:55,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:55,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:55,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 982716709, now seen corresponding path program 1 times [2024-11-13 14:42:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272099745] [2024-11-13 14:42:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:55,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:55,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:42:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:55,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:42:55,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:55,815 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 14:42:55,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:55,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272099745] [2024-11-13 14:42:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272099745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:42:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870276425] [2024-11-13 14:42:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:55,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:42:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:42:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:42:55,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:42:55,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:42:55,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:55,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:42:55,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:42:59,080 INFO L124 PetriNetUnfolderBase]: 5844/9125 cut-off events. [2024-11-13 14:42:59,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:42:59,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17268 conditions, 9125 events. 5844/9125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 65292 event pairs, 5844 based on Foata normal form. 0/8168 useless extension candidates. Maximal degree in co-relation 17262. Up to 7981 conditions per place. [2024-11-13 14:42:59,144 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 28 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-13 14:42:59,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 46 transitions, 160 flow [2024-11-13 14:42:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:42:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:42:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-13 14:42:59,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35051546391752575 [2024-11-13 14:42:59,146 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 122 flow. Second operand 3 states and 102 transitions. [2024-11-13 14:42:59,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 46 transitions, 160 flow [2024-11-13 14:42:59,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 46 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:42:59,148 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 103 flow [2024-11-13 14:42:59,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=103, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-13 14:42:59,149 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:42:59,149 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 103 flow [2024-11-13 14:42:59,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 14:42:59,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:42:59,150 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:42:59,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:42:59,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:59,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:42:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash 397516832, now seen corresponding path program 1 times [2024-11-13 14:42:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723309769] [2024-11-13 14:42:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:59,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:59,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:42:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:59,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:42:59,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:59,573 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 14:42:59,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:59,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723309769] [2024-11-13 14:42:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723309769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:59,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:42:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18648458] [2024-11-13 14:42:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:59,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:42:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:42:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:42:59,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:42:59,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:42:59,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:42:59,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:42:59,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:01,297 INFO L124 PetriNetUnfolderBase]: 4591/6960 cut-off events. [2024-11-13 14:43:01,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:01,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13395 conditions, 6960 events. 4591/6960 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47220 event pairs, 832 based on Foata normal form. 0/6633 useless extension candidates. Maximal degree in co-relation 13388. Up to 5038 conditions per place. [2024-11-13 14:43:01,348 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2024-11-13 14:43:01,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 245 flow [2024-11-13 14:43:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-13 14:43:01,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2024-11-13 14:43:01,350 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 103 flow. Second operand 3 states and 113 transitions. [2024-11-13 14:43:01,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 245 flow [2024-11-13 14:43:01,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:43:01,353 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 102 flow [2024-11-13 14:43:01,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-13 14:43:01,355 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:43:01,357 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 102 flow [2024-11-13 14:43:01,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:43:01,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:01,357 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:01,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:43:01,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:01,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1930958012, now seen corresponding path program 1 times [2024-11-13 14:43:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818454526] [2024-11-13 14:43:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:01,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:01,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:43:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:01,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:43:01,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:01,843 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 14:43:01,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:01,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:01,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818454526] [2024-11-13 14:43:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818454526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001196903] [2024-11-13 14:43:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:01,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:01,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:43:01,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:43:01,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:01,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:43:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:03,506 INFO L124 PetriNetUnfolderBase]: 3961/6321 cut-off events. [2024-11-13 14:43:03,506 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-13 14:43:03,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 6321 events. 3961/6321 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 43994 event pairs, 781 based on Foata normal form. 0/6066 useless extension candidates. Maximal degree in co-relation 12275. Up to 4477 conditions per place. [2024-11-13 14:43:03,553 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 41 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-13 14:43:03,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 224 flow [2024-11-13 14:43:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-13 14:43:03,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3711340206185567 [2024-11-13 14:43:03,556 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 102 flow. Second operand 3 states and 108 transitions. [2024-11-13 14:43:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 224 flow [2024-11-13 14:43:03,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:03,560 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2024-11-13 14:43:03,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-13 14:43:03,561 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:43:03,562 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2024-11-13 14:43:03,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:43:03,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:03,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:03,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:43:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:03,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:03,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash 213931669, now seen corresponding path program 1 times [2024-11-13 14:43:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:03,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045773210] [2024-11-13 14:43:03,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:03,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:03,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:43:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:43:04,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:04,250 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 14:43:04,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:04,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:04,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045773210] [2024-11-13 14:43:04,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045773210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:04,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:04,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:43:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243920632] [2024-11-13 14:43:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:04,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:04,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:04,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:43:04,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:43:04,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:04,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:43:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:06,000 INFO L124 PetriNetUnfolderBase]: 3664/5820 cut-off events. [2024-11-13 14:43:06,000 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-13 14:43:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11738 conditions, 5820 events. 3664/5820 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38614 event pairs, 1165 based on Foata normal form. 0/5781 useless extension candidates. Maximal degree in co-relation 11729. Up to 4071 conditions per place. [2024-11-13 14:43:06,053 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 40 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-13 14:43:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 222 flow [2024-11-13 14:43:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:43:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-13 14:43:06,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.327319587628866 [2024-11-13 14:43:06,055 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 127 transitions. [2024-11-13 14:43:06,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 222 flow [2024-11-13 14:43:06,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:06,059 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2024-11-13 14:43:06,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-11-13 14:43:06,061 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-13 14:43:06,061 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2024-11-13 14:43:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:43:06,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:06,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:06,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:06,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 213931670, now seen corresponding path program 1 times [2024-11-13 14:43:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:06,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634349242] [2024-11-13 14:43:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:06,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:06,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:43:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:43:06,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:06,723 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 14:43:06,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:06,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634349242] [2024-11-13 14:43:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634349242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:43:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041862430] [2024-11-13 14:43:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:06,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:06,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-13 14:43:06,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:43:06,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:06,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-13 14:43:06,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:08,440 INFO L124 PetriNetUnfolderBase]: 3367/5415 cut-off events. [2024-11-13 14:43:08,440 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-13 14:43:08,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10820 conditions, 5415 events. 3367/5415 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35849 event pairs, 1021 based on Foata normal form. 108/5484 useless extension candidates. Maximal degree in co-relation 10811. Up to 3666 conditions per place. [2024-11-13 14:43:08,484 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-13 14:43:08,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 216 flow [2024-11-13 14:43:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:43:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-11-13 14:43:08,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2024-11-13 14:43:08,487 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 126 transitions. [2024-11-13 14:43:08,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 216 flow [2024-11-13 14:43:08,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:08,490 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2024-11-13 14:43:08,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-13 14:43:08,492 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -47 predicate places. [2024-11-13 14:43:08,492 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2024-11-13 14:43:08,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 14:43:08,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:08,493 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:08,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:43:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:08,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1296630221, now seen corresponding path program 1 times [2024-11-13 14:43:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523782968] [2024-11-13 14:43:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:08,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:08,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:08,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:08,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:43:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:08,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:43:08,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:09,004 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 14:43:09,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:09,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523782968] [2024-11-13 14:43:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523782968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486058464] [2024-11-13 14:43:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:09,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:09,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:43:09,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:43:09,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:09,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:43:09,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:10,738 INFO L124 PetriNetUnfolderBase]: 3367/5421 cut-off events. [2024-11-13 14:43:10,738 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-13 14:43:10,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10825 conditions, 5421 events. 3367/5421 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 37262 event pairs, 3367 based on Foata normal form. 144/5427 useless extension candidates. Maximal degree in co-relation 10817. Up to 4646 conditions per place. [2024-11-13 14:43:10,780 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 23 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-13 14:43:10,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 147 flow [2024-11-13 14:43:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-13 14:43:10,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29553264604810997 [2024-11-13 14:43:10,782 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 86 transitions. [2024-11-13 14:43:10,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 147 flow [2024-11-13 14:43:10,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:10,787 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2024-11-13 14:43:10,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-13 14:43:10,792 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -48 predicate places. [2024-11-13 14:43:10,792 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2024-11-13 14:43:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 14:43:10,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:10,792 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:10,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:43:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:10,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1296628372, now seen corresponding path program 1 times [2024-11-13 14:43:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713057939] [2024-11-13 14:43:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:10,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:11,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:43:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:11,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:43:11,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:11,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:11,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713057939] [2024-11-13 14:43:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713057939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:43:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140847175] [2024-11-13 14:43:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:11,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:11,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:11,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:43:11,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 14:43:11,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:11,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:43:11,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:13,963 INFO L124 PetriNetUnfolderBase]: 10071/14845 cut-off events. [2024-11-13 14:43:13,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:14,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30181 conditions, 14845 events. 10071/14845 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 98111 event pairs, 1061 based on Foata normal form. 400/15168 useless extension candidates. Maximal degree in co-relation 30173. Up to 8761 conditions per place. [2024-11-13 14:43:14,065 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 54 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-11-13 14:43:14,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 290 flow [2024-11-13 14:43:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:43:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-13 14:43:14,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.327319587628866 [2024-11-13 14:43:14,067 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 4 states and 127 transitions. [2024-11-13 14:43:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 290 flow [2024-11-13 14:43:14,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:43:14,068 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 135 flow [2024-11-13 14:43:14,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-11-13 14:43:14,070 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -45 predicate places. [2024-11-13 14:43:14,070 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 135 flow [2024-11-13 14:43:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 14:43:14,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:14,071 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] [2024-11-13 14:43:14,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:43:14,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:14,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1572096785, now seen corresponding path program 1 times [2024-11-13 14:43:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638733529] [2024-11-13 14:43:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:14,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:14,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:43:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:14,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:43:14,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:14,595 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 14:43:14,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:14,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638733529] [2024-11-13 14:43:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638733529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:14,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511401359] [2024-11-13 14:43:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:14,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:43:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:43:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:43:14,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:43:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 14:43:14,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:14,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:43:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:16,444 INFO L124 PetriNetUnfolderBase]: 7527/11185 cut-off events. [2024-11-13 14:43:16,444 INFO L125 PetriNetUnfolderBase]: For 2570/2570 co-relation queries the response was YES. [2024-11-13 14:43:16,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26288 conditions, 11185 events. 7527/11185 cut-off events. For 2570/2570 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 70564 event pairs, 475 based on Foata normal form. 364/11492 useless extension candidates. Maximal degree in co-relation 26277. Up to 5521 conditions per place. [2024-11-13 14:43:16,508 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 69 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2024-11-13 14:43:16,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 424 flow [2024-11-13 14:43:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:43:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:43:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-13 14:43:16,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.334020618556701 [2024-11-13 14:43:16,510 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 135 flow. Second operand 5 states and 162 transitions. [2024-11-13 14:43:16,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 424 flow [2024-11-13 14:43:16,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 413 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:16,516 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 187 flow [2024-11-13 14:43:16,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2024-11-13 14:43:16,517 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2024-11-13 14:43:16,517 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 187 flow [2024-11-13 14:43:16,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 14:43:16,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:16,518 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] [2024-11-13 14:43:16,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:43:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:16,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:16,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1626177541, now seen corresponding path program 1 times [2024-11-13 14:43:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:16,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065183511] [2024-11-13 14:43:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:16,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:16,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:16,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:16,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:43:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:16,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:43:16,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:16,998 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 14:43:16,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:16,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065183511] [2024-11-13 14:43:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065183511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:16,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:43:16,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101107880] [2024-11-13 14:43:16,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:17,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:17,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:17,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:43:17,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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 14:43:17,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:17,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:43:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:18,298 INFO L124 PetriNetUnfolderBase]: 4591/6797 cut-off events. [2024-11-13 14:43:18,298 INFO L125 PetriNetUnfolderBase]: For 4762/4762 co-relation queries the response was YES. [2024-11-13 14:43:18,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17832 conditions, 6797 events. 4591/6797 cut-off events. For 4762/4762 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 38029 event pairs, 313 based on Foata normal form. 244/6984 useless extension candidates. Maximal degree in co-relation 17819. Up to 1969 conditions per place. [2024-11-13 14:43:18,324 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 82 selfloop transitions, 14 changer transitions 1/108 dead transitions. [2024-11-13 14:43:18,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 557 flow [2024-11-13 14:43:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:43:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:43:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-13 14:43:18,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33505154639175255 [2024-11-13 14:43:18,326 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 187 flow. Second operand 6 states and 195 transitions. [2024-11-13 14:43:18,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 557 flow [2024-11-13 14:43:18,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 527 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 14:43:18,342 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 237 flow [2024-11-13 14:43:18,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-11-13 14:43:18,343 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2024-11-13 14:43:18,343 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 237 flow [2024-11-13 14:43:18,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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 14:43:18,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:18,343 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 14:43:18,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:18,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:18,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1811686226, now seen corresponding path program 1 times [2024-11-13 14:43:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963633573] [2024-11-13 14:43:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:18,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:18,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:18,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:18,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:43:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:18,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:43:18,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:18,850 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 14:43:18,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:18,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963633573] [2024-11-13 14:43:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963633573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:43:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178348524] [2024-11-13 14:43:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:43:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:43:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:43:18,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:43:18,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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 14:43:18,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:18,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:43:18,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:20,051 INFO L124 PetriNetUnfolderBase]: 3027/4365 cut-off events. [2024-11-13 14:43:20,051 INFO L125 PetriNetUnfolderBase]: For 4902/4902 co-relation queries the response was YES. [2024-11-13 14:43:20,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 4365 events. 3027/4365 cut-off events. For 4902/4902 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22017 event pairs, 255 based on Foata normal form. 96/4404 useless extension candidates. Maximal degree in co-relation 12523. Up to 1348 conditions per place. [2024-11-13 14:43:20,084 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 73 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2024-11-13 14:43:20,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 545 flow [2024-11-13 14:43:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:43:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:43:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-11-13 14:43:20,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30338733431516934 [2024-11-13 14:43:20,086 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 237 flow. Second operand 7 states and 206 transitions. [2024-11-13 14:43:20,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 545 flow [2024-11-13 14:43:20,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 499 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-13 14:43:20,117 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 247 flow [2024-11-13 14:43:20,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-11-13 14:43:20,118 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -35 predicate places. [2024-11-13 14:43:20,118 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 247 flow [2024-11-13 14:43:20,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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 14:43:20,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:20,118 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, 1, 1, 1, 1, 1] [2024-11-13 14:43:20,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:43:20,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:20,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -587133315, now seen corresponding path program 1 times [2024-11-13 14:43:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:20,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367506700] [2024-11-13 14:43:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:20,322 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:20,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:43:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:20,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:43:20,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:20,804 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 14:43:20,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:20,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367506700] [2024-11-13 14:43:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367506700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:43:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895432978] [2024-11-13 14:43:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:43:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:43:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:43:20,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 97 [2024-11-13 14:43:20,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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 14:43:20,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:20,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 97 [2024-11-13 14:43:20,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:22,690 INFO L124 PetriNetUnfolderBase]: 7124/10251 cut-off events. [2024-11-13 14:43:22,691 INFO L125 PetriNetUnfolderBase]: For 10054/10054 co-relation queries the response was YES. [2024-11-13 14:43:22,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28189 conditions, 10251 events. 7124/10251 cut-off events. For 10054/10054 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 57612 event pairs, 1338 based on Foata normal form. 16/10220 useless extension candidates. Maximal degree in co-relation 28174. Up to 4808 conditions per place. [2024-11-13 14:43:22,746 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 76 selfloop transitions, 9 changer transitions 28/122 dead transitions. [2024-11-13 14:43:22,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 773 flow [2024-11-13 14:43:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:43:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:43:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-11-13 14:43:22,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28276877761413843 [2024-11-13 14:43:22,748 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 247 flow. Second operand 7 states and 192 transitions. [2024-11-13 14:43:22,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 773 flow [2024-11-13 14:43:22,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 572 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-11-13 14:43:22,892 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 226 flow [2024-11-13 14:43:22,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-11-13 14:43:22,893 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -34 predicate places. [2024-11-13 14:43:22,893 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 226 flow [2024-11-13 14:43:22,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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 14:43:22,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:22,894 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, 1, 1, 1, 1, 1] [2024-11-13 14:43:22,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:43:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:23,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1986900495, now seen corresponding path program 2 times [2024-11-13 14:43:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650342736] [2024-11-13 14:43:23,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:43:23,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:23,098 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:23,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:43:23,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:43:23,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:43:23,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 14:43:23,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:26,692 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 15 treesize of output 1 [2024-11-13 14:43:27,376 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 157 treesize of output 134 [2024-11-13 14:43:27,962 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 74 treesize of output 51 [2024-11-13 14:43:29,096 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 66 treesize of output 35 [2024-11-13 14:43:29,495 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 23 treesize of output 11 [2024-11-13 14:43:30,090 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 23 treesize of output 11 [2024-11-13 14:43:30,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 91 treesize of output 71 [2024-11-13 14:43:30,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2024-11-13 14:43:30,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2024-11-13 14:43:30,378 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 14:43:30,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:30,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650342736] [2024-11-13 14:43:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650342736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:43:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902671116] [2024-11-13 14:43:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:30,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:43:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:43:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:43:30,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-13 14:43:30,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 226 flow. Second operand has 14 states, 14 states have (on average 17.785714285714285) internal successors, (249), 14 states have internal predecessors, (249), 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 14:43:30,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:30,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-13 14:43:30,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:34,217 INFO L124 PetriNetUnfolderBase]: 5478/8213 cut-off events. [2024-11-13 14:43:34,217 INFO L125 PetriNetUnfolderBase]: For 2241/2271 co-relation queries the response was YES. [2024-11-13 14:43:34,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19353 conditions, 8213 events. 5478/8213 cut-off events. For 2241/2271 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 46247 event pairs, 1423 based on Foata normal form. 28/8078 useless extension candidates. Maximal degree in co-relation 19338. Up to 4462 conditions per place. [2024-11-13 14:43:34,275 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 113 selfloop transitions, 39 changer transitions 27/192 dead transitions. [2024-11-13 14:43:34,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 192 transitions, 1092 flow [2024-11-13 14:43:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:43:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 14:43:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 325 transitions. [2024-11-13 14:43:34,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.27920962199312716 [2024-11-13 14:43:34,282 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 226 flow. Second operand 12 states and 325 transitions. [2024-11-13 14:43:34,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 192 transitions, 1092 flow [2024-11-13 14:43:34,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 192 transitions, 1056 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:34,290 INFO L231 Difference]: Finished difference. Result has 85 places, 97 transitions, 594 flow [2024-11-13 14:43:34,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=594, PETRI_PLACES=85, PETRI_TRANSITIONS=97} [2024-11-13 14:43:34,291 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -19 predicate places. [2024-11-13 14:43:34,291 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 97 transitions, 594 flow [2024-11-13 14:43:34,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.785714285714285) internal successors, (249), 14 states have internal predecessors, (249), 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 14:43:34,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:34,292 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, 1, 1, 1, 1, 1] [2024-11-13 14:43:34,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:43:34,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:34,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:34,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1915142049, now seen corresponding path program 3 times [2024-11-13 14:43:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:34,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173502577] [2024-11-13 14:43:34,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:43:34,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:34,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:34,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:34,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:43:34,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 14:43:34,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:43:34,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:43:34,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:34,950 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 14:43:34,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:34,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173502577] [2024-11-13 14:43:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173502577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:43:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817271497] [2024-11-13 14:43:34,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:34,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:43:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:43:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:43:35,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 97 [2024-11-13 14:43:35,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 97 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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 14:43:35,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:35,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 97 [2024-11-13 14:43:35,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:37,391 INFO L124 PetriNetUnfolderBase]: 8184/11951 cut-off events. [2024-11-13 14:43:37,392 INFO L125 PetriNetUnfolderBase]: For 9436/9446 co-relation queries the response was YES. [2024-11-13 14:43:37,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33073 conditions, 11951 events. 8184/11951 cut-off events. For 9436/9446 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 68520 event pairs, 1212 based on Foata normal form. 18/11954 useless extension candidates. Maximal degree in co-relation 33050. Up to 6093 conditions per place. [2024-11-13 14:43:37,503 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 120 selfloop transitions, 11 changer transitions 32/172 dead transitions. [2024-11-13 14:43:37,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 172 transitions, 1227 flow [2024-11-13 14:43:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:43:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:43:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-13 14:43:37,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2695139911634757 [2024-11-13 14:43:37,505 INFO L175 Difference]: Start difference. First operand has 85 places, 97 transitions, 594 flow. Second operand 7 states and 183 transitions. [2024-11-13 14:43:37,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 172 transitions, 1227 flow [2024-11-13 14:43:37,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 172 transitions, 1209 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:37,530 INFO L231 Difference]: Finished difference. Result has 88 places, 97 transitions, 612 flow [2024-11-13 14:43:37,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=88, PETRI_TRANSITIONS=97} [2024-11-13 14:43:37,531 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -16 predicate places. [2024-11-13 14:43:37,531 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 97 transitions, 612 flow [2024-11-13 14:43:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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 14:43:37,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:37,532 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, 1, 1, 1, 1, 1] [2024-11-13 14:43:37,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:43:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:37,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:37,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 737529393, now seen corresponding path program 4 times [2024-11-13 14:43:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587774554] [2024-11-13 14:43:37,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:43:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:37,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:37,738 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:37,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:43:37,994 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:43:37,994 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:43:37,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 14:43:38,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:38,100 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 14:43:38,449 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 23 treesize of output 3 [2024-11-13 14:43:38,659 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 14:43:38,914 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 14:43:39,152 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 14:43:39,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:39,153 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:39,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587774554] [2024-11-13 14:43:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587774554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:39,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:43:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146487126] [2024-11-13 14:43:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:43:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:43:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:43:39,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-13 14:43:39,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 612 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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 14:43:39,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:39,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-13 14:43:39,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:41,473 INFO L124 PetriNetUnfolderBase]: 4842/8002 cut-off events. [2024-11-13 14:43:41,474 INFO L125 PetriNetUnfolderBase]: For 6126/6199 co-relation queries the response was YES. [2024-11-13 14:43:41,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20633 conditions, 8002 events. 4842/8002 cut-off events. For 6126/6199 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 54769 event pairs, 2238 based on Foata normal form. 29/7370 useless extension candidates. Maximal degree in co-relation 20608. Up to 3666 conditions per place. [2024-11-13 14:43:41,547 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 55 selfloop transitions, 9 changer transitions 30/156 dead transitions. [2024-11-13 14:43:41,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 996 flow [2024-11-13 14:43:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:43:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:43:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2024-11-13 14:43:41,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3131443298969072 [2024-11-13 14:43:41,551 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 612 flow. Second operand 8 states and 243 transitions. [2024-11-13 14:43:41,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 996 flow [2024-11-13 14:43:41,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 156 transitions, 945 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-13 14:43:41,570 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 664 flow [2024-11-13 14:43:41,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2024-11-13 14:43:41,571 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -11 predicate places. [2024-11-13 14:43:41,571 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 664 flow [2024-11-13 14:43:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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 14:43:41,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:41,571 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, 1, 1, 1, 1, 1] [2024-11-13 14:43:41,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:43:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:41,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-13 14:43:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1403859379, now seen corresponding path program 5 times [2024-11-13 14:43:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860867484] [2024-11-13 14:43:41,773 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 14:43:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:41,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:41,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 14:43:42,108 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:43:42,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:43:42,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:43:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:42,358 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 14:43:42,358 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:43:42,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (93 of 94 remaining) [2024-11-13 14:43:42,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2024-11-13 14:43:42,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2024-11-13 14:43:42,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (80 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2024-11-13 14:43:42,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2024-11-13 14:43:42,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2024-11-13 14:43:42,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2024-11-13 14:43:42,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2024-11-13 14:43:42,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2024-11-13 14:43:42,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2024-11-13 14:43:42,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2024-11-13 14:43:42,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (45 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 94 remaining) [2024-11-13 14:43:42,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2024-11-13 14:43:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2024-11-13 14:43:42,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2024-11-13 14:43:42,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 94 remaining) [2024-11-13 14:43:42,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2024-11-13 14:43:42,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2024-11-13 14:43:42,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2024-11-13 14:43:42,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2024-11-13 14:43:42,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2024-11-13 14:43:42,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 14:43:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:42,575 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:42,723 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:43:42,724 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:43:42,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:43:42 BasicIcfg [2024-11-13 14:43:42,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:43:42,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:43:42,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:43:42,732 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:43:42,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:42:37" (3/4) ... [2024-11-13 14:43:42,736 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:43:42,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:43:42,738 INFO L158 Benchmark]: Toolchain (without parser) took 69112.12ms. Allocated memory was 83.9MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 58.3MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-13 14:43:42,739 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:42,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 948.80ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 31.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:43:42,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.92ms. Allocated memory is still 83.9MB. Free memory was 31.9MB in the beginning and 29.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:43:42,740 INFO L158 Benchmark]: Boogie Preprocessor took 101.09ms. Allocated memory is still 83.9MB. Free memory was 29.3MB in the beginning and 24.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:42,740 INFO L158 Benchmark]: RCFGBuilder took 2799.26ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 24.8MB in the beginning and 38.7MB in the end (delta: -13.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-13 14:43:42,744 INFO L158 Benchmark]: TraceAbstraction took 65179.16ms. Allocated memory was 100.7MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 37.9MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-11-13 14:43:42,745 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 5.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 812.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:42,747 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.60ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 948.80ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 31.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.92ms. Allocated memory is still 83.9MB. Free memory was 31.9MB in the beginning and 29.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.09ms. Allocated memory is still 83.9MB. Free memory was 29.3MB in the beginning and 24.8MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2799.26ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 24.8MB in the beginning and 38.7MB in the end (delta: -13.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 65179.16ms. Allocated memory was 100.7MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 37.9MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 5.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 812.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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-3, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-3, t2422=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-3, t2422=-2, t2423=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 \read(x) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L842] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L845] 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) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] 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) [L845] 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) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-3, t2422=-2, t2423=-1, t2424=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L859] 4 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L768] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] 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) [L775] EXPR 1 \read(x) [L775] 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) [L775] 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) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-3, t2422=-2, t2423=-1, t2424=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] 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) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] 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) [L897] 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) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 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 [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 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=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-3, t2422=-2, t2423=-1, t2424=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-3, t2422=-2, t2423=-1, t2424=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L908] 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=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe027_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 882]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 887]: 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: 891]: 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: 889]: 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: 885]: 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 9 procedures, 167 locations, 94 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: 64.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1013 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 963 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2926 IncrementalHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 17 mSDtfsCounter, 2926 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=15, InterpolantAutomatonStates: 79, 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.6s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 3321 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2309 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 14:43:42,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fcfb9de-a3d9-44c2-b1a1-9dac40bc3e8a/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