./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:16,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:16,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:45:16,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:16,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:16,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:16,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:16,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:16,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:16,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:16,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:16,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:16,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:16,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:16,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:16,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:16,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:16,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:16,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:16,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:16,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:16,702 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_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2024-11-13 12:45:17,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:17,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:17,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:17,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:17,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:17,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/rfi010.i Unable to find full path for "g++" [2024-11-13 12:45:19,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:19,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:19,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/sv-benchmarks/c/pthread-wmm/rfi010.i [2024-11-13 12:45:19,890 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/85c81517f/1504396aa00d4cafba6e7b6e5abe1f7f/FLAGfc3efa23b [2024-11-13 12:45:19,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/85c81517f/1504396aa00d4cafba6e7b6e5abe1f7f [2024-11-13 12:45:19,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:19,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:19,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:19,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:19,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:19,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:19" (1/1) ... [2024-11-13 12:45:19,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6482a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:19, skipping insertion in model container [2024-11-13 12:45:19,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:19" (1/1) ... [2024-11-13 12:45:19,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:20,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:20,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:20,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:20,634 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:20,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20 WrapperNode [2024-11-13 12:45:20,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:20,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:20,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:20,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:20,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,736 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-11-13 12:45:20,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:20,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:20,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:20,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:20,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,802 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:45:20,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:20,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:20,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:20,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:20,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (1/1) ... [2024-11-13 12:45:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:20,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:20,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 12:45:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 12:45:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 12:45:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 12:45:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 12:45:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:45:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 12:45:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:20,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:20,956 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:45:21,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:21,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:21,602 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:45:21,603 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:21,990 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:21,991 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:45:21,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:21 BoogieIcfgContainer [2024-11-13 12:45:21,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:21,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:21,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:22,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:22,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:19" (1/3) ... [2024-11-13 12:45:22,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77684a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:22, skipping insertion in model container [2024-11-13 12:45:22,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:20" (2/3) ... [2024-11-13 12:45:22,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77684a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:22, skipping insertion in model container [2024-11-13 12:45:22,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:21" (3/3) ... [2024-11-13 12:45:22,011 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-11-13 12:45:22,034 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:22,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi010.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 12:45:22,038 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:45:22,142 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 12:45:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-13 12:45:22,251 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-13 12:45:22,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:22,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-13 12:45:22,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-13 12:45:22,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-13 12:45:22,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:22,299 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;@39127ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:22,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 12:45:22,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 12:45:22,308 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-13 12:45:22,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:22,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:22,309 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 12:45:22,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1653120221, now seen corresponding path program 1 times [2024-11-13 12:45:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220620837] [2024-11-13 12:45:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:23,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220620837] [2024-11-13 12:45:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220620837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:45:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973667555] [2024-11-13 12:45:23,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:23,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-13 12:45:23,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:23,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-13 12:45:23,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:23,475 INFO L124 PetriNetUnfolderBase]: 166/367 cut-off events. [2024-11-13 12:45:23,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 367 events. 166/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2053 event pairs, 18 based on Foata normal form. 30/392 useless extension candidates. Maximal degree in co-relation 662. Up to 245 conditions per place. [2024-11-13 12:45:23,482 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 22 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2024-11-13 12:45:23,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 138 flow [2024-11-13 12:45:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:45:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-11-13 12:45:23,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-11-13 12:45:23,503 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 79 transitions. [2024-11-13 12:45:23,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 138 flow [2024-11-13 12:45:23,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:45:23,517 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-13 12:45:23,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-13 12:45:23,528 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-13 12:45:23,528 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-13 12:45:23,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:23,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:23,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:45:23,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:23,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -810893823, now seen corresponding path program 1 times [2024-11-13 12:45:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072750558] [2024-11-13 12:45:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072750558] [2024-11-13 12:45:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072750558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:23,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:45:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742901192] [2024-11-13 12:45:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 12:45:23,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:23,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 12:45:23,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:23,793 INFO L124 PetriNetUnfolderBase]: 144/348 cut-off events. [2024-11-13 12:45:23,793 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-13 12:45:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 348 events. 144/348 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1987 event pairs, 144 based on Foata normal form. 15/355 useless extension candidates. Maximal degree in co-relation 627. Up to 256 conditions per place. [2024-11-13 12:45:23,799 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-13 12:45:23,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow [2024-11-13 12:45:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:45:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-13 12:45:23,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-13 12:45:23,804 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions. [2024-11-13 12:45:23,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow [2024-11-13 12:45:23,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:45:23,806 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-13 12:45:23,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-13 12:45:23,808 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-13 12:45:23,808 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-13 12:45:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:23,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:23,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:45:23,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -810893746, now seen corresponding path program 1 times [2024-11-13 12:45:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748371967] [2024-11-13 12:45:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748371967] [2024-11-13 12:45:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748371967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465817115] [2024-11-13 12:45:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:24,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-13 12:45:24,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:24,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:24,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-13 12:45:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:24,671 INFO L124 PetriNetUnfolderBase]: 183/405 cut-off events. [2024-11-13 12:45:24,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:24,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 405 events. 183/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2373 event pairs, 45 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 742. Up to 151 conditions per place. [2024-11-13 12:45:24,678 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 19 selfloop transitions, 2 changer transitions 26/58 dead transitions. [2024-11-13 12:45:24,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 216 flow [2024-11-13 12:45:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:45:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 12:45:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-11-13 12:45:24,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2024-11-13 12:45:24,682 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 161 transitions. [2024-11-13 12:45:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 216 flow [2024-11-13 12:45:24,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 12:45:24,687 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2024-11-13 12:45:24,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2024-11-13 12:45:24,690 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-13 12:45:24,690 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2024-11-13 12:45:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:24,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:24,691 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:24,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:45:24,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:24,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -548700291, now seen corresponding path program 1 times [2024-11-13 12:45:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739603540] [2024-11-13 12:45:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739603540] [2024-11-13 12:45:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739603540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092876932] [2024-11-13 12:45:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:25,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:25,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-13 12:45:25,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:25,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-13 12:45:25,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:25,468 INFO L124 PetriNetUnfolderBase]: 179/380 cut-off events. [2024-11-13 12:45:25,469 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-13 12:45:25,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 380 events. 179/380 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1755 event pairs, 31 based on Foata normal form. 24/400 useless extension candidates. Maximal degree in co-relation 816. Up to 171 conditions per place. [2024-11-13 12:45:25,478 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2024-11-13 12:45:25,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 191 flow [2024-11-13 12:45:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:45:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-13 12:45:25,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-13 12:45:25,480 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 4 states and 90 transitions. [2024-11-13 12:45:25,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 191 flow [2024-11-13 12:45:25,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 175 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-13 12:45:25,486 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 89 flow [2024-11-13 12:45:25,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-11-13 12:45:25,489 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-13 12:45:25,489 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 89 flow [2024-11-13 12:45:25,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:25,491 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:25,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:45:25,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash 255318350, now seen corresponding path program 1 times [2024-11-13 12:45:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038179712] [2024-11-13 12:45:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038179712] [2024-11-13 12:45:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038179712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084712794] [2024-11-13 12:45:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:26,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-13 12:45:26,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:26,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-13 12:45:26,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:26,179 INFO L124 PetriNetUnfolderBase]: 97/212 cut-off events. [2024-11-13 12:45:26,179 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-13 12:45:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 212 events. 97/212 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 715 event pairs, 21 based on Foata normal form. 16/224 useless extension candidates. Maximal degree in co-relation 504. Up to 86 conditions per place. [2024-11-13 12:45:26,181 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-11-13 12:45:26,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 187 flow [2024-11-13 12:45:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 12:45:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-11-13 12:45:26,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-13 12:45:26,183 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 89 flow. Second operand 5 states and 100 transitions. [2024-11-13 12:45:26,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 187 flow [2024-11-13 12:45:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 173 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-13 12:45:26,185 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2024-11-13 12:45:26,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-11-13 12:45:26,185 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-13 12:45:26,186 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2024-11-13 12:45:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:26,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:45:26,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash 586101003, now seen corresponding path program 1 times [2024-11-13 12:45:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893633003] [2024-11-13 12:45:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893633003] [2024-11-13 12:45:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893633003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064455679] [2024-11-13 12:45:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:26,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:26,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-13 12:45:26,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:26,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-13 12:45:26,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:26,955 INFO L124 PetriNetUnfolderBase]: 118/298 cut-off events. [2024-11-13 12:45:26,955 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-13 12:45:26,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 298 events. 118/298 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1228 event pairs, 31 based on Foata normal form. 4/295 useless extension candidates. Maximal degree in co-relation 653. Up to 133 conditions per place. [2024-11-13 12:45:26,960 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 1 changer transitions 18/50 dead transitions. [2024-11-13 12:45:26,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 229 flow [2024-11-13 12:45:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 12:45:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-13 12:45:26,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-11-13 12:45:26,962 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 6 states and 112 transitions. [2024-11-13 12:45:26,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 229 flow [2024-11-13 12:45:26,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 195 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-13 12:45:26,967 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 84 flow [2024-11-13 12:45:26,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2024-11-13 12:45:26,969 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-13 12:45:26,969 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 84 flow [2024-11-13 12:45:26,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:26,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:26,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:45:26,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash -623588201, now seen corresponding path program 2 times [2024-11-13 12:45:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699710245] [2024-11-13 12:45:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699710245] [2024-11-13 12:45:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699710245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858866368] [2024-11-13 12:45:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:29,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:45:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:45:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:45:29,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-13 12:45:29,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:29,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:29,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-13 12:45:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:30,063 INFO L124 PetriNetUnfolderBase]: 84/218 cut-off events. [2024-11-13 12:45:30,063 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 12:45:30,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 218 events. 84/218 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 834 event pairs, 14 based on Foata normal form. 4/213 useless extension candidates. Maximal degree in co-relation 437. Up to 36 conditions per place. [2024-11-13 12:45:30,065 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 17 selfloop transitions, 5 changer transitions 18/53 dead transitions. [2024-11-13 12:45:30,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 216 flow [2024-11-13 12:45:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:45:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 12:45:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-11-13 12:45:30,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-11-13 12:45:30,069 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 84 flow. Second operand 10 states and 181 transitions. [2024-11-13 12:45:30,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 216 flow [2024-11-13 12:45:30,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 205 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-13 12:45:30,070 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 97 flow [2024-11-13 12:45:30,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=97, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2024-11-13 12:45:30,071 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-13 12:45:30,071 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 97 flow [2024-11-13 12:45:30,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:30,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:30,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:30,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:45:30,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:30,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1957518365, now seen corresponding path program 3 times [2024-11-13 12:45:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898290456] [2024-11-13 12:45:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:30,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:45:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:30,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:45:30,320 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:45:30,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-13 12:45:30,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-13 12:45:30,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-13 12:45:30,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-13 12:45:30,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-13 12:45:30,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-13 12:45:30,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:45:30,325 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-13 12:45:30,417 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 12:45:30,417 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:30,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:30 BasicIcfg [2024-11-13 12:45:30,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:30,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:30,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:30,426 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:30,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:21" (3/4) ... [2024-11-13 12:45:30,440 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:45:30,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:30,444 INFO L158 Benchmark]: Toolchain (without parser) took 10529.46ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 91.4MB in the beginning and 219.5MB in the end (delta: -128.1MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,445 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:30,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.09ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.9MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.78ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:30,447 INFO L158 Benchmark]: Boogie Preprocessor took 111.15ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,447 INFO L158 Benchmark]: RCFGBuilder took 1139.84ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 65.1MB in the end (delta: -2.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,447 INFO L158 Benchmark]: TraceAbstraction took 8430.06ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 64.5MB in the beginning and 78.3MB in the end (delta: -13.8MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,448 INFO L158 Benchmark]: Witness Printer took 15.92ms. Allocated memory is still 251.7MB. Free memory was 78.3MB in the beginning and 219.5MB in the end (delta: -141.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:30,450 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.26ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.09ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.9MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.78ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 111.15ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.84ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 65.1MB in the end (delta: -2.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8430.06ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 64.5MB in the beginning and 78.3MB in the end (delta: -13.8MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. * Witness Printer took 15.92ms. Allocated memory is still 251.7MB. Free memory was 78.3MB in the beginning and 219.5MB in the end (delta: -141.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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 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) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi010.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 2 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:45:30,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:33,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:33,337 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 12:45:33,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:33,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:33,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:33,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:33,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:33,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:33,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:33,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:33,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:33,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:33,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:33,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:33,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:33,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:33,402 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:45:33,405 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:45:33,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:33,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:33,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:33,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:33,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:33,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:33,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:33,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:33,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:33,407 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:45:33,407 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:45:33,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:33,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:33,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:33,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:33,408 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_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2024-11-13 12:45:33,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:33,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:33,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:33,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:33,709 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:33,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/rfi010.i Unable to find full path for "g++" [2024-11-13 12:45:35,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:36,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:36,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/sv-benchmarks/c/pthread-wmm/rfi010.i [2024-11-13 12:45:36,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/da55d25f3/04c1d8077742429b83f432639bfba183/FLAG6f5ef8904 [2024-11-13 12:45:36,142 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/data/da55d25f3/04c1d8077742429b83f432639bfba183 [2024-11-13 12:45:36,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:36,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:36,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:36,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:36,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:36,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525d8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36, skipping insertion in model container [2024-11-13 12:45:36,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:36,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:36,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:36,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:36,790 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:36,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36 WrapperNode [2024-11-13 12:45:36,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:36,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:36,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:36,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:36,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,872 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-11-13 12:45:36,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:36,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:36,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:36,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:36,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,932 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:45:36,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:36,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:36,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:36,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:36,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (1/1) ... [2024-11-13 12:45:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:37,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:37,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 12:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 12:45:37,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 12:45:37,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 12:45:37,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 12:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 12:45:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:37,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:37,057 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:45:37,287 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:37,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:37,805 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:45:37,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:38,173 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:38,173 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:45:38,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:38 BoogieIcfgContainer [2024-11-13 12:45:38,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:38,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:38,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:38,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:38,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:36" (1/3) ... [2024-11-13 12:45:38,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529a19da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:38, skipping insertion in model container [2024-11-13 12:45:38,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:36" (2/3) ... [2024-11-13 12:45:38,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529a19da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:38, skipping insertion in model container [2024-11-13 12:45:38,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:38" (3/3) ... [2024-11-13 12:45:38,193 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-11-13 12:45:38,211 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:38,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi010.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 12:45:38,213 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:45:38,323 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 12:45:38,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-13 12:45:38,420 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-13 12:45:38,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:38,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-13 12:45:38,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-13 12:45:38,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-13 12:45:38,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:38,466 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;@2ed8fcea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:38,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 12:45:38,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 12:45:38,475 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-13 12:45:38,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:38,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:38,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 12:45:38,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1595798429, now seen corresponding path program 1 times [2024-11-13 12:45:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717465621] [2024-11-13 12:45:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:38,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:38,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:45:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:45:38,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:38,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:38,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717465621] [2024-11-13 12:45:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717465621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:45:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560424042] [2024-11-13 12:45:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:38,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:38,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-13 12:45:38,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:38,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:38,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-13 12:45:38,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:39,095 INFO L124 PetriNetUnfolderBase]: 166/367 cut-off events. [2024-11-13 12:45:39,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:39,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 367 events. 166/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2022 event pairs, 18 based on Foata normal form. 30/393 useless extension candidates. Maximal degree in co-relation 662. Up to 245 conditions per place. [2024-11-13 12:45:39,105 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 22 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2024-11-13 12:45:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 138 flow [2024-11-13 12:45:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:45:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-11-13 12:45:39,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-11-13 12:45:39,123 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 79 transitions. [2024-11-13 12:45:39,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 138 flow [2024-11-13 12:45:39,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:45:39,134 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-13 12:45:39,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-13 12:45:39,143 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-13 12:45:39,143 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-13 12:45:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:39,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:39,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:39,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:45:39,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:39,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 222196739, now seen corresponding path program 1 times [2024-11-13 12:45:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:39,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534585457] [2024-11-13 12:45:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:39,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:39,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:45:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:45:39,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:39,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:39,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534585457] [2024-11-13 12:45:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534585457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:39,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:45:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979788455] [2024-11-13 12:45:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:39,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 12:45:39,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:39,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:39,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 12:45:39,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:39,730 INFO L124 PetriNetUnfolderBase]: 144/348 cut-off events. [2024-11-13 12:45:39,730 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-13 12:45:39,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 348 events. 144/348 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2015 event pairs, 144 based on Foata normal form. 15/356 useless extension candidates. Maximal degree in co-relation 627. Up to 256 conditions per place. [2024-11-13 12:45:39,736 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-13 12:45:39,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow [2024-11-13 12:45:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:45:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-13 12:45:39,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-13 12:45:39,741 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions. [2024-11-13 12:45:39,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow [2024-11-13 12:45:39,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:45:39,743 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-13 12:45:39,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-13 12:45:39,745 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-13 12:45:39,746 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-13 12:45:39,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:39,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:39,748 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:39,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:45:39,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:39,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 222196816, now seen corresponding path program 1 times [2024-11-13 12:45:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702827147] [2024-11-13 12:45:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:39,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:39,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:45:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:45:40,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:40,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:40,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702827147] [2024-11-13 12:45:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702827147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:40,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687472751] [2024-11-13 12:45:40,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:40,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:40,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:40,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:40,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-13 12:45:40,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:40,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:40,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-13 12:45:40,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:40,392 INFO L124 PetriNetUnfolderBase]: 191/428 cut-off events. [2024-11-13 12:45:40,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 12:45:40,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 428 events. 191/428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2136 event pairs, 31 based on Foata normal form. 24/449 useless extension candidates. Maximal degree in co-relation 788. Up to 191 conditions per place. [2024-11-13 12:45:40,397 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-11-13 12:45:40,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 172 flow [2024-11-13 12:45:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:45:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-13 12:45:40,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-13 12:45:40,399 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 90 transitions. [2024-11-13 12:45:40,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 172 flow [2024-11-13 12:45:40,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 12:45:40,402 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2024-11-13 12:45:40,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-13 12:45:40,403 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-13 12:45:40,403 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2024-11-13 12:45:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:40,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:40,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:40,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:45:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:40,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2061408367, now seen corresponding path program 1 times [2024-11-13 12:45:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718622659] [2024-11-13 12:45:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:40,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:40,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:45:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:45:40,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:40,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-13 12:45:40,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:40,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718622659] [2024-11-13 12:45:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718622659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796998981] [2024-11-13 12:45:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:40,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-13 12:45:40,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-13 12:45:40,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:40,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-13 12:45:40,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:41,034 INFO L124 PetriNetUnfolderBase]: 97/216 cut-off events. [2024-11-13 12:45:41,034 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-13 12:45:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 216 events. 97/216 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 753 event pairs, 21 based on Foata normal form. 16/229 useless extension candidates. Maximal degree in co-relation 494. Up to 86 conditions per place. [2024-11-13 12:45:41,037 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2024-11-13 12:45:41,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 184 flow [2024-11-13 12:45:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 12:45:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-11-13 12:45:41,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-13 12:45:41,040 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 100 transitions. [2024-11-13 12:45:41,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 184 flow [2024-11-13 12:45:41,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 175 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 12:45:41,043 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2024-11-13 12:45:41,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2024-11-13 12:45:41,045 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-11-13 12:45:41,045 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2024-11-13 12:45:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-13 12:45:41,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:41,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:41,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:45:41,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:41,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1210108125, now seen corresponding path program 1 times [2024-11-13 12:45:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075350602] [2024-11-13 12:45:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:41,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:41,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:41,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:41,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:45:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:41,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:41,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:41,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075350602] [2024-11-13 12:45:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075350602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108534403] [2024-11-13 12:45:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:45:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:45:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:45:41,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-11-13 12:45:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:41,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-11-13 12:45:41,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:42,538 INFO L124 PetriNetUnfolderBase]: 166/365 cut-off events. [2024-11-13 12:45:42,540 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2024-11-13 12:45:42,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 365 events. 166/365 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1421 event pairs, 36 based on Foata normal form. 4/369 useless extension candidates. Maximal degree in co-relation 864. Up to 149 conditions per place. [2024-11-13 12:45:42,543 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 34 selfloop transitions, 5 changer transitions 24/70 dead transitions. [2024-11-13 12:45:42,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 353 flow [2024-11-13 12:45:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 12:45:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-11-13 12:45:42,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-11-13 12:45:42,549 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 9 states and 154 transitions. [2024-11-13 12:45:42,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 353 flow [2024-11-13 12:45:42,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 296 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-13 12:45:42,555 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 109 flow [2024-11-13 12:45:42,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-11-13 12:45:42,556 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-13 12:45:42,557 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 109 flow [2024-11-13 12:45:42,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:42,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:42,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:42,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:45:42,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:42,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -245692787, now seen corresponding path program 2 times [2024-11-13 12:45:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:42,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598521966] [2024-11-13 12:45:42,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:45:42,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:42,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:42,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:45:42,896 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 12:45:42,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:45:42,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:45:42,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:44,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:44,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598521966] [2024-11-13 12:45:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598521966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:44,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:44,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:45:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657539908] [2024-11-13 12:45:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:45:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:45:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:44,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-13 12:45:44,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:44,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:44,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-13 12:45:44,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:45,424 INFO L124 PetriNetUnfolderBase]: 125/284 cut-off events. [2024-11-13 12:45:45,424 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2024-11-13 12:45:45,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 284 events. 125/284 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1026 event pairs, 37 based on Foata normal form. 6/287 useless extension candidates. Maximal degree in co-relation 662. Up to 137 conditions per place. [2024-11-13 12:45:45,429 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 27 selfloop transitions, 10 changer transitions 20/67 dead transitions. [2024-11-13 12:45:45,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 331 flow [2024-11-13 12:45:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:45:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 12:45:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-11-13 12:45:45,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-11-13 12:45:45,432 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 109 flow. Second operand 11 states and 189 transitions. [2024-11-13 12:45:45,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 331 flow [2024-11-13 12:45:45,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 299 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 12:45:45,438 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 163 flow [2024-11-13 12:45:45,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=163, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-11-13 12:45:45,440 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-11-13 12:45:45,440 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 163 flow [2024-11-13 12:45:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:45,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:45,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:45,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:45,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:45,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1988901211, now seen corresponding path program 3 times [2024-11-13 12:45:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730875857] [2024-11-13 12:45:45,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:45:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:45,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:45,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:45,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:45:45,765 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 12:45:45,765 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:45:45,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:45:45,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:45,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:45,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730875857] [2024-11-13 12:45:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730875857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:45,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:45,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388866842] [2024-11-13 12:45:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:45:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:45:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:45:46,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-11-13 12:45:46,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:46,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:45:46,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-11-13 12:45:46,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:45:46,466 INFO L124 PetriNetUnfolderBase]: 140/321 cut-off events. [2024-11-13 12:45:46,466 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-13 12:45:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 321 events. 140/321 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1175 event pairs, 32 based on Foata normal form. 4/325 useless extension candidates. Maximal degree in co-relation 824. Up to 138 conditions per place. [2024-11-13 12:45:46,468 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 26 selfloop transitions, 7 changer transitions 27/67 dead transitions. [2024-11-13 12:45:46,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 372 flow [2024-11-13 12:45:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 12:45:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-11-13 12:45:46,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-11-13 12:45:46,470 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 163 flow. Second operand 9 states and 148 transitions. [2024-11-13 12:45:46,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 372 flow [2024-11-13 12:45:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 351 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-13 12:45:46,475 INFO L231 Difference]: Finished difference. Result has 61 places, 34 transitions, 154 flow [2024-11-13 12:45:46,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2024-11-13 12:45:46,477 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-11-13 12:45:46,477 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 34 transitions, 154 flow [2024-11-13 12:45:46,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:46,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:45:46,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:46,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:45:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:46,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-13 12:45:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -358089681, now seen corresponding path program 4 times [2024-11-13 12:45:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:46,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357704234] [2024-11-13 12:45:46,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:45:46,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:46,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:46,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:46,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:45:46,807 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:45:46,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 12:45:46,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:45:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:46,938 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 12:45:46,938 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:45:46,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-13 12:45:46,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-13 12:45:46,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-13 12:45:46,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-13 12:45:46,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-13 12:45:46,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-13 12:45:46,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:45:47,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:47,144 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-13 12:45:47,252 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 12:45:47,252 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:47,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:47 BasicIcfg [2024-11-13 12:45:47,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:47,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:47,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:47,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:47,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:38" (3/4) ... [2024-11-13 12:45:47,268 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:45:47,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:47,270 INFO L158 Benchmark]: Toolchain (without parser) took 11122.00ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 92.4MB in the beginning and 96.5MB in the end (delta: -4.1MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,270 INFO L158 Benchmark]: CDTParser took 1.44ms. Allocated memory is still 117.4MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:47,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.76ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 68.7MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.34ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:47,271 INFO L158 Benchmark]: Boogie Preprocessor took 98.15ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,272 INFO L158 Benchmark]: RCFGBuilder took 1200.63ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 42.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,272 INFO L158 Benchmark]: TraceAbstraction took 9085.51ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 42.1MB in the beginning and 96.6MB in the end (delta: -54.5MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,273 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 268.4MB. Free memory was 96.6MB in the beginning and 96.5MB in the end (delta: 83.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:47,275 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.44ms. Allocated memory is still 117.4MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.76ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 68.7MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.34ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 98.15ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.63ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 42.6MB in the end (delta: 20.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9085.51ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 42.1MB in the beginning and 96.6MB in the end (delta: -54.5MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 268.4MB. Free memory was 96.6MB in the beginning and 96.5MB in the end (delta: 83.0kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=16382, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=16382, t1762=16383, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=16382, t1762=16383, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 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) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=16382, t1762=16383, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=16382, t1762=16383, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi010.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1118 IncrementalHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 5 mSDtfsCounter, 1118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 27 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:45:47,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4865f4f-878c-4de5-b944-300363b0bf76/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample