./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:10:18,983 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:10:19,050 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-24 01:10:19,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:10:19,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:10:19,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:10:19,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:10:19,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:10:19,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 01:10:19,093 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 01:10:19,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:10:19,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:10:19,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:10:19,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:10:19,095 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:10:19,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:10:19,096 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:10:19,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:10:19,097 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:10:19,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:10:19,097 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 01:10:19,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 01:10:19,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:10:19,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:10:19,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:10:19,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:10:19,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:10:19,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:19,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:10:19,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:10:19,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:10:19,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:10:19,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:19,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:10:19,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:10:19,101 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_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC
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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315
[2024-11-24 01:10:19,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:10:19,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:10:19,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:10:19,448 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:10:19,449 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:10:19,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:22,466 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/a0054bc07/f7674311d9024dda8f2e5393e42061ce/FLAGfe519a709
[2024-11-24 01:10:22,851 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:10:22,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:22,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/a0054bc07/f7674311d9024dda8f2e5393e42061ce/FLAGfe519a709
[2024-11-24 01:10:23,047 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/a0054bc07/f7674311d9024dda8f2e5393e42061ce
[2024-11-24 01:10:23,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:10:23,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:10:23,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:10:23,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:10:23,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:10:23,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa481d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23, skipping insertion in model container
[2024-11-24 01:10:23,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,124 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:10:23,709 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:10:23,730 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:10:23,822 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:10:23,868 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:10:23,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23 WrapperNode
[2024-11-24 01:10:23,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:10:23,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:10:23,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:10:23,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:10:23,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,933 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131
[2024-11-24 01:10:23,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:10:23,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:10:23,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:10:23,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:10:23,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,966 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-24 01:10:23,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:10:23,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:10:23,985 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:10:23,985 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:10:23,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (1/1) ...
[2024-11-24 01:10:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:24,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:10:24,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:10:24,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:10:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 01:10:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:10:24,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 01:10:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 01:10:24,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 01:10:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 01:10:24,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 01:10:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 01:10:24,066 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 01:10:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 01:10:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 01:10:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 01:10:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:10:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:10:24,069 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:10:24,271 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:10:24,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:10:24,758 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:10:24,761 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:10:25,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:10:25,054 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 01:10:25,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:25 BoogieIcfgContainer
[2024-11-24 01:10:25,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:10:25,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:10:25,058 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:10:25,065 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:10:25,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:23" (1/3) ...
[2024-11-24 01:10:25,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ccf2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:25, skipping insertion in model container
[2024-11-24 01:10:25,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:23" (2/3) ...
[2024-11-24 01:10:25,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ccf2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:25, skipping insertion in model container
[2024-11-24 01:10:25,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:25" (3/3) ...
[2024-11-24 01:10:25,067 INFO L128 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:25,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:10:25,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 01:10:25,087 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:10:25,182 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:10:25,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 01:10:25,287 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events.
[2024-11-24 01:10:25,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:10:25,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place.
[2024-11-24 01:10:25,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 01:10:25,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow
[2024-11-24 01:10:25,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:10:25,337 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;@795fb5a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:10:25,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-11-24 01:10:25,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:10:25,345 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-24 01:10:25,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:10:25,345 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:25,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 01:10:25,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash 12890489, now seen corresponding path program 1 times
[2024-11-24 01:10:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369390415]
[2024-11-24 01:10:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:25,896 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-24 01:10:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:25,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369390415]
[2024-11-24 01:10:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369390415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:25,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:10:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210677800]
[2024-11-24 01:10:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:10:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:25,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:10:25,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:10:25,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54
[2024-11-24 01:10:25,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-24 01:10:25,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:25,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54
[2024-11-24 01:10:25,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:27,673 INFO L124 PetriNetUnfolderBase]: 3311/5438 cut-off events.
[2024-11-24 01:10:27,673 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-11-24 01:10:27,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 5438 events. 3311/5438 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38875 event pairs, 593 based on Foata normal form. 288/5671 useless extension candidates. Maximal degree in co-relation 10106. Up to 3661 conditions per place.
[2024-11-24 01:10:27,729 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 41 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2024-11-24 01:10:27,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 243 flow
[2024-11-24 01:10:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:10:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:10:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions.
[2024-11-24 01:10:27,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049
[2024-11-24 01:10:27,748 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 125 transitions.
[2024-11-24 01:10:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 243 flow
[2024-11-24 01:10:27,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-24 01:10:27,764 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow
[2024-11-24 01:10:27,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45}
[2024-11-24 01:10:27,772 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places.
[2024-11-24 01:10:27,773 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow
[2024-11-24 01:10:27,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-24 01:10:27,774 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:27,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 01:10:27,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash 299462370, now seen corresponding path program 1 times
[2024-11-24 01:10:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277957408]
[2024-11-24 01:10:27,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:27,919 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-24 01:10:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277957408]
[2024-11-24 01:10:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277957408] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:27,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:10:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978818428]
[2024-11-24 01:10:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:27,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:10:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:27,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:10:27,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:10:27,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 01:10:27,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-24 01:10:27,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:27,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 01:10:27,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:28,931 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events.
[2024-11-24 01:10:28,931 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES.
[2024-11-24 01:10:28,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 4911 events. 2903/4911 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34666 event pairs, 2903 based on Foata normal form. 144/4885 useless extension candidates. Maximal degree in co-relation 9305. Up to 4016 conditions per place.
[2024-11-24 01:10:28,973 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions.
[2024-11-24 01:10:28,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow
[2024-11-24 01:10:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:10:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:10:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-24 01:10:28,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654
[2024-11-24 01:10:28,977 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions.
[2024-11-24 01:10:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow
[2024-11-24 01:10:28,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:10:28,980 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow
[2024-11-24 01:10:28,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2024-11-24 01:10:28,981 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places.
[2024-11-24 01:10:28,981 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow
[2024-11-24 01:10:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-24 01:10:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:28,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 01:10:28,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 299463748, now seen corresponding path program 1 times
[2024-11-24 01:10:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134409457]
[2024-11-24 01:10:28,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:29,418 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-24 01:10:29,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134409457]
[2024-11-24 01:10:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134409457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:10:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790584680]
[2024-11-24 01:10:29,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:29,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:10:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:29,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:10:29,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:10:29,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:10:29,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-24 01:10:29,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:29,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:10:29,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:31,583 INFO L124 PetriNetUnfolderBase]: 8875/13627 cut-off events.
[2024-11-24 01:10:31,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:10:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25949 conditions, 13627 events. 8875/13627 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 96356 event pairs, 1033 based on Foata normal form. 400/13862 useless extension candidates. Maximal degree in co-relation 25943. Up to 7301 conditions per place.
[2024-11-24 01:10:31,686 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 53 selfloop transitions, 6 changer transitions 1/75 dead transitions.
[2024-11-24 01:10:31,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 286 flow
[2024-11-24 01:10:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 01:10:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 01:10:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions.
[2024-11-24 01:10:31,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074
[2024-11-24 01:10:31,691 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 142 transitions.
[2024-11-24 01:10:31,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 286 flow
[2024-11-24 01:10:31,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:10:31,694 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow
[2024-11-24 01:10:31,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47}
[2024-11-24 01:10:31,695 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places.
[2024-11-24 01:10:31,695 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow
[2024-11-24 01:10:31,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-24 01:10:31,695 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:31,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 01:10:31,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1800833149, now seen corresponding path program 1 times
[2024-11-24 01:10:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499953979]
[2024-11-24 01:10:31,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:32,060 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-24 01:10:32,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:32,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499953979]
[2024-11-24 01:10:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499953979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:32,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:32,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:10:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131417598]
[2024-11-24 01:10:32,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:10:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:32,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:10:32,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:10:32,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:10:32,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:32,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:32,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:10:32,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:33,993 INFO L124 PetriNetUnfolderBase]: 6751/10387 cut-off events.
[2024-11-24 01:10:33,993 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES.
[2024-11-24 01:10:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23244 conditions, 10387 events. 6751/10387 cut-off events. For 2428/2428 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 69441 event pairs, 451 based on Foata normal form. 364/10606 useless extension candidates. Maximal degree in co-relation 23235. Up to 4601 conditions per place.
[2024-11-24 01:10:34,051 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 68 selfloop transitions, 10 changer transitions 1/94 dead transitions.
[2024-11-24 01:10:34,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 418 flow
[2024-11-24 01:10:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:10:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:10:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions.
[2024-11-24 01:10:34,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704
[2024-11-24 01:10:34,053 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 181 transitions.
[2024-11-24 01:10:34,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 418 flow
[2024-11-24 01:10:34,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 407 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 01:10:34,061 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow
[2024-11-24 01:10:34,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51}
[2024-11-24 01:10:34,061 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places.
[2024-11-24 01:10:34,062 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow
[2024-11-24 01:10:34,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:34,062 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:34,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:34,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 01:10:34,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:34,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 735979333, now seen corresponding path program 1 times
[2024-11-24 01:10:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031249593]
[2024-11-24 01:10:34,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:34,487 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-24 01:10:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031249593]
[2024-11-24 01:10:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031249593] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:10:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487087251]
[2024-11-24 01:10:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:34,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:10:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:34,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:10:34,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:10:34,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:10:34,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:34,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:34,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:10:34,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:35,384 INFO L124 PetriNetUnfolderBase]: 4259/6443 cut-off events.
[2024-11-24 01:10:35,384 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES.
[2024-11-24 01:10:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16286 conditions, 6443 events. 4259/6443 cut-off events. For 4750/4750 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 37567 event pairs, 289 based on Foata normal form. 244/6553 useless extension candidates. Maximal degree in co-relation 16275. Up to 1788 conditions per place.
[2024-11-24 01:10:35,420 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 81 selfloop transitions, 14 changer transitions 1/111 dead transitions.
[2024-11-24 01:10:35,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 549 flow
[2024-11-24 01:10:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:10:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:10:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions.
[2024-11-24 01:10:35,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6728395061728395
[2024-11-24 01:10:35,422 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 218 transitions.
[2024-11-24 01:10:35,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 549 flow
[2024-11-24 01:10:35,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 519 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 01:10:35,450 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow
[2024-11-24 01:10:35,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55}
[2024-11-24 01:10:35,451 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places.
[2024-11-24 01:10:35,453 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow
[2024-11-24 01:10:35,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:35,453 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:35,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:35,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 01:10:35,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:35,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:35,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1064207219, now seen corresponding path program 1 times
[2024-11-24 01:10:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296418764]
[2024-11-24 01:10:35,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:10:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296418764]
[2024-11-24 01:10:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296418764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:10:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244823897]
[2024-11-24 01:10:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:10:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:35,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:10:35,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:10:35,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:10:35,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-24 01:10:35,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:35,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:10:35,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:36,648 INFO L124 PetriNetUnfolderBase]: 2895/4211 cut-off events.
[2024-11-24 01:10:36,648 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES.
[2024-11-24 01:10:36,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11687 conditions, 4211 events. 2895/4211 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4173 useless extension candidates. Maximal degree in co-relation 11675. Up to 1316 conditions per place.
[2024-11-24 01:10:36,671 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 18 changer transitions 1/106 dead transitions.
[2024-11-24 01:10:36,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 539 flow
[2024-11-24 01:10:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:10:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:10:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions.
[2024-11-24 01:10:36,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164
[2024-11-24 01:10:36,673 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions.
[2024-11-24 01:10:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 539 flow
[2024-11-24 01:10:36,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 493 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-24 01:10:36,713 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow
[2024-11-24 01:10:36,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55}
[2024-11-24 01:10:36,715 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places.
[2024-11-24 01:10:36,715 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow
[2024-11-24 01:10:36,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-24 01:10:36,716 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:36,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:36,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 01:10:36,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:36,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1522059816, now seen corresponding path program 1 times
[2024-11-24 01:10:36,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:36,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703590724]
[2024-11-24 01:10:36,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:38,913 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-24 01:10:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703590724]
[2024-11-24 01:10:38,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703590724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:38,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:38,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-24 01:10:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117282376]
[2024-11-24 01:10:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:38,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-24 01:10:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:38,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-24 01:10:38,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-24 01:10:38,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 01:10:38,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:38,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:38,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 01:10:38,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:39,818 INFO L124 PetriNetUnfolderBase]: 2149/3522 cut-off events.
[2024-11-24 01:10:39,818 INFO L125 PetriNetUnfolderBase]: For 2226/2352 co-relation queries the response was YES.
[2024-11-24 01:10:39,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8632 conditions, 3522 events. 2149/3522 cut-off events. For 2226/2352 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21413 event pairs, 519 based on Foata normal form. 16/3331 useless extension candidates. Maximal degree in co-relation 8619. Up to 1087 conditions per place.
[2024-11-24 01:10:39,845 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 56 selfloop transitions, 5 changer transitions 16/108 dead transitions.
[2024-11-24 01:10:39,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 531 flow
[2024-11-24 01:10:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 01:10:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 01:10:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 294 transitions.
[2024-11-24 01:10:39,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383
[2024-11-24 01:10:39,847 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 9 states and 294 transitions.
[2024-11-24 01:10:39,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 531 flow
[2024-11-24 01:10:39,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 425 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-11-24 01:10:39,869 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 176 flow
[2024-11-24 01:10:39,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=70, PETRI_TRANSITIONS=56}
[2024-11-24 01:10:39,870 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places.
[2024-11-24 01:10:39,870 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 176 flow
[2024-11-24 01:10:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:39,870 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:39,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:39,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 01:10:39,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:39,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 915962552, now seen corresponding path program 2 times
[2024-11-24 01:10:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:39,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652647403]
[2024-11-24 01:10:39,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:10:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:40,021 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:10:40,022 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:10:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:10:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652647403]
[2024-11-24 01:10:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652647403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:10:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629798592]
[2024-11-24 01:10:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:10:40,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:10:40,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:10:40,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54
[2024-11-24 01:10:40,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:40,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:40,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54
[2024-11-24 01:10:40,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:42,655 INFO L124 PetriNetUnfolderBase]: 12327/18794 cut-off events.
[2024-11-24 01:10:42,656 INFO L125 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES.
[2024-11-24 01:10:42,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40098 conditions, 18794 events. 12327/18794 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 131995 event pairs, 2490 based on Foata normal form. 32/18011 useless extension candidates. Maximal degree in co-relation 40086. Up to 6789 conditions per place.
[2024-11-24 01:10:42,772 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 53 selfloop transitions, 9 changer transitions 35/122 dead transitions.
[2024-11-24 01:10:42,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 544 flow
[2024-11-24 01:10:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 01:10:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 01:10:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions.
[2024-11-24 01:10:42,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556
[2024-11-24 01:10:42,777 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 176 flow. Second operand 8 states and 240 transitions.
[2024-11-24 01:10:42,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 544 flow
[2024-11-24 01:10:42,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 122 transitions, 516 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-11-24 01:10:42,794 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 231 flow
[2024-11-24 01:10:42,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=231, PETRI_PLACES=75, PETRI_TRANSITIONS=61}
[2024-11-24 01:10:42,795 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places.
[2024-11-24 01:10:42,795 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 231 flow
[2024-11-24 01:10:42,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:42,795 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:42,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:42,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 01:10:42,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:42,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash -986689218, now seen corresponding path program 3 times
[2024-11-24 01:10:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694776169]
[2024-11-24 01:10:42,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 01:10:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:42,934 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 01:10:42,935 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:10:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:10:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:43,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694776169]
[2024-11-24 01:10:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694776169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:43,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:43,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 01:10:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968645752]
[2024-11-24 01:10:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:43,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:10:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:43,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:10:43,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:10:43,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54
[2024-11-24 01:10:43,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:43,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:43,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54
[2024-11-24 01:10:43,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:45,070 INFO L124 PetriNetUnfolderBase]: 9650/14812 cut-off events.
[2024-11-24 01:10:45,070 INFO L125 PetriNetUnfolderBase]: For 4292/4295 co-relation queries the response was YES.
[2024-11-24 01:10:45,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35245 conditions, 14812 events. 9650/14812 cut-off events. For 4292/4295 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 99502 event pairs, 1503 based on Foata normal form. 18/14146 useless extension candidates. Maximal degree in co-relation 35229. Up to 4821 conditions per place.
[2024-11-24 01:10:45,135 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 59 selfloop transitions, 15 changer transitions 53/151 dead transitions.
[2024-11-24 01:10:45,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 151 transitions, 783 flow
[2024-11-24 01:10:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 01:10:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 01:10:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions.
[2024-11-24 01:10:45,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926
[2024-11-24 01:10:45,137 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 231 flow. Second operand 8 states and 256 transitions.
[2024-11-24 01:10:45,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 151 transitions, 783 flow
[2024-11-24 01:10:45,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 151 transitions, 749 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-24 01:10:45,155 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 318 flow
[2024-11-24 01:10:45,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2024-11-24 01:10:45,156 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places.
[2024-11-24 01:10:45,156 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 318 flow
[2024-11-24 01:10:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:10:45,156 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:45,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:45,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 01:10:45,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -993230086, now seen corresponding path program 4 times
[2024-11-24 01:10:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:45,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901551298]
[2024-11-24 01:10:45,157 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 01:10:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:45,183 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 01:10:45,183 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:10:45,415 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-24 01:10:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:10:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901551298]
[2024-11-24 01:10:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901551298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:45,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:10:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915993482]
[2024-11-24 01:10:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:10:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:10:45,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:10:45,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:10:45,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 01:10:45,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-24 01:10:45,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:45,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 01:10:45,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:46,721 INFO L124 PetriNetUnfolderBase]: 5895/10005 cut-off events.
[2024-11-24 01:10:46,721 INFO L125 PetriNetUnfolderBase]: For 5036/5160 co-relation queries the response was YES.
[2024-11-24 01:10:46,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23229 conditions, 10005 events. 5895/10005 cut-off events. For 5036/5160 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 72609 event pairs, 2903 based on Foata normal form. 77/9516 useless extension candidates. Maximal degree in co-relation 23210. Up to 4664 conditions per place.
[2024-11-24 01:10:46,785 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 29 selfloop transitions, 2 changer transitions 40/100 dead transitions.
[2024-11-24 01:10:46,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 536 flow
[2024-11-24 01:10:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:10:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:10:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-11-24 01:10:46,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876
[2024-11-24 01:10:46,787 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 318 flow. Second operand 6 states and 185 transitions.
[2024-11-24 01:10:46,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 536 flow
[2024-11-24 01:10:46,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 526 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-11-24 01:10:46,796 INFO L231 Difference]: Finished difference. Result has 80 places, 55 transitions, 230 flow
[2024-11-24 01:10:46,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=80, PETRI_TRANSITIONS=55}
[2024-11-24 01:10:46,798 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places.
[2024-11-24 01:10:46,798 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 55 transitions, 230 flow
[2024-11-24 01:10:46,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-24 01:10:46,798 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:46,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:46,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 01:10:46,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:46,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1328170272, now seen corresponding path program 5 times
[2024-11-24 01:10:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:10:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908454426]
[2024-11-24 01:10:46,800 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 01:10:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:10:46,914 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:10:46,914 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 01:10:46,914 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:10:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:10:47,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:10:47,084 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:10:47,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2024-11-24 01:10:47,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining)
[2024-11-24 01:10:47,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 01:10:47,091 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:47,233 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 01:10:47,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:10:47,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:10:47 BasicIcfg
[2024-11-24 01:10:47,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:10:47,242 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:10:47,242 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:10:47,242 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 01:10:47,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:25" (3/4) ...
[2024-11-24 01:10:47,247 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 01:10:47,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:10:47,249 INFO L158 Benchmark]: Toolchain (without parser) took 24196.10ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 115.8MB in the beginning and 894.0MB in the end (delta: -778.2MB). Peak memory consumption was 514.7MB. Max. memory is 16.1GB.
[2024-11-24 01:10:47,249 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:10:47,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.87ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 91.5MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-24 01:10:47,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:10:47,250 INFO L158 Benchmark]: Boogie Preprocessor took 50.09ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:10:47,251 INFO L158 Benchmark]: RCFGBuilder took 1070.01ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 99.9MB in the end (delta: -14.2MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
[2024-11-24 01:10:47,251 INFO L158 Benchmark]: TraceAbstraction took 22183.13ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 894.2MB in the end (delta: -794.9MB). Peak memory consumption was 500.2MB. Max. memory is 16.1GB.
[2024-11-24 01:10:47,251 INFO L158 Benchmark]: Witness Printer took 6.60ms. Allocated memory is still 1.4GB. Free memory was 894.2MB in the beginning and 894.0MB in the end (delta: 190.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:10:47,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 813.87ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 91.5MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 64.40ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 50.09ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 1070.01ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 99.9MB in the end (delta: -14.2MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 22183.13ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 894.2MB in the end (delta: -794.9MB). Peak memory consumption was 500.2MB. Max. memory is 16.1GB.
* Witness Printer took 6.60ms. Allocated memory is still 1.4GB. Free memory was 894.2MB in the beginning and 894.0MB in the end (delta: 190.0kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool a$flush_delayed;
[L720] 0 int a$mem_tmp;
[L721] 0 _Bool a$r_buff0_thd0;
[L722] 0 _Bool a$r_buff0_thd1;
[L723] 0 _Bool a$r_buff0_thd2;
[L724] 0 _Bool a$r_buff0_thd3;
[L725] 0 _Bool a$r_buff0_thd4;
[L726] 0 _Bool a$r_buff1_thd0;
[L727] 0 _Bool a$r_buff1_thd1;
[L728] 0 _Bool a$r_buff1_thd2;
[L729] 0 _Bool a$r_buff1_thd3;
[L730] 0 _Bool a$r_buff1_thd4;
[L731] 0 _Bool a$read_delayed;
[L732] 0 int *a$read_delayed_var;
[L733] 0 int a$w_buff0;
[L734] 0 _Bool a$w_buff0_used;
[L735] 0 int a$w_buff1;
[L736] 0 _Bool a$w_buff1_used;
[L737] 0 _Bool main$tmp_guard0;
[L738] 0 _Bool main$tmp_guard1;
[L740] 0 int x = 0;
[L742] 0 int y = 0;
[L744] 0 int z = 0;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L864] 0 pthread_t t769;
[L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L750] 1 a$w_buff1 = a$w_buff0
[L751] 1 a$w_buff0 = 1
[L752] 1 a$w_buff1_used = a$w_buff0_used
[L753] 1 a$w_buff0_used = (_Bool)1
[L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4
[L760] 1 a$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L866] 0 pthread_t t770;
[L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L763] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L780] 2 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L783] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L868] 0 pthread_t t771;
[L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L870] 0 pthread_t t772;
[L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L800] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0]
[L803] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L820] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L823] 4 __unbuffered_p3_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L826] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 4 a$flush_delayed = weak$$choice2
[L829] 4 a$mem_tmp = a
[L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] 4 __unbuffered_p3_EBX = a
[L838] 4 a = a$flush_delayed ? a$mem_tmp : a
[L839] 4 a$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L875] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L875] RET 0 assume_abort_if_not(main$tmp_guard0)
[L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L886] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L17] 0 __assert_fail ("0", "mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 871]: 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: 869]: 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: 867]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 87 locations, 8 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: 21.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 696 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1475 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 40 mSDtfsCounter, 1475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-24 01:10:47,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/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_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:10:49,949 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:10:50,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-24 01:10:50,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:10:50,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:10:50,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:10:50,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:10:50,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:10:50,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 01:10:50,134 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 01:10:50,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:10:50,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:10:50,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:10:50,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:10:50,136 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:10:50,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:10:50,136 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:10:50,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:10:50,136 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:10:50,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-24 01:10:50,137 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-24 01:10:50,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:10:50,138 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:10:50,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:10:50,138 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:10:50,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:50,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:10:50,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:10:50,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:50,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:10:50,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:10:50,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:10:50,142 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_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC
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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315
[2024-11-24 01:10:50,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:10:50,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:10:50,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:10:50,542 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:10:50,544 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:10:50,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:53,746 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/1a18a5138/c62b167f9f43472ea37f05d52029f3f4/FLAGffd3f5f9b
[2024-11-24 01:10:54,141 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:10:54,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:54,165 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/1a18a5138/c62b167f9f43472ea37f05d52029f3f4/FLAGffd3f5f9b
[2024-11-24 01:10:54,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/data/1a18a5138/c62b167f9f43472ea37f05d52029f3f4
[2024-11-24 01:10:54,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:10:54,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:10:54,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:10:54,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:10:54,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:10:54,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51363439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54, skipping insertion in model container
[2024-11-24 01:10:54,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,250 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:10:54,685 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:10:54,701 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:10:54,771 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:10:54,811 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:10:54,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54 WrapperNode
[2024-11-24 01:10:54,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:10:54,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:10:54,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:10:54,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:10:54,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,865 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132
[2024-11-24 01:10:54,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:10:54,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:10:54,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:10:54,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:10:54,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,909 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-24 01:10:54,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:10:54,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:10:54,954 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:10:54,954 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:10:54,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (1/1) ...
[2024-11-24 01:10:54,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:10:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:10:54,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:10:54,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:10:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 01:10:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:10:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-24 01:10:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 01:10:55,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 01:10:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 01:10:55,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 01:10:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 01:10:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 01:10:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 01:10:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 01:10:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 01:10:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:10:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:10:55,024 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:10:55,211 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:10:55,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:10:55,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:10:55,690 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:10:56,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:10:56,013 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 01:10:56,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:56 BoogieIcfgContainer
[2024-11-24 01:10:56,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:10:56,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:10:56,018 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:10:56,023 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:10:56,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:54" (1/3) ...
[2024-11-24 01:10:56,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47db2fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:56, skipping insertion in model container
[2024-11-24 01:10:56,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:54" (2/3) ...
[2024-11-24 01:10:56,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47db2fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:56, skipping insertion in model container
[2024-11-24 01:10:56,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:56" (3/3) ...
[2024-11-24 01:10:56,027 INFO L128 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-11-24 01:10:56,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:10:56,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 01:10:56,046 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:10:56,148 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:10:56,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 01:10:56,253 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events.
[2024-11-24 01:10:56,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:10:56,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place.
[2024-11-24 01:10:56,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 01:10:56,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow
[2024-11-24 01:10:56,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:10:56,296 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;@7bb83a36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:10:56,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-11-24 01:10:56,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:10:56,301 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-24 01:10:56,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:10:56,302 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:56,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 01:10:56,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:56,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash 12952057, now seen corresponding path program 1 times
[2024-11-24 01:10:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:10:56,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150714574]
[2024-11-24 01:10:56,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:10:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:10:56,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:10:56,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 01:10:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 01:10:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:10:56,517 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-24 01:10:56,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:10:56,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:10:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150714574]
[2024-11-24 01:10:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150714574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:10:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452024249]
[2024-11-24 01:10:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:10:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:10:56,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:10:56,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:10:56,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54
[2024-11-24 01:10:56,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-24 01:10:56,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:56,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54
[2024-11-24 01:10:56,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:58,128 INFO L124 PetriNetUnfolderBase]: 3311/5438 cut-off events.
[2024-11-24 01:10:58,129 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-11-24 01:10:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 5438 events. 3311/5438 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38875 event pairs, 593 based on Foata normal form. 288/5671 useless extension candidates. Maximal degree in co-relation 10106. Up to 3661 conditions per place.
[2024-11-24 01:10:58,180 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 41 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2024-11-24 01:10:58,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 243 flow
[2024-11-24 01:10:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:10:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:10:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions.
[2024-11-24 01:10:58,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049
[2024-11-24 01:10:58,195 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 125 transitions.
[2024-11-24 01:10:58,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 243 flow
[2024-11-24 01:10:58,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-24 01:10:58,208 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow
[2024-11-24 01:10:58,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45}
[2024-11-24 01:10:58,214 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places.
[2024-11-24 01:10:58,214 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow
[2024-11-24 01:10:58,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-24 01:10:58,215 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:58,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:58,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-24 01:10:58,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:10:58,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:58,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1378315492, now seen corresponding path program 1 times
[2024-11-24 01:10:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:10:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804811950]
[2024-11-24 01:10:58,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:10:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:10:58,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:10:58,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 01:10:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:58,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-24 01:10:58,534 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:10:58,571 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-24 01:10:58,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:10:58,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:10:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804811950]
[2024-11-24 01:10:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804811950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:10:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387709917]
[2024-11-24 01:10:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:10:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:10:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:10:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:10:58,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 01:10:58,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-24 01:10:58,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:58,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 01:10:58,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:10:59,515 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events.
[2024-11-24 01:10:59,515 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES.
[2024-11-24 01:10:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 4911 events. 2903/4911 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34646 event pairs, 2903 based on Foata normal form. 144/4885 useless extension candidates. Maximal degree in co-relation 9305. Up to 4016 conditions per place.
[2024-11-24 01:10:59,557 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions.
[2024-11-24 01:10:59,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow
[2024-11-24 01:10:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:10:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:10:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-24 01:10:59,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654
[2024-11-24 01:10:59,562 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions.
[2024-11-24 01:10:59,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow
[2024-11-24 01:10:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:10:59,565 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow
[2024-11-24 01:10:59,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2024-11-24 01:10:59,566 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places.
[2024-11-24 01:10:59,566 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow
[2024-11-24 01:10:59,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-24 01:10:59,567 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:10:59,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:10:59,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-24 01:10:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:10:59,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:10:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:10:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1378316870, now seen corresponding path program 1 times
[2024-11-24 01:10:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:10:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054930948]
[2024-11-24 01:10:59,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:10:59,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:10:59,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:10:59,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:10:59,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-24 01:10:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:10:59,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-24 01:10:59,901 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:10:59,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-24 01:10:59,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:10:59,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:10:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054930948]
[2024-11-24 01:10:59,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054930948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:10:59,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:10:59,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:10:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681641061]
[2024-11-24 01:10:59,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:10:59,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:10:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:10:59,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:10:59,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:10:59,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:10:59,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-24 01:10:59,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:10:59,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:10:59,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:02,031 INFO L124 PetriNetUnfolderBase]: 8875/13627 cut-off events.
[2024-11-24 01:11:02,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:11:02,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25949 conditions, 13627 events. 8875/13627 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 96471 event pairs, 1033 based on Foata normal form. 400/13862 useless extension candidates. Maximal degree in co-relation 25943. Up to 7301 conditions per place.
[2024-11-24 01:11:02,127 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 53 selfloop transitions, 6 changer transitions 1/75 dead transitions.
[2024-11-24 01:11:02,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 286 flow
[2024-11-24 01:11:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 01:11:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 01:11:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions.
[2024-11-24 01:11:02,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074
[2024-11-24 01:11:02,129 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 142 transitions.
[2024-11-24 01:11:02,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 286 flow
[2024-11-24 01:11:02,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:11:02,131 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow
[2024-11-24 01:11:02,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47}
[2024-11-24 01:11:02,132 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places.
[2024-11-24 01:11:02,133 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow
[2024-11-24 01:11:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-24 01:11:02,133 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:02,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:02,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:02,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash -286193085, now seen corresponding path program 1 times
[2024-11-24 01:11:02,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602388093]
[2024-11-24 01:11:02,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:11:02,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:02,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:02,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:02,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-24 01:11:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:11:02,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:02,464 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:02,521 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-24 01:11:02,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:02,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602388093]
[2024-11-24 01:11:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602388093] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:11:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411164082]
[2024-11-24 01:11:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:02,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:11:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:02,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:11:02,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:11:02,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:11:02,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:02,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:02,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:11:02,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:04,349 INFO L124 PetriNetUnfolderBase]: 6751/10387 cut-off events.
[2024-11-24 01:11:04,349 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES.
[2024-11-24 01:11:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23244 conditions, 10387 events. 6751/10387 cut-off events. For 2428/2428 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 69523 event pairs, 451 based on Foata normal form. 364/10606 useless extension candidates. Maximal degree in co-relation 23235. Up to 4601 conditions per place.
[2024-11-24 01:11:04,422 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 68 selfloop transitions, 10 changer transitions 1/94 dead transitions.
[2024-11-24 01:11:04,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 418 flow
[2024-11-24 01:11:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:11:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:11:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions.
[2024-11-24 01:11:04,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704
[2024-11-24 01:11:04,426 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 181 transitions.
[2024-11-24 01:11:04,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 418 flow
[2024-11-24 01:11:04,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 407 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 01:11:04,436 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow
[2024-11-24 01:11:04,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51}
[2024-11-24 01:11:04,438 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places.
[2024-11-24 01:11:04,439 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow
[2024-11-24 01:11:04,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:04,439 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:04,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:04,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:04,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:04,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1857983481, now seen corresponding path program 1 times
[2024-11-24 01:11:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571198088]
[2024-11-24 01:11:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:11:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:04,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:04,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-24 01:11:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:11:04,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:04,761 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:11:04,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:04,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571198088]
[2024-11-24 01:11:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571198088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:04,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:04,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:11:04,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852578550]
[2024-11-24 01:11:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:04,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:11:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:04,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:11:04,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:11:04,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:11:04,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:04,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:04,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:11:04,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:05,863 INFO L124 PetriNetUnfolderBase]: 4259/6443 cut-off events.
[2024-11-24 01:11:05,863 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES.
[2024-11-24 01:11:05,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16286 conditions, 6443 events. 4259/6443 cut-off events. For 4750/4750 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 37589 event pairs, 289 based on Foata normal form. 244/6553 useless extension candidates. Maximal degree in co-relation 16275. Up to 1788 conditions per place.
[2024-11-24 01:11:05,899 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 81 selfloop transitions, 14 changer transitions 1/111 dead transitions.
[2024-11-24 01:11:05,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 549 flow
[2024-11-24 01:11:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:11:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:11:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions.
[2024-11-24 01:11:05,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6728395061728395
[2024-11-24 01:11:05,901 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 218 transitions.
[2024-11-24 01:11:05,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 549 flow
[2024-11-24 01:11:05,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 519 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 01:11:05,924 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow
[2024-11-24 01:11:05,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55}
[2024-11-24 01:11:05,925 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places.
[2024-11-24 01:11:05,925 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow
[2024-11-24 01:11:05,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:05,925 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:05,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:05,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-24 01:11:06,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:06,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:06,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1782447987, now seen corresponding path program 1 times
[2024-11-24 01:11:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:06,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606828371]
[2024-11-24 01:11:06,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:11:06,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:06,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:06,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:06,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-24 01:11:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:11:06,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:06,240 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:06,349 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-24 01:11:06,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:06,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606828371]
[2024-11-24 01:11:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606828371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:11:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946360117]
[2024-11-24 01:11:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:06,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:11:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:06,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:11:06,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:11:06,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 01:11:06,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-24 01:11:06,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:06,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 01:11:06,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:07,124 INFO L124 PetriNetUnfolderBase]: 2895/4211 cut-off events.
[2024-11-24 01:11:07,124 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES.
[2024-11-24 01:11:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11687 conditions, 4211 events. 2895/4211 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21975 event pairs, 231 based on Foata normal form. 96/4173 useless extension candidates. Maximal degree in co-relation 11675. Up to 1316 conditions per place.
[2024-11-24 01:11:07,148 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 18 changer transitions 1/106 dead transitions.
[2024-11-24 01:11:07,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 539 flow
[2024-11-24 01:11:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:11:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:11:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions.
[2024-11-24 01:11:07,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164
[2024-11-24 01:11:07,150 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions.
[2024-11-24 01:11:07,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 539 flow
[2024-11-24 01:11:07,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 493 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-24 01:11:07,193 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow
[2024-11-24 01:11:07,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55}
[2024-11-24 01:11:07,195 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places.
[2024-11-24 01:11:07,197 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow
[2024-11-24 01:11:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-24 01:11:07,198 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:07,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:07,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-24 01:11:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:07,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1174216424, now seen corresponding path program 1 times
[2024-11-24 01:11:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8846894]
[2024-11-24 01:11:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:11:07,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:07,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:07,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:07,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-24 01:11:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:11:07,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:07,533 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:08,386 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-24 01:11:08,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:08,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8846894]
[2024-11-24 01:11:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8846894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-24 01:11:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371281954]
[2024-11-24 01:11:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-24 01:11:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:08,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-24 01:11:08,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-24 01:11:08,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54
[2024-11-24 01:11:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 24.90909090909091) internal successors, (274), 11 states have internal predecessors, (274), 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-24 01:11:08,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:08,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54
[2024-11-24 01:11:08,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:09,258 INFO L124 PetriNetUnfolderBase]: 2213/3606 cut-off events.
[2024-11-24 01:11:09,258 INFO L125 PetriNetUnfolderBase]: For 2251/2391 co-relation queries the response was YES.
[2024-11-24 01:11:09,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 3606 events. 2213/3606 cut-off events. For 2251/2391 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21664 event pairs, 543 based on Foata normal form. 16/3428 useless extension candidates. Maximal degree in co-relation 8821. Up to 1135 conditions per place.
[2024-11-24 01:11:09,288 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 57 selfloop transitions, 5 changer transitions 21/113 dead transitions.
[2024-11-24 01:11:09,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 557 flow
[2024-11-24 01:11:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 01:11:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-24 01:11:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions.
[2024-11-24 01:11:09,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814814814814815
[2024-11-24 01:11:09,290 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 10 states and 314 transitions.
[2024-11-24 01:11:09,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 557 flow
[2024-11-24 01:11:09,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 448 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-11-24 01:11:09,310 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 179 flow
[2024-11-24 01:11:09,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=72, PETRI_TRANSITIONS=56}
[2024-11-24 01:11:09,311 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places.
[2024-11-24 01:11:09,311 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 179 flow
[2024-11-24 01:11:09,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.90909090909091) internal successors, (274), 11 states have internal predecessors, (274), 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-24 01:11:09,312 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:09,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:09,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:09,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:09,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash 568119160, now seen corresponding path program 2 times
[2024-11-24 01:11:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656831699]
[2024-11-24 01:11:09,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:11:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:09,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:09,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-24 01:11:09,631 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:11:09,631 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:11:09,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:09,635 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:11:09,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:09,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656831699]
[2024-11-24 01:11:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656831699] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-24 01:11:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267637261]
[2024-11-24 01:11:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-24 01:11:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-24 01:11:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-24 01:11:09,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54
[2024-11-24 01:11:09,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 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-24 01:11:09,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:09,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54
[2024-11-24 01:11:09,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:11,269 INFO L124 PetriNetUnfolderBase]: 8333/11819 cut-off events.
[2024-11-24 01:11:11,269 INFO L125 PetriNetUnfolderBase]: For 3818/3818 co-relation queries the response was YES.
[2024-11-24 01:11:11,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28238 conditions, 11819 events. 8333/11819 cut-off events. For 3818/3818 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 68699 event pairs, 1753 based on Foata normal form. 16/11781 useless extension candidates. Maximal degree in co-relation 28225. Up to 6657 conditions per place.
[2024-11-24 01:11:11,348 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 60 selfloop transitions, 9 changer transitions 65/146 dead transitions.
[2024-11-24 01:11:11,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 146 transitions, 733 flow
[2024-11-24 01:11:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 01:11:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 01:11:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions.
[2024-11-24 01:11:11,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827
[2024-11-24 01:11:11,350 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 179 flow. Second operand 9 states and 267 transitions.
[2024-11-24 01:11:11,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 146 transitions, 733 flow
[2024-11-24 01:11:11,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 146 transitions, 708 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-11-24 01:11:11,362 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 215 flow
[2024-11-24 01:11:11,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=76, PETRI_TRANSITIONS=59}
[2024-11-24 01:11:11,363 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places.
[2024-11-24 01:11:11,364 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 215 flow
[2024-11-24 01:11:11,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 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-24 01:11:11,365 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:11,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:11,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:11,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1155013618, now seen corresponding path program 3 times
[2024-11-24 01:11:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468168652]
[2024-11-24 01:11:11,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 01:11:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:11,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:11,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-24 01:11:11,775 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 01:11:11,775 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:11:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:11,779 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:11,864 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-24 01:11:11,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:11,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468168652]
[2024-11-24 01:11:11,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468168652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:11:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923973987]
[2024-11-24 01:11:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:11,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:11:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:11,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:11:11,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:11:11,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 01:11:11,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 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-24 01:11:11,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:11,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 01:11:11,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:12,789 INFO L124 PetriNetUnfolderBase]: 4052/6676 cut-off events.
[2024-11-24 01:11:12,789 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES.
[2024-11-24 01:11:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14419 conditions, 6676 events. 4052/6676 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 45381 event pairs, 1459 based on Foata normal form. 16/6337 useless extension candidates. Maximal degree in co-relation 14403. Up to 2669 conditions per place.
[2024-11-24 01:11:12,836 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 2 changer transitions 17/90 dead transitions.
[2024-11-24 01:11:12,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 410 flow
[2024-11-24 01:11:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:11:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:11:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-11-24 01:11:12,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876
[2024-11-24 01:11:12,840 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 215 flow. Second operand 6 states and 185 transitions.
[2024-11-24 01:11:12,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 410 flow
[2024-11-24 01:11:12,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 372 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-11-24 01:11:12,846 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 205 flow
[2024-11-24 01:11:12,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=71, PETRI_TRANSITIONS=60}
[2024-11-24 01:11:12,847 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places.
[2024-11-24 01:11:12,847 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 205 flow
[2024-11-24 01:11:12,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 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-24 01:11:12,847 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:12,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:12,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:13,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:13,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:13,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1974312492, now seen corresponding path program 4 times
[2024-11-24 01:11:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675576449]
[2024-11-24 01:11:13,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 01:11:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:13,054 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:13,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-24 01:11:13,183 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 01:11:13,183 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:11:13,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:13,326 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-24 01:11:13,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:13,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675576449]
[2024-11-24 01:11:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675576449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 01:11:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533536462]
[2024-11-24 01:11:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:11:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:13,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:11:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:11:13,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 01:11:13,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:13,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:13,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 01:11:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:14,419 INFO L124 PetriNetUnfolderBase]: 5666/9122 cut-off events.
[2024-11-24 01:11:14,420 INFO L125 PetriNetUnfolderBase]: For 1518/1520 co-relation queries the response was YES.
[2024-11-24 01:11:14,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19773 conditions, 9122 events. 5666/9122 cut-off events. For 1518/1520 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 64334 event pairs, 1420 based on Foata normal form. 16/8543 useless extension candidates. Maximal degree in co-relation 19759. Up to 4168 conditions per place.
[2024-11-24 01:11:14,455 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 2 changer transitions 32/105 dead transitions.
[2024-11-24 01:11:14,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 465 flow
[2024-11-24 01:11:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:11:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:11:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions.
[2024-11-24 01:11:14,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.582010582010582
[2024-11-24 01:11:14,457 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 205 flow. Second operand 7 states and 220 transitions.
[2024-11-24 01:11:14,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 465 flow
[2024-11-24 01:11:14,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 453 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 01:11:14,461 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 213 flow
[2024-11-24 01:11:14,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=60}
[2024-11-24 01:11:14,461 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places.
[2024-11-24 01:11:14,461 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 213 flow
[2024-11-24 01:11:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:11:14,462 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:14,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:14,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:14,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:14,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:14,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash -567279446, now seen corresponding path program 5 times
[2024-11-24 01:11:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:14,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31797455]
[2024-11-24 01:11:14,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 01:11:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:14,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:14,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:14,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-24 01:11:14,768 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:11:14,768 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:11:14,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 01:11:14,774 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:11:14,858 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-24 01:11:14,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:11:14,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:11:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31797455]
[2024-11-24 01:11:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31797455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:11:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:11:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:11:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714672923]
[2024-11-24 01:11:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:11:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:11:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:11:14,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:11:14,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:11:14,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 01:11:14,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 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-24 01:11:14,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:11:14,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 01:11:14,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:11:16,017 INFO L124 PetriNetUnfolderBase]: 7347/12047 cut-off events.
[2024-11-24 01:11:16,018 INFO L125 PetriNetUnfolderBase]: For 1205/1207 co-relation queries the response was YES.
[2024-11-24 01:11:16,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25080 conditions, 12047 events. 7347/12047 cut-off events. For 1205/1207 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 91098 event pairs, 2896 based on Foata normal form. 16/11181 useless extension candidates. Maximal degree in co-relation 25064. Up to 5166 conditions per place.
[2024-11-24 01:11:16,059 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 32 selfloop transitions, 2 changer transitions 30/93 dead transitions.
[2024-11-24 01:11:16,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 93 transitions, 416 flow
[2024-11-24 01:11:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:11:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:11:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions.
[2024-11-24 01:11:16,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771604938271605
[2024-11-24 01:11:16,061 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 213 flow. Second operand 6 states and 187 transitions.
[2024-11-24 01:11:16,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 93 transitions, 416 flow
[2024-11-24 01:11:16,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 393 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-24 01:11:16,067 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 189 flow
[2024-11-24 01:11:16,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=74, PETRI_TRANSITIONS=56}
[2024-11-24 01:11:16,068 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places.
[2024-11-24 01:11:16,068 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 189 flow
[2024-11-24 01:11:16,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 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-24 01:11:16,068 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:11:16,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:16,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-11-24 01:11:16,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:16,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] ===
[2024-11-24 01:11:16,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:11:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1312905596, now seen corresponding path program 6 times
[2024-11-24 01:11:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:11:16,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38938063]
[2024-11-24 01:11:16,270 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-24 01:11:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:11:16,271 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:11:16,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-24 01:11:16,365 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2024-11-24 01:11:16,366 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 01:11:16,366 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:11:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:11:16,494 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-24 01:11:16,494 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:11:16,495 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining)
[2024-11-24 01:11:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining)
[2024-11-24 01:11:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining)
[2024-11-24 01:11:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-11-24 01:11:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining)
[2024-11-24 01:11:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining)
[2024-11-24 01:11:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2024-11-24 01:11:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining)
[2024-11-24 01:11:16,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-11-24 01:11:16,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:11:16,699 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:11:16,832 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 01:11:16,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:11:16,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:11:16 BasicIcfg
[2024-11-24 01:11:16,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:11:16,847 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:11:16,847 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:11:16,847 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 01:11:16,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:56" (3/4) ...
[2024-11-24 01:11:16,850 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 01:11:16,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:11:16,851 INFO L158 Benchmark]: Toolchain (without parser) took 22661.07ms. Allocated memory was 83.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.2MB in the beginning and 895.4MB in the end (delta: -837.2MB). Peak memory consumption was 342.1MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,853 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:11:16,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.01ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 33.9MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.54ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 31.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:11:16,854 INFO L158 Benchmark]: Boogie Preprocessor took 87.53ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 28.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,854 INFO L158 Benchmark]: RCFGBuilder took 1060.77ms. Allocated memory is still 83.9MB. Free memory was 28.4MB in the beginning and 27.3MB in the end (delta: 1.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,854 INFO L158 Benchmark]: TraceAbstraction took 20828.06ms. Allocated memory was 83.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 26.8MB in the beginning and 895.5MB in the end (delta: -868.7MB). Peak memory consumption was 302.9MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,854 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 1.3GB. Free memory was 895.5MB in the beginning and 895.4MB in the end (delta: 103.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:11:16,857 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 620.01ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 33.9MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 52.54ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 31.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 87.53ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 28.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 1060.77ms. Allocated memory is still 83.9MB. Free memory was 28.4MB in the beginning and 27.3MB in the end (delta: 1.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 20828.06ms. Allocated memory was 83.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 26.8MB in the beginning and 895.5MB in the end (delta: -868.7MB). Peak memory consumption was 302.9MB. Max. memory is 16.1GB.
* Witness Printer took 3.76ms. Allocated memory is still 1.3GB. Free memory was 895.5MB in the beginning and 895.4MB in the end (delta: 103.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool a$flush_delayed;
[L720] 0 int a$mem_tmp;
[L721] 0 _Bool a$r_buff0_thd0;
[L722] 0 _Bool a$r_buff0_thd1;
[L723] 0 _Bool a$r_buff0_thd2;
[L724] 0 _Bool a$r_buff0_thd3;
[L725] 0 _Bool a$r_buff0_thd4;
[L726] 0 _Bool a$r_buff1_thd0;
[L727] 0 _Bool a$r_buff1_thd1;
[L728] 0 _Bool a$r_buff1_thd2;
[L729] 0 _Bool a$r_buff1_thd3;
[L730] 0 _Bool a$r_buff1_thd4;
[L731] 0 _Bool a$read_delayed;
[L732] 0 int *a$read_delayed_var;
[L733] 0 int a$w_buff0;
[L734] 0 _Bool a$w_buff0_used;
[L735] 0 int a$w_buff1;
[L736] 0 _Bool a$w_buff1_used;
[L737] 0 _Bool main$tmp_guard0;
[L738] 0 _Bool main$tmp_guard1;
[L740] 0 int x = 0;
[L742] 0 int y = 0;
[L744] 0 int z = 0;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L864] 0 pthread_t t769;
[L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L750] 1 a$w_buff1 = a$w_buff0
[L751] 1 a$w_buff0 = 1
[L752] 1 a$w_buff1_used = a$w_buff0_used
[L753] 1 a$w_buff0_used = (_Bool)1
[L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4
[L760] 1 a$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L866] 0 pthread_t t770;
[L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=0, t770=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L868] 0 pthread_t t771;
[L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=0, t770=1, t771=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L763] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L780] 2 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L783] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L800] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0]
[L803] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L870] 0 pthread_t t772;
[L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769=0, t770=1, t771=2, t772=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1]
[L820] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L823] 4 __unbuffered_p3_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2]
[L826] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 4 a$flush_delayed = weak$$choice2
[L829] 4 a$mem_tmp = a
[L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] 4 __unbuffered_p3_EBX = a
[L838] 4 a = a$flush_delayed ? a$mem_tmp : a
[L839] 4 a$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=0, t770=1, t771=2, t772=3, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L875] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L875] RET 0 assume_abort_if_not(main$tmp_guard0)
[L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=0, t770=1, t771=2, t772=3, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=0, t770=1, t771=2, t772=3, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L886] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
[L17] 0 __assert_fail ("0", "mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=2]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 871]: 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: 869]: 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: 867]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 87 locations, 8 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: 20.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 670 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2398 IncrementalHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 10 mSDtfsCounter, 2398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 66, 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.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 347 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1351 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-24 01:11:16,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a40501-5191-4868-88aa-d48526d6a288/bin/uautomizer-verify-LYvppIcaGC/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