./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB --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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:20:07,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:20:07,158 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:20:07,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:20:07,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:20:07,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:20:07,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:20:07,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:20:07,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:20:07,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:20:07,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:20:07,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:20:07,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:20:07,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:20:07,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:20:07,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:20:07,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:20:07,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:20:07,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:20:07,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:20:07,206 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:20:07,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:20:07,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:20:07,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:07,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:07,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:07,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:07,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:20:07,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:07,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:07,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:07,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:07,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:20:07,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:20:07,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:20:07,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:20:07,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:20:07,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:20:07,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:20:07,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:20:07,212 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_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2024-11-28 05:20:07,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:20:07,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:20:07,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:20:07,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:20:07,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:20:07,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2024-11-28 05:20:11,191 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/e7535477c/588cd8db467a4c9982415f354f7ef4b1/FLAG95ab9992d [2024-11-28 05:20:11,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:20:11,770 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2024-11-28 05:20:11,795 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/e7535477c/588cd8db467a4c9982415f354f7ef4b1/FLAG95ab9992d [2024-11-28 05:20:11,812 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/e7535477c/588cd8db467a4c9982415f354f7ef4b1 [2024-11-28 05:20:11,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:20:11,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:20:11,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:11,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:20:11,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:20:11,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:11" (1/1) ... [2024-11-28 05:20:11,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97c373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:11, skipping insertion in model container [2024-11-28 05:20:11,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:11" (1/1) ... [2024-11-28 05:20:11,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:20:12,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:12,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:20:12,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:12,428 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:20:12,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12 WrapperNode [2024-11-28 05:20:12,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:12,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:12,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:20:12,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:20:12,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,516 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-28 05:20:12,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:12,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:20:12,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:20:12,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:20:12,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,554 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 05:20:12,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:20:12,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:20:12,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:20:12,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:20:12,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (1/1) ... [2024-11-28 05:20:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:12,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:20:12,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:20:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:20:12,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 05:20:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 05:20:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 05:20:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 05:20:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 05:20:12,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 05:20:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:20:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:20:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 05:20:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:20:12,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:20:12,698 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:20:12,936 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:20:12,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:20:13,649 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:20:13,649 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:20:14,577 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:20:14,580 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 05:20:14,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:14 BoogieIcfgContainer [2024-11-28 05:20:14,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:20:14,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:20:14,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:20:14,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:20:14,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:20:11" (1/3) ... [2024-11-28 05:20:14,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2f227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:14, skipping insertion in model container [2024-11-28 05:20:14,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:12" (2/3) ... [2024-11-28 05:20:14,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2f227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:14, skipping insertion in model container [2024-11-28 05:20:14,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:14" (3/3) ... [2024-11-28 05:20:14,595 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2024-11-28 05:20:14,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:20:14,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.oepc.i that has 4 procedures, 70 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-11-28 05:20:14,622 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:20:14,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 05:20:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-11-28 05:20:15,029 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-11-28 05:20:15,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:15,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 231 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-28 05:20:15,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-11-28 05:20:15,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-11-28 05:20:15,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:20:15,090 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;@16935e8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:20:15,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-28 05:20:15,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:20:15,100 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-28 05:20:15,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:15,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:15,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 05:20:15,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 22245525, now seen corresponding path program 1 times [2024-11-28 05:20:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270319651] [2024-11-28 05:20:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270319651] [2024-11-28 05:20:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270319651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:15,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255746538] [2024-11-28 05:20:15,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:15,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:15,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:15,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:15,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:15,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:15,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:15,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:15,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:16,861 INFO L124 PetriNetUnfolderBase]: 1505/2570 cut-off events. [2024-11-28 05:20:16,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:16,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 2570 events. 1505/2570 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19164 event pairs, 1505 based on Foata normal form. 112/1899 useless extension candidates. Maximal degree in co-relation 4848. Up to 2258 conditions per place. [2024-11-28 05:20:16,906 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-28 05:20:16,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-11-28 05:20:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-28 05:20:16,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-11-28 05:20:16,926 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 110 transitions. [2024-11-28 05:20:16,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-11-28 05:20:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:20:16,941 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-11-28 05:20:16,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-28 05:20:16,951 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-11-28 05:20:16,952 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-11-28 05:20:16,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:16,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:16,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 05:20:16,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:20:16,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:16,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash 22245526, now seen corresponding path program 1 times [2024-11-28 05:20:16,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999596488] [2024-11-28 05:20:16,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:17,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999596488] [2024-11-28 05:20:17,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999596488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:17,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:17,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000497391] [2024-11-28 05:20:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:17,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:17,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:17,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:17,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:17,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:17,725 INFO L124 PetriNetUnfolderBase]: 501/941 cut-off events. [2024-11-28 05:20:17,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:17,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 941 events. 501/941 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6270 event pairs, 501 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1743. Up to 784 conditions per place. [2024-11-28 05:20:17,732 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 05:20:17,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-11-28 05:20:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-28 05:20:17,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4131455399061033 [2024-11-28 05:20:17,736 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-11-28 05:20:17,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-11-28 05:20:17,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:17,739 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-28 05:20:17,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-28 05:20:17,740 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-28 05:20:17,741 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-28 05:20:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:17,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:17,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:20:17,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1382170957, now seen corresponding path program 1 times [2024-11-28 05:20:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654315376] [2024-11-28 05:20:17,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654315376] [2024-11-28 05:20:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654315376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136840913] [2024-11-28 05:20:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:18,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:18,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:18,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:18,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:18,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:18,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:18,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:18,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:18,378 INFO L124 PetriNetUnfolderBase]: 419/924 cut-off events. [2024-11-28 05:20:18,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:18,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 924 events. 419/924 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6387 event pairs, 91 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1604. Up to 517 conditions per place. [2024-11-28 05:20:18,386 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-28 05:20:18,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-11-28 05:20:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-11-28 05:20:18,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.460093896713615 [2024-11-28 05:20:18,389 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-11-28 05:20:18,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-11-28 05:20:18,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:18,392 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-28 05:20:18,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 05:20:18,394 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-28 05:20:18,394 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-28 05:20:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:18,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:18,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:18,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:20:18,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:18,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1389037008, now seen corresponding path program 1 times [2024-11-28 05:20:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897684754] [2024-11-28 05:20:18,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897684754] [2024-11-28 05:20:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897684754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:20:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443828879] [2024-11-28 05:20:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:18,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:18,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:18,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:18,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:18,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:18,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:19,127 INFO L124 PetriNetUnfolderBase]: 391/738 cut-off events. [2024-11-28 05:20:19,127 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-28 05:20:19,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 738 events. 391/738 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4360 event pairs, 209 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1530. Up to 472 conditions per place. [2024-11-28 05:20:19,137 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-28 05:20:19,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-28 05:20:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-28 05:20:19,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4084507042253521 [2024-11-28 05:20:19,141 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-11-28 05:20:19,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-28 05:20:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:19,145 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-28 05:20:19,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-28 05:20:19,146 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-28 05:20:19,148 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-28 05:20:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:19,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:19,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:20:19,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1121313725, now seen corresponding path program 1 times [2024-11-28 05:20:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587479727] [2024-11-28 05:20:19,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587479727] [2024-11-28 05:20:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587479727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:20:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534562930] [2024-11-28 05:20:19,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:19,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:19,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:19,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:19,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:19,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:19,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:19,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:20,142 INFO L124 PetriNetUnfolderBase]: 363/836 cut-off events. [2024-11-28 05:20:20,142 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-28 05:20:20,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 836 events. 363/836 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5644 event pairs, 75 based on Foata normal form. 16/840 useless extension candidates. Maximal degree in co-relation 1568. Up to 428 conditions per place. [2024-11-28 05:20:20,150 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-28 05:20:20,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-11-28 05:20:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-28 05:20:20,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40492957746478875 [2024-11-28 05:20:20,154 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-11-28 05:20:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-11-28 05:20:20,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:20:20,157 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-28 05:20:20,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-28 05:20:20,161 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-28 05:20:20,161 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-28 05:20:20,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:20,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:20,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:20,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:20:20,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:20,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash 399727027, now seen corresponding path program 1 times [2024-11-28 05:20:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656800220] [2024-11-28 05:20:20,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656800220] [2024-11-28 05:20:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656800220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175399008] [2024-11-28 05:20:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:20,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:20,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:20,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:20,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-11-28 05:20:20,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:20,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:20,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-11-28 05:20:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:20,534 INFO L124 PetriNetUnfolderBase]: 363/707 cut-off events. [2024-11-28 05:20:20,535 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-28 05:20:20,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 707 events. 363/707 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4469 event pairs, 363 based on Foata normal form. 24/701 useless extension candidates. Maximal degree in co-relation 1439. Up to 574 conditions per place. [2024-11-28 05:20:20,540 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-28 05:20:20,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-11-28 05:20:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-28 05:20:20,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3615023474178404 [2024-11-28 05:20:20,542 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-11-28 05:20:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-11-28 05:20:20,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:20,545 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-28 05:20:20,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-28 05:20:20,549 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2024-11-28 05:20:20,549 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-28 05:20:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:20,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:20,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:20:20,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:20,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash 399726522, now seen corresponding path program 1 times [2024-11-28 05:20:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197460875] [2024-11-28 05:20:20,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:20,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197460875] [2024-11-28 05:20:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197460875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:20,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:20:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037181364] [2024-11-28 05:20:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:20,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:20,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:20,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:20,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-11-28 05:20:20,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:20,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:20,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-11-28 05:20:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:21,660 INFO L124 PetriNetUnfolderBase]: 983/1726 cut-off events. [2024-11-28 05:20:21,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:21,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1726 events. 983/1726 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11165 event pairs, 137 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 3590. Up to 838 conditions per place. [2024-11-28 05:20:21,671 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 28 selfloop transitions, 2 changer transitions 39/82 dead transitions. [2024-11-28 05:20:21,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 328 flow [2024-11-28 05:20:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:20:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 05:20:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-11-28 05:20:21,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3644366197183099 [2024-11-28 05:20:21,674 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 207 transitions. [2024-11-28 05:20:21,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 328 flow [2024-11-28 05:20:21,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:21,678 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2024-11-28 05:20:21,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-28 05:20:21,679 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-28 05:20:21,681 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2024-11-28 05:20:21,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:21,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:21,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:20:21,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 296169359, now seen corresponding path program 1 times [2024-11-28 05:20:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317016384] [2024-11-28 05:20:21,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317016384] [2024-11-28 05:20:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317016384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935086238] [2024-11-28 05:20:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:21,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:22,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 71 [2024-11-28 05:20:22,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 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-28 05:20:22,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:22,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 71 [2024-11-28 05:20:22,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:22,701 INFO L124 PetriNetUnfolderBase]: 671/1186 cut-off events. [2024-11-28 05:20:22,701 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-11-28 05:20:22,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1186 events. 671/1186 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7224 event pairs, 431 based on Foata normal form. 36/1192 useless extension candidates. Maximal degree in co-relation 2810. Up to 673 conditions per place. [2024-11-28 05:20:22,709 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 28 selfloop transitions, 2 changer transitions 27/70 dead transitions. [2024-11-28 05:20:22,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 303 flow [2024-11-28 05:20:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:20:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:20:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-11-28 05:20:22,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.358148893360161 [2024-11-28 05:20:22,713 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 7 states and 178 transitions. [2024-11-28 05:20:22,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 303 flow [2024-11-28 05:20:22,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 283 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:22,729 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 97 flow [2024-11-28 05:20:22,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-11-28 05:20:22,731 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -19 predicate places. [2024-11-28 05:20:22,732 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 97 flow [2024-11-28 05:20:22,732 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-28 05:20:22,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:22,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:20:22,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash -365814711, now seen corresponding path program 1 times [2024-11-28 05:20:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115301057] [2024-11-28 05:20:22,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115301057] [2024-11-28 05:20:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115301057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:20:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159572237] [2024-11-28 05:20:23,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:23,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:23,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:23,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:23,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 71 [2024-11-28 05:20:23,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:23,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:23,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 71 [2024-11-28 05:20:23,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:23,601 INFO L124 PetriNetUnfolderBase]: 457/831 cut-off events. [2024-11-28 05:20:23,602 INFO L125 PetriNetUnfolderBase]: For 237/252 co-relation queries the response was YES. [2024-11-28 05:20:23,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 831 events. 457/831 cut-off events. For 237/252 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4841 event pairs, 167 based on Foata normal form. 30/840 useless extension candidates. Maximal degree in co-relation 1985. Up to 491 conditions per place. [2024-11-28 05:20:23,609 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 23 selfloop transitions, 2 changer transitions 23/62 dead transitions. [2024-11-28 05:20:23,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 273 flow [2024-11-28 05:20:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:20:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:20:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-11-28 05:20:23,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35412474849094566 [2024-11-28 05:20:23,611 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 97 flow. Second operand 7 states and 176 transitions. [2024-11-28 05:20:23,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 273 flow [2024-11-28 05:20:23,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 253 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:23,619 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 101 flow [2024-11-28 05:20:23,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-28 05:20:23,619 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-28 05:20:23,620 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 101 flow [2024-11-28 05:20:23,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:23,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:23,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:20:23,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash 993056040, now seen corresponding path program 1 times [2024-11-28 05:20:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52203907] [2024-11-28 05:20:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:24,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52203907] [2024-11-28 05:20:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52203907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:24,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:20:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780937852] [2024-11-28 05:20:24,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:24,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:24,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:24,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-11-28 05:20:24,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:24,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:24,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-11-28 05:20:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:24,581 INFO L124 PetriNetUnfolderBase]: 339/666 cut-off events. [2024-11-28 05:20:24,581 INFO L125 PetriNetUnfolderBase]: For 260/272 co-relation queries the response was YES. [2024-11-28 05:20:24,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 666 events. 339/666 cut-off events. For 260/272 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3724 event pairs, 173 based on Foata normal form. 24/678 useless extension candidates. Maximal degree in co-relation 1532. Up to 353 conditions per place. [2024-11-28 05:20:24,586 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 27 selfloop transitions, 2 changer transitions 23/67 dead transitions. [2024-11-28 05:20:24,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 295 flow [2024-11-28 05:20:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:20:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:20:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-11-28 05:20:24,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3762575452716298 [2024-11-28 05:20:24,588 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 101 flow. Second operand 7 states and 187 transitions. [2024-11-28 05:20:24,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 295 flow [2024-11-28 05:20:24,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 275 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:24,593 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 105 flow [2024-11-28 05:20:24,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2024-11-28 05:20:24,594 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -17 predicate places. [2024-11-28 05:20:24,595 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 105 flow [2024-11-28 05:20:24,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:24,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:24,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:24,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:20:24,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:24,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash 137645699, now seen corresponding path program 1 times [2024-11-28 05:20:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021023749] [2024-11-28 05:20:24,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021023749] [2024-11-28 05:20:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021023749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479392377] [2024-11-28 05:20:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:25,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:25,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:25,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:25,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:25,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:25,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:25,702 INFO L124 PetriNetUnfolderBase]: 915/1635 cut-off events. [2024-11-28 05:20:25,702 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2024-11-28 05:20:25,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 1635 events. 915/1635 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10395 event pairs, 118 based on Foata normal form. 16/1642 useless extension candidates. Maximal degree in co-relation 4079. Up to 591 conditions per place. [2024-11-28 05:20:25,714 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 32 selfloop transitions, 3 changer transitions 19/66 dead transitions. [2024-11-28 05:20:25,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 305 flow [2024-11-28 05:20:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:20:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-28 05:20:25,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2024-11-28 05:20:25,717 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 105 flow. Second operand 6 states and 151 transitions. [2024-11-28 05:20:25,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 305 flow [2024-11-28 05:20:25,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 285 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:25,723 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 107 flow [2024-11-28 05:20:25,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-11-28 05:20:25,724 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -19 predicate places. [2024-11-28 05:20:25,724 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 107 flow [2024-11-28 05:20:25,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:25,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:25,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:20:25,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash -144120465, now seen corresponding path program 2 times [2024-11-28 05:20:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558463876] [2024-11-28 05:20:25,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:25,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:20:25,787 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:20:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558463876] [2024-11-28 05:20:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558463876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:27,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:27,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:20:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371506989] [2024-11-28 05:20:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:20:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:27,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:20:27,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:20:27,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-11-28 05:20:27,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 107 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:27,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:27,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-11-28 05:20:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:28,050 INFO L124 PetriNetUnfolderBase]: 283/576 cut-off events. [2024-11-28 05:20:28,051 INFO L125 PetriNetUnfolderBase]: For 264/270 co-relation queries the response was YES. [2024-11-28 05:20:28,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 576 events. 283/576 cut-off events. For 264/270 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3180 event pairs, 29 based on Foata normal form. 16/581 useless extension candidates. Maximal degree in co-relation 1303. Up to 307 conditions per place. [2024-11-28 05:20:28,055 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 29 selfloop transitions, 4 changer transitions 17/65 dead transitions. [2024-11-28 05:20:28,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 292 flow [2024-11-28 05:20:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:20:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 05:20:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-11-28 05:20:28,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3591549295774648 [2024-11-28 05:20:28,058 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 107 flow. Second operand 8 states and 204 transitions. [2024-11-28 05:20:28,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 292 flow [2024-11-28 05:20:28,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 268 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:28,061 INFO L231 Difference]: Finished difference. Result has 62 places, 35 transitions, 123 flow [2024-11-28 05:20:28,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=35} [2024-11-28 05:20:28,062 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -14 predicate places. [2024-11-28 05:20:28,062 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 35 transitions, 123 flow [2024-11-28 05:20:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:28,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:28,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:28,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:20:28,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1698179097, now seen corresponding path program 1 times [2024-11-28 05:20:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136351430] [2024-11-28 05:20:28,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136351430] [2024-11-28 05:20:28,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136351430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:28,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:28,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:20:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620789989] [2024-11-28 05:20:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:28,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:28,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:28,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:28,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:28,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 35 transitions, 123 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-28 05:20:28,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:28,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:28,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:28,783 INFO L124 PetriNetUnfolderBase]: 878/1438 cut-off events. [2024-11-28 05:20:28,783 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2024-11-28 05:20:28,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3632 conditions, 1438 events. 878/1438 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7506 event pairs, 108 based on Foata normal form. 60/1480 useless extension candidates. Maximal degree in co-relation 3614. Up to 817 conditions per place. [2024-11-28 05:20:28,794 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 43 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-28 05:20:28,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 311 flow [2024-11-28 05:20:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-28 05:20:28,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38380281690140844 [2024-11-28 05:20:28,796 INFO L175 Difference]: Start difference. First operand has 62 places, 35 transitions, 123 flow. Second operand 4 states and 109 transitions. [2024-11-28 05:20:28,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 311 flow [2024-11-28 05:20:28,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 296 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-28 05:20:28,801 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 146 flow [2024-11-28 05:20:28,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-11-28 05:20:28,802 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-28 05:20:28,803 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 146 flow [2024-11-28 05:20:28,803 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-28 05:20:28,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:28,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:28,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:20:28,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:28,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1171386128, now seen corresponding path program 1 times [2024-11-28 05:20:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609384909] [2024-11-28 05:20:28,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:29,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:29,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609384909] [2024-11-28 05:20:29,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609384909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:29,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:29,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:20:29,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635449039] [2024-11-28 05:20:29,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:29,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:29,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:29,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:29,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:29,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:29,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:29,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:29,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:29,545 INFO L124 PetriNetUnfolderBase]: 642/1080 cut-off events. [2024-11-28 05:20:29,545 INFO L125 PetriNetUnfolderBase]: For 628/642 co-relation queries the response was YES. [2024-11-28 05:20:29,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1080 events. 642/1080 cut-off events. For 628/642 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5032 event pairs, 40 based on Foata normal form. 56/1122 useless extension candidates. Maximal degree in co-relation 2961. Up to 481 conditions per place. [2024-11-28 05:20:29,560 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-28 05:20:29,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 379 flow [2024-11-28 05:20:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:20:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:20:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-28 05:20:29,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38591549295774646 [2024-11-28 05:20:29,563 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 146 flow. Second operand 5 states and 137 transitions. [2024-11-28 05:20:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 379 flow [2024-11-28 05:20:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:29,567 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 186 flow [2024-11-28 05:20:29,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-11-28 05:20:29,568 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -14 predicate places. [2024-11-28 05:20:29,568 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 186 flow [2024-11-28 05:20:29,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:29,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:29,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:29,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:20:29,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1918953921, now seen corresponding path program 1 times [2024-11-28 05:20:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033517984] [2024-11-28 05:20:29,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033517984] [2024-11-28 05:20:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033517984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:20:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977779372] [2024-11-28 05:20:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:30,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:30,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:30,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:30,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:30,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:30,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:30,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:30,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:30,744 INFO L124 PetriNetUnfolderBase]: 723/1360 cut-off events. [2024-11-28 05:20:30,744 INFO L125 PetriNetUnfolderBase]: For 971/1019 co-relation queries the response was YES. [2024-11-28 05:20:30,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1360 events. 723/1360 cut-off events. For 971/1019 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7844 event pairs, 376 based on Foata normal form. 35/1344 useless extension candidates. Maximal degree in co-relation 3756. Up to 578 conditions per place. [2024-11-28 05:20:30,760 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 26 selfloop transitions, 2 changer transitions 33/79 dead transitions. [2024-11-28 05:20:30,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 448 flow [2024-11-28 05:20:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:20:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:20:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-11-28 05:20:30,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3380281690140845 [2024-11-28 05:20:30,765 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 186 flow. Second operand 7 states and 168 transitions. [2024-11-28 05:20:30,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 448 flow [2024-11-28 05:20:30,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 422 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-28 05:20:30,772 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 178 flow [2024-11-28 05:20:30,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-11-28 05:20:30,773 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -8 predicate places. [2024-11-28 05:20:30,773 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 178 flow [2024-11-28 05:20:30,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:30,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:30,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:30,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:20:30,774 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 521220097, now seen corresponding path program 2 times [2024-11-28 05:20:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791599537] [2024-11-28 05:20:30,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:30,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:20:30,901 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:20:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:31,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791599537] [2024-11-28 05:20:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791599537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584537873] [2024-11-28 05:20:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:31,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:31,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:31,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:31,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:31,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:31,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:31,529 INFO L124 PetriNetUnfolderBase]: 371/635 cut-off events. [2024-11-28 05:20:31,529 INFO L125 PetriNetUnfolderBase]: For 452/482 co-relation queries the response was YES. [2024-11-28 05:20:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 635 events. 371/635 cut-off events. For 452/482 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2475 event pairs, 25 based on Foata normal form. 38/658 useless extension candidates. Maximal degree in co-relation 1811. Up to 228 conditions per place. [2024-11-28 05:20:31,535 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 45 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-28 05:20:31,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 376 flow [2024-11-28 05:20:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:20:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-28 05:20:31,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2024-11-28 05:20:31,537 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 178 flow. Second operand 6 states and 151 transitions. [2024-11-28 05:20:31,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 376 flow [2024-11-28 05:20:31,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 343 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-28 05:20:31,540 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 187 flow [2024-11-28 05:20:31,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-11-28 05:20:31,541 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -14 predicate places. [2024-11-28 05:20:31,541 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 187 flow [2024-11-28 05:20:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:31,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:31,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:31,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:20:31,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 840371524, now seen corresponding path program 1 times [2024-11-28 05:20:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142221848] [2024-11-28 05:20:31,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142221848] [2024-11-28 05:20:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142221848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:31,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:31,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:20:31,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277096596] [2024-11-28 05:20:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:31,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:31,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:31,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:31,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:31,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:31,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:31,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:31,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:31,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:32,364 INFO L124 PetriNetUnfolderBase]: 422/856 cut-off events. [2024-11-28 05:20:32,365 INFO L125 PetriNetUnfolderBase]: For 568/582 co-relation queries the response was YES. [2024-11-28 05:20:32,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 856 events. 422/856 cut-off events. For 568/582 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4403 event pairs, 151 based on Foata normal form. 8/825 useless extension candidates. Maximal degree in co-relation 2199. Up to 336 conditions per place. [2024-11-28 05:20:32,370 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 24 selfloop transitions, 1 changer transitions 22/65 dead transitions. [2024-11-28 05:20:32,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 347 flow [2024-11-28 05:20:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:20:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-28 05:20:32,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-11-28 05:20:32,373 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 187 flow. Second operand 6 states and 142 transitions. [2024-11-28 05:20:32,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 347 flow [2024-11-28 05:20:32,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 283 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-28 05:20:32,377 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 132 flow [2024-11-28 05:20:32,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=131, 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=6, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2024-11-28 05:20:32,378 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2024-11-28 05:20:32,378 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 132 flow [2024-11-28 05:20:32,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:32,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:32,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:32,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:20:32,379 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2122797658, now seen corresponding path program 2 times [2024-11-28 05:20:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813546506] [2024-11-28 05:20:32,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:32,417 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:20:32,418 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:20:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:20:32,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813546506] [2024-11-28 05:20:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813546506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:20:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21836776] [2024-11-28 05:20:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:32,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:32,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:32,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:32,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:32,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:32,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:32,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:33,130 INFO L124 PetriNetUnfolderBase]: 363/760 cut-off events. [2024-11-28 05:20:33,131 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-28 05:20:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 760 events. 363/760 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3785 event pairs, 242 based on Foata normal form. 8/728 useless extension candidates. Maximal degree in co-relation 1708. Up to 336 conditions per place. [2024-11-28 05:20:33,135 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 23 selfloop transitions, 2 changer transitions 25/68 dead transitions. [2024-11-28 05:20:33,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 312 flow [2024-11-28 05:20:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:20:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:20:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-28 05:20:33,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32796780684104626 [2024-11-28 05:20:33,138 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 132 flow. Second operand 7 states and 163 transitions. [2024-11-28 05:20:33,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 312 flow [2024-11-28 05:20:33,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 294 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-28 05:20:33,141 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 135 flow [2024-11-28 05:20:33,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=135, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-11-28 05:20:33,141 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -12 predicate places. [2024-11-28 05:20:33,142 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 135 flow [2024-11-28 05:20:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:33,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:33,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:20:33,143 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2083495096, now seen corresponding path program 3 times [2024-11-28 05:20:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840594695] [2024-11-28 05:20:33,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:20:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:33,256 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 05:20:33,256 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 05:20:33,256 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:20:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:20:33,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 05:20:33,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:20:33,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-28 05:20:33,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-28 05:20:33,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-28 05:20:33,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-28 05:20:33,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-28 05:20:33,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-28 05:20:33,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-28 05:20:33,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-28 05:20:33,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-28 05:20:33,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-28 05:20:33,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-11-28 05:20:33,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-28 05:20:33,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-28 05:20:33,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-28 05:20:33,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-28 05:20:33,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-28 05:20:33,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-28 05:20:33,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-28 05:20:33,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-28 05:20:33,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-28 05:20:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:20:33,443 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:33,609 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:20:33,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:20:33,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:20:33 BasicIcfg [2024-11-28 05:20:33,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:20:33,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:20:33,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:20:33,622 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:20:33,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:14" (3/4) ... [2024-11-28 05:20:33,625 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:20:33,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:20:33,627 INFO L158 Benchmark]: Toolchain (without parser) took 21810.99ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 92.9MB in the beginning and 277.6MB in the end (delta: -184.7MB). Peak memory consumption was 401.8MB. Max. memory is 16.1GB. [2024-11-28 05:20:33,628 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:33,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.29ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 69.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:20:33,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.80ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 67.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:33,630 INFO L158 Benchmark]: Boogie Preprocessor took 84.32ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 63.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:33,631 INFO L158 Benchmark]: RCFGBuilder took 1976.04ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 63.7MB in the beginning and 252.8MB in the end (delta: -189.1MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-11-28 05:20:33,632 INFO L158 Benchmark]: TraceAbstraction took 19036.64ms. Allocated memory was 352.3MB in the beginning and 704.6MB in the end (delta: 352.3MB). Free memory was 252.2MB in the beginning and 277.7MB in the end (delta: -25.5MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. [2024-11-28 05:20:33,633 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 704.6MB. Free memory was 277.7MB in the beginning and 277.6MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:33,635 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.54ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.29ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 69.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.80ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 67.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.32ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 63.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1976.04ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 63.7MB in the beginning and 252.8MB in the end (delta: -189.1MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19036.64ms. Allocated memory was 352.3MB in the beginning and 704.6MB in the end (delta: 352.3MB). Free memory was 252.2MB in the beginning and 277.7MB in the end (delta: -25.5MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 704.6MB. Free memory was 277.7MB in the beginning and 277.6MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t2098; [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 116 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1752 IncrementalHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 12 mSDtfsCounter, 1752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=16, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 05:20:33,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB --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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:20:36,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:20:37,060 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:20:37,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:20:37,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:20:37,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:20:37,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:20:37,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:20:37,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:20:37,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:20:37,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:20:37,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:20:37,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:20:37,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:20:37,106 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:20:37,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:20:37,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:20:37,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:20:37,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:20:37,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:20:37,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:20:37,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:37,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:20:37,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:37,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:20:37,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:20:37,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:20:37,112 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_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2024-11-28 05:20:37,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:20:37,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:20:37,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:20:37,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:20:37,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:20:37,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2024-11-28 05:20:41,227 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/21726d53a/ab8d4fb29724474180bbe42cf3002575/FLAGde4dd9804 [2024-11-28 05:20:41,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:20:41,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2024-11-28 05:20:41,597 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/21726d53a/ab8d4fb29724474180bbe42cf3002575/FLAGde4dd9804 [2024-11-28 05:20:41,627 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/data/21726d53a/ab8d4fb29724474180bbe42cf3002575 [2024-11-28 05:20:41,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:20:41,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:20:41,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:41,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:20:41,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:20:41,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:41" (1/1) ... [2024-11-28 05:20:41,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e20ad57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:41, skipping insertion in model container [2024-11-28 05:20:41,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:20:41" (1/1) ... [2024-11-28 05:20:41,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:20:42,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:42,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:20:42,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:20:42,502 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:20:42,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42 WrapperNode [2024-11-28 05:20:42,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:20:42,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:42,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:20:42,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:20:42,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,591 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-11-28 05:20:42,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:20:42,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:20:42,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:20:42,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:20:42,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,644 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 05:20:42,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:20:42,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:20:42,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:20:42,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:20:42,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (1/1) ... [2024-11-28 05:20:42,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:20:42,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:42,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:20:42,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:20:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:20:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:20:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 05:20:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:20:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:20:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:20:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:20:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:20:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-28 05:20:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-28 05:20:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 05:20:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 05:20:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 05:20:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 05:20:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 05:20:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 05:20:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 05:20:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:20:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:20:42,787 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:20:43,119 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:20:43,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:20:43,990 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:20:43,990 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:20:45,142 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:20:45,144 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 05:20:45,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:45 BoogieIcfgContainer [2024-11-28 05:20:45,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:20:45,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:20:45,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:20:45,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:20:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:20:41" (1/3) ... [2024-11-28 05:20:45,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6979783e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:45, skipping insertion in model container [2024-11-28 05:20:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:20:42" (2/3) ... [2024-11-28 05:20:45,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6979783e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:20:45, skipping insertion in model container [2024-11-28 05:20:45,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:45" (3/3) ... [2024-11-28 05:20:45,157 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2024-11-28 05:20:45,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:20:45,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.oepc.i that has 4 procedures, 70 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2024-11-28 05:20:45,182 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:20:45,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 05:20:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 71 transitions, 154 flow [2024-11-28 05:20:45,563 INFO L124 PetriNetUnfolderBase]: 2/68 cut-off events. [2024-11-28 05:20:45,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:45,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 2/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 231 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-28 05:20:45,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 71 transitions, 154 flow [2024-11-28 05:20:45,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 68 transitions, 145 flow [2024-11-28 05:20:45,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:20:45,610 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;@5f15f58a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:20:45,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-28 05:20:45,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:20:45,621 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-28 05:20:45,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:45,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:45,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 05:20:45,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 22307093, now seen corresponding path program 1 times [2024-11-28 05:20:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614646366] [2024-11-28 05:20:45,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:45,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:45,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:45,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:20:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:20:45,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:45,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:45,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614646366] [2024-11-28 05:20:45,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614646366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888608889] [2024-11-28 05:20:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:45,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:46,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:46,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:46,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:46,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:46,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:46,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:46,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:47,367 INFO L124 PetriNetUnfolderBase]: 1505/2570 cut-off events. [2024-11-28 05:20:47,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:47,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 2570 events. 1505/2570 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19164 event pairs, 1505 based on Foata normal form. 112/1899 useless extension candidates. Maximal degree in co-relation 4848. Up to 2258 conditions per place. [2024-11-28 05:20:47,404 INFO L140 encePairwiseOnDemand]: 48/71 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-28 05:20:47,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-11-28 05:20:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-28 05:20:47,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-11-28 05:20:47,423 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 145 flow. Second operand 3 states and 110 transitions. [2024-11-28 05:20:47,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-11-28 05:20:47,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:20:47,433 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-11-28 05:20:47,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-28 05:20:47,440 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2024-11-28 05:20:47,441 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-11-28 05:20:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:47,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:47,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 05:20:47,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:47,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:47,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 22307094, now seen corresponding path program 1 times [2024-11-28 05:20:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:47,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907403716] [2024-11-28 05:20:47,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:47,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:47,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:47,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:47,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:20:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:47,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:20:47,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:47,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:47,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907403716] [2024-11-28 05:20:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907403716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716643970] [2024-11-28 05:20:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:47,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:47,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:47,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:47,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:47,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:47,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:48,333 INFO L124 PetriNetUnfolderBase]: 501/941 cut-off events. [2024-11-28 05:20:48,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:48,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 941 events. 501/941 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6270 event pairs, 501 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1743. Up to 784 conditions per place. [2024-11-28 05:20:48,344 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 05:20:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-11-28 05:20:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-28 05:20:48,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4131455399061033 [2024-11-28 05:20:48,348 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-11-28 05:20:48,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-11-28 05:20:48,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:48,350 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-28 05:20:48,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-28 05:20:48,354 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-28 05:20:48,354 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-28 05:20:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:48,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:48,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:48,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:20:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:48,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash 630752629, now seen corresponding path program 1 times [2024-11-28 05:20:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252187585] [2024-11-28 05:20:48,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:48,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:48,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:20:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:48,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:20:48,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:48,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:48,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252187585] [2024-11-28 05:20:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252187585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566943946] [2024-11-28 05:20:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:48,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:48,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:48,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:48,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:48,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:48,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:48,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:49,205 INFO L124 PetriNetUnfolderBase]: 419/924 cut-off events. [2024-11-28 05:20:49,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:49,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 924 events. 419/924 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6387 event pairs, 91 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1604. Up to 517 conditions per place. [2024-11-28 05:20:49,215 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-11-28 05:20:49,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-11-28 05:20:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-11-28 05:20:49,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.460093896713615 [2024-11-28 05:20:49,217 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-11-28 05:20:49,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-11-28 05:20:49,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:49,223 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-28 05:20:49,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 05:20:49,225 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-28 05:20:49,225 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-28 05:20:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:49,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:49,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:49,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:20:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:49,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:49,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1221647278, now seen corresponding path program 1 times [2024-11-28 05:20:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:49,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178023492] [2024-11-28 05:20:49,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:49,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:49,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:49,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:20:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:49,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:20:49,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:49,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:49,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178023492] [2024-11-28 05:20:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178023492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:20:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095724093] [2024-11-28 05:20:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:49,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:49,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:49,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:49,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:49,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:49,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:49,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:49,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:50,288 INFO L124 PetriNetUnfolderBase]: 391/738 cut-off events. [2024-11-28 05:20:50,288 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-28 05:20:50,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 738 events. 391/738 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4360 event pairs, 209 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1530. Up to 472 conditions per place. [2024-11-28 05:20:50,296 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-28 05:20:50,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-11-28 05:20:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-28 05:20:50,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4084507042253521 [2024-11-28 05:20:50,298 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-11-28 05:20:50,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-11-28 05:20:50,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:50,301 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-28 05:20:50,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-28 05:20:50,302 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -26 predicate places. [2024-11-28 05:20:50,302 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-28 05:20:50,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:50,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:50,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:50,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:50,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:50,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 562969285, now seen corresponding path program 1 times [2024-11-28 05:20:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887941487] [2024-11-28 05:20:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:50,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:50,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:50,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:50,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:20:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:50,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:20:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:50,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:50,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:50,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887941487] [2024-11-28 05:20:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887941487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:20:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503732402] [2024-11-28 05:20:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:50,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:50,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:50,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:50,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-28 05:20:50,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:50,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:50,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-28 05:20:50,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:51,288 INFO L124 PetriNetUnfolderBase]: 363/836 cut-off events. [2024-11-28 05:20:51,288 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-28 05:20:51,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 836 events. 363/836 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5677 event pairs, 75 based on Foata normal form. 16/840 useless extension candidates. Maximal degree in co-relation 1568. Up to 428 conditions per place. [2024-11-28 05:20:51,296 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-28 05:20:51,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-11-28 05:20:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-28 05:20:51,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40492957746478875 [2024-11-28 05:20:51,301 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-11-28 05:20:51,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-11-28 05:20:51,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:20:51,305 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-28 05:20:51,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-28 05:20:51,307 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2024-11-28 05:20:51,308 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-28 05:20:51,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:51,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:51,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:51,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:51,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:51,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -206970891, now seen corresponding path program 1 times [2024-11-28 05:20:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523833629] [2024-11-28 05:20:51,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:51,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:51,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:51,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:51,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:20:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:51,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:20:51,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:51,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:51,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523833629] [2024-11-28 05:20:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523833629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:51,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:51,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:20:51,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29975806] [2024-11-28 05:20:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:20:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:51,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:20:51,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:20:51,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-11-28 05:20:51,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:51,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:51,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-11-28 05:20:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:52,016 INFO L124 PetriNetUnfolderBase]: 363/707 cut-off events. [2024-11-28 05:20:52,016 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-28 05:20:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 707 events. 363/707 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4502 event pairs, 363 based on Foata normal form. 24/701 useless extension candidates. Maximal degree in co-relation 1439. Up to 574 conditions per place. [2024-11-28 05:20:52,023 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-28 05:20:52,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-11-28 05:20:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:20:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:20:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-28 05:20:52,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3615023474178404 [2024-11-28 05:20:52,025 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-11-28 05:20:52,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-11-28 05:20:52,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:52,028 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-28 05:20:52,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-28 05:20:52,030 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2024-11-28 05:20:52,031 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-28 05:20:52,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:52,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:52,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:52,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:20:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:52,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash -206971396, now seen corresponding path program 1 times [2024-11-28 05:20:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765882301] [2024-11-28 05:20:52,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:52,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:52,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:52,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:20:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:52,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:20:52,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:52,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:52,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765882301] [2024-11-28 05:20:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765882301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:20:52,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889089287] [2024-11-28 05:20:52,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:52,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:20:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:52,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:20:52,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:20:52,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:52,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:52,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:52,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:53,012 INFO L124 PetriNetUnfolderBase]: 1016/1730 cut-off events. [2024-11-28 05:20:53,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:20:53,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1730 events. 1016/1730 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10193 event pairs, 96 based on Foata normal form. 60/1776 useless extension candidates. Maximal degree in co-relation 3565. Up to 1015 conditions per place. [2024-11-28 05:20:53,028 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 37 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2024-11-28 05:20:53,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 216 flow [2024-11-28 05:20:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:20:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:20:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-28 05:20:53,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38380281690140844 [2024-11-28 05:20:53,030 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 109 transitions. [2024-11-28 05:20:53,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 216 flow [2024-11-28 05:20:53,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:20:53,032 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-28 05:20:53,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-28 05:20:53,037 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2024-11-28 05:20:53,039 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-28 05:20:53,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:53,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:53,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:53,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:20:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:53,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1307192996, now seen corresponding path program 1 times [2024-11-28 05:20:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477758516] [2024-11-28 05:20:53,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:53,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:53,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:53,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:53,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:20:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:53,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:20:53,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:53,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:53,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477758516] [2024-11-28 05:20:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477758516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:20:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727221504] [2024-11-28 05:20:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:20:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:53,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:20:53,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:20:53,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:53,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:53,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:53,990 INFO L124 PetriNetUnfolderBase]: 690/1200 cut-off events. [2024-11-28 05:20:53,991 INFO L125 PetriNetUnfolderBase]: For 321/335 co-relation queries the response was YES. [2024-11-28 05:20:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 1200 events. 690/1200 cut-off events. For 321/335 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6235 event pairs, 36 based on Foata normal form. 56/1244 useless extension candidates. Maximal degree in co-relation 2889. Up to 553 conditions per place. [2024-11-28 05:20:53,998 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 46 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2024-11-28 05:20:53,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 310 flow [2024-11-28 05:20:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:20:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:20:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-28 05:20:54,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38591549295774646 [2024-11-28 05:20:54,001 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 137 transitions. [2024-11-28 05:20:54,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 310 flow [2024-11-28 05:20:54,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 05:20:54,007 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-28 05:20:54,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-28 05:20:54,010 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -21 predicate places. [2024-11-28 05:20:54,010 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-28 05:20:54,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:54,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:54,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:54,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:20:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:54,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1289807408, now seen corresponding path program 1 times [2024-11-28 05:20:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600880086] [2024-11-28 05:20:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:54,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:54,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:20:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:20:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:54,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:54,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600880086] [2024-11-28 05:20:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600880086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:20:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637534867] [2024-11-28 05:20:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:20:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:20:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:20:54,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:54,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:54,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:54,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:54,979 INFO L124 PetriNetUnfolderBase]: 371/643 cut-off events. [2024-11-28 05:20:54,979 INFO L125 PetriNetUnfolderBase]: For 581/612 co-relation queries the response was YES. [2024-11-28 05:20:54,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 643 events. 371/643 cut-off events. For 581/612 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2645 event pairs, 25 based on Foata normal form. 36/667 useless extension candidates. Maximal degree in co-relation 1781. Up to 228 conditions per place. [2024-11-28 05:20:54,984 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 41 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2024-11-28 05:20:54,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 323 flow [2024-11-28 05:20:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:20:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-28 05:20:54,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2024-11-28 05:20:54,987 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 151 transitions. [2024-11-28 05:20:54,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 323 flow [2024-11-28 05:20:54,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-28 05:20:54,991 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-28 05:20:54,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-28 05:20:54,992 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-28 05:20:54,993 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-28 05:20:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:54,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:54,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:55,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:20:55,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:55,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -27010496, now seen corresponding path program 1 times [2024-11-28 05:20:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526186524] [2024-11-28 05:20:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:55,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:55,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:55,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:20:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:20:55,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:20:55,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:20:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:55,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:20:55,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:20:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526186524] [2024-11-28 05:20:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526186524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:20:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:20:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:20:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535909336] [2024-11-28 05:20:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:20:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:20:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:20:55,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:20:55,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:20:55,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 71 [2024-11-28 05:20:55,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:55,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:20:55,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 71 [2024-11-28 05:20:55,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:20:56,105 INFO L124 PetriNetUnfolderBase]: 589/1114 cut-off events. [2024-11-28 05:20:56,105 INFO L125 PetriNetUnfolderBase]: For 511/525 co-relation queries the response was YES. [2024-11-28 05:20:56,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 1114 events. 589/1114 cut-off events. For 511/525 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5917 event pairs, 95 based on Foata normal form. 8/1096 useless extension candidates. Maximal degree in co-relation 2733. Up to 408 conditions per place. [2024-11-28 05:20:56,114 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 29 selfloop transitions, 3 changer transitions 18/68 dead transitions. [2024-11-28 05:20:56,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 341 flow [2024-11-28 05:20:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:20:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:20:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-11-28 05:20:56,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34507042253521125 [2024-11-28 05:20:56,116 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 147 transitions. [2024-11-28 05:20:56,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 341 flow [2024-11-28 05:20:56,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 274 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-28 05:20:56,122 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow [2024-11-28 05:20:56,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-28 05:20:56,123 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2024-11-28 05:20:56,123 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow [2024-11-28 05:20:56,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:20:56,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:20:56,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:56,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:20:56,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:56,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-28 05:20:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1399550478, now seen corresponding path program 2 times [2024-11-28 05:20:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:20:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441710446] [2024-11-28 05:20:56,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:20:56,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:20:56,332 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:20:56,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:20:56,553 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:20:56,553 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 05:20:56,554 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:20:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:20:56,721 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 05:20:56,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:20:56,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-28 05:20:56,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-28 05:20:56,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-28 05:20:56,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2024-11-28 05:20:56,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-28 05:20:56,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-28 05:20:56,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-28 05:20:56,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-28 05:20:56,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-28 05:20:56,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-28 05:20:56,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-11-28 05:20:56,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-11-28 05:20:56,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-28 05:20:56,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-28 05:20:56,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-28 05:20:56,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-28 05:20:56,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:56,935 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:20:57,119 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:20:57,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:20:57,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:20:57 BasicIcfg [2024-11-28 05:20:57,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:20:57,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:20:57,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:20:57,135 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:20:57,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:20:45" (3/4) ... [2024-11-28 05:20:57,139 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:20:57,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:20:57,141 INFO L158 Benchmark]: Toolchain (without parser) took 15509.75ms. Allocated memory was 83.9MB in the beginning and 293.6MB in the end (delta: 209.7MB). Free memory was 58.9MB in the beginning and 245.9MB in the end (delta: -187.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,142 INFO L158 Benchmark]: CDTParser took 1.83ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:57,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 870.72ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 35.0MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.97ms. Allocated memory is still 83.9MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:57,143 INFO L158 Benchmark]: Boogie Preprocessor took 87.65ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,144 INFO L158 Benchmark]: RCFGBuilder took 2464.44ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 29.3MB in the beginning and 72.5MB in the end (delta: -43.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,146 INFO L158 Benchmark]: TraceAbstraction took 11987.26ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 72.5MB in the beginning and 249.2MB in the end (delta: -176.7MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,146 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 293.6MB. Free memory was 249.2MB in the beginning and 245.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:20:57,149 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.83ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 870.72ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 35.0MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.97ms. Allocated memory is still 83.9MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.65ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2464.44ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 29.3MB in the beginning and 72.5MB in the end (delta: -43.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11987.26ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 72.5MB in the beginning and 249.2MB in the end (delta: -176.7MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 293.6MB. Free memory was 249.2MB in the beginning and 245.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t2098; [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 116 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 5 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 643 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1196 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 05:20:57,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6ace8-863b-4f3d-b282-cf891996c5c0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample