./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:45:32,919 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:45:33,005 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-24 00:45:33,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:45:33,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:45:33,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:45:33,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:45:33,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:45:33,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:45:33,042 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:45:33,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:45:33,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:45:33,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:45:33,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:45:33,043 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:45:33,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:45:33,043 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:45:33,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:45:33,043 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 00:45:33,044 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:45:33,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:45:33,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:45:33,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:45:33,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 00:45:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 00:45:33,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:45:33,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:45:33,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:45:33,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:45:33,047 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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20
[2024-11-24 00:45:33,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:45:33,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:45:33,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:45:33,373 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:45:33,374 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:45:33,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:45:36,373 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/08fe14c5c/bb1dbf0e42534d308cf5cc45fb106c14/FLAGe41b8a6be
[2024-11-24 00:45:36,815 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:45:36,816 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:45:36,836 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/08fe14c5c/bb1dbf0e42534d308cf5cc45fb106c14/FLAGe41b8a6be
[2024-11-24 00:45:36,863 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/08fe14c5c/bb1dbf0e42534d308cf5cc45fb106c14
[2024-11-24 00:45:36,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:45:36,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:45:36,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:45:36,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:45:36,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:45:36,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:45:36" (1/1) ...
[2024-11-24 00:45:36,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcfa840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:36, skipping insertion in model container
[2024-11-24 00:45:36,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:45:36" (1/1) ...
[2024-11-24 00:45:36,951 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:45:37,536 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:45:37,555 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:45:37,688 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:45:37,749 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:45:37,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37 WrapperNode
[2024-11-24 00:45:37,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:45:37,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:45:37,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:45:37,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:45:37,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,814 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131
[2024-11-24 00:45:37,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:45:37,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:45:37,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:45:37,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:45:37,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,856 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 00:45:37,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:45:37,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:45:37,877 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:45:37,877 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:45:37,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (1/1) ...
[2024-11-24 00:45:37,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:45:37,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:45:37,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:45:37,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:45:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 00:45:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:45:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 00:45:37,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 00:45:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 00:45:37,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 00:45:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 00:45:37,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 00:45:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 00:45:37,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 00:45:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:45:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 00:45:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:45:37,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:45:37,949 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 00:45:38,148 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:45:38,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:45:38,614 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 00:45:38,615 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:45:38,964 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:45:38,964 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 00:45:38,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:45:38 BoogieIcfgContainer
[2024-11-24 00:45:38,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:45:38,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:45:38,970 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:45:38,977 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:45:38,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:45:36" (1/3) ...
[2024-11-24 00:45:38,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9bcf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:45:38, skipping insertion in model container
[2024-11-24 00:45:38,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:45:37" (2/3) ...
[2024-11-24 00:45:38,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9bcf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:45:38, skipping insertion in model container
[2024-11-24 00:45:38,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:45:38" (3/3) ...
[2024-11-24 00:45:38,982 INFO L128 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:45:39,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:45:39,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 00:45:39,006 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 00:45:39,108 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 00:45:39,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 00:45:39,218 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events.
[2024-11-24 00:45:39,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:45:39,232 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 00:45:39,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 00:45:39,238 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow
[2024-11-24 00:45:39,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:45:39,261 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;@5a097926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:45:39,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-11-24 00:45:39,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 00:45:39,270 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-24 00:45:39,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:45:39,271 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:39,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 00:45:39,272 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 00:45:39,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 12890489, now seen corresponding path program 1 times
[2024-11-24 00:45:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:39,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531880739]
[2024-11-24 00:45:39,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:39,868 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 00:45:39,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531880739]
[2024-11-24 00:45:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531880739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:45:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667287151]
[2024-11-24 00:45:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:45:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:39,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:45:39,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:45:39,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54
[2024-11-24 00:45:39,923 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 00:45:39,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:39,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54
[2024-11-24 00:45:39,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:41,948 INFO L124 PetriNetUnfolderBase]: 3311/5438 cut-off events.
[2024-11-24 00:45:41,949 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-11-24 00:45:41,971 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 00:45:42,007 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 41 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2024-11-24 00:45:42,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 243 flow
[2024-11-24 00:45:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:45:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:45:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions.
[2024-11-24 00:45:42,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049
[2024-11-24 00:45:42,032 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 125 transitions.
[2024-11-24 00:45:42,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 243 flow
[2024-11-24 00:45:42,042 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 00:45:42,047 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow
[2024-11-24 00:45:42,050 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 00:45:42,056 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places.
[2024-11-24 00:45:42,056 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow
[2024-11-24 00:45:42,057 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 00:45:42,057 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:42,057 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 00:45:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 00:45:42,058 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 00:45:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 299462370, now seen corresponding path program 1 times
[2024-11-24 00:45:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531054462]
[2024-11-24 00:45:42,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 00:45:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531054462]
[2024-11-24 00:45:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531054462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:45:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153559721]
[2024-11-24 00:45:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:45:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:42,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:45:42,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:45:42,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 00:45:42,257 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 00:45:42,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:42,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 00:45:42,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:43,343 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events.
[2024-11-24 00:45:43,344 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES.
[2024-11-24 00:45:43,361 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 00:45:43,390 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions.
[2024-11-24 00:45:43,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow
[2024-11-24 00:45:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:45:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:45:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-24 00:45:43,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654
[2024-11-24 00:45:43,394 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions.
[2024-11-24 00:45:43,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow
[2024-11-24 00:45:43,396 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 00:45:43,399 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow
[2024-11-24 00:45:43,400 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 00:45:43,401 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places.
[2024-11-24 00:45:43,401 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow
[2024-11-24 00:45:43,401 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 00:45:43,402 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:43,402 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 00:45:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 00:45:43,402 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 00:45:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 299463748, now seen corresponding path program 1 times
[2024-11-24 00:45:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889871659]
[2024-11-24 00:45:43,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:43,862 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 00:45:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889871659]
[2024-11-24 00:45:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889871659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:45:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78933070]
[2024-11-24 00:45:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:45:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:45:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:45:43,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:45:43,898 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 00:45:43,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:43,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:45:43,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:46,118 INFO L124 PetriNetUnfolderBase]: 8875/13627 cut-off events.
[2024-11-24 00:45:46,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:45:46,162 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 00:45:46,229 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 53 selfloop transitions, 6 changer transitions 1/75 dead transitions.
[2024-11-24 00:45:46,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 286 flow
[2024-11-24 00:45:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:45:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:45:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions.
[2024-11-24 00:45:46,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074
[2024-11-24 00:45:46,232 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 142 transitions.
[2024-11-24 00:45:46,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 286 flow
[2024-11-24 00:45:46,233 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 00:45:46,236 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow
[2024-11-24 00:45:46,237 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 00:45:46,238 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places.
[2024-11-24 00:45:46,238 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow
[2024-11-24 00:45:46,238 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 00:45:46,238 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:46,239 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 00:45:46,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 00:45:46,239 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 00:45:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1800833149, now seen corresponding path program 1 times
[2024-11-24 00:45:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713810332]
[2024-11-24 00:45:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:46,748 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 00:45:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713810332]
[2024-11-24 00:45:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713810332] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 00:45:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149327573]
[2024-11-24 00:45:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:45:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:45:46,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:45:46,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:45:46,762 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 00:45:46,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:45:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:48,659 INFO L124 PetriNetUnfolderBase]: 6751/10387 cut-off events.
[2024-11-24 00:45:48,659 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES.
[2024-11-24 00:45:48,689 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 00:45:48,723 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 68 selfloop transitions, 10 changer transitions 1/94 dead transitions.
[2024-11-24 00:45:48,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 418 flow
[2024-11-24 00:45:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:45:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:45:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions.
[2024-11-24 00:45:48,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704
[2024-11-24 00:45:48,726 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 181 transitions.
[2024-11-24 00:45:48,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 418 flow
[2024-11-24 00:45:48,733 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 00:45:48,734 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow
[2024-11-24 00:45:48,736 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 00:45:48,737 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places.
[2024-11-24 00:45:48,737 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow
[2024-11-24 00:45:48,737 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 00:45:48,738 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:48,738 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 00:45:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 00:45:48,738 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 00:45:48,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash 735979333, now seen corresponding path program 1 times
[2024-11-24 00:45:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:48,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627054337]
[2024-11-24 00:45:48,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:49,153 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 00:45:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627054337]
[2024-11-24 00:45:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627054337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:45:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143785775]
[2024-11-24 00:45:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:45:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:45:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:45:49,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:45:49,163 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 00:45:49,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:45:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:50,086 INFO L124 PetriNetUnfolderBase]: 4259/6443 cut-off events.
[2024-11-24 00:45:50,086 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES.
[2024-11-24 00:45:50,106 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 00:45:50,126 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 81 selfloop transitions, 14 changer transitions 1/111 dead transitions.
[2024-11-24 00:45:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 549 flow
[2024-11-24 00:45:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:45:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:45:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions.
[2024-11-24 00:45:50,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6728395061728395
[2024-11-24 00:45:50,128 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 218 transitions.
[2024-11-24 00:45:50,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 549 flow
[2024-11-24 00:45:50,148 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 00:45:50,150 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow
[2024-11-24 00:45:50,150 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 00:45:50,151 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places.
[2024-11-24 00:45:50,151 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow
[2024-11-24 00:45:50,151 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 00:45:50,151 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:50,151 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 00:45:50,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 00:45:50,152 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 00:45:50,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1064207219, now seen corresponding path program 1 times
[2024-11-24 00:45:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098293593]
[2024-11-24 00:45:50,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:50,661 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 00:45:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098293593]
[2024-11-24 00:45:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098293593] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:45:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605406287]
[2024-11-24 00:45:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:45:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:50,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:45:50,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:45:50,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:45:50,677 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 00:45:50,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:50,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:45:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:51,565 INFO L124 PetriNetUnfolderBase]: 2895/4211 cut-off events.
[2024-11-24 00:45:51,565 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES.
[2024-11-24 00:45:51,586 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 00:45:51,602 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 18 changer transitions 1/106 dead transitions.
[2024-11-24 00:45:51,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 539 flow
[2024-11-24 00:45:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:45:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:45:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions.
[2024-11-24 00:45:51,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164
[2024-11-24 00:45:51,604 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions.
[2024-11-24 00:45:51,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 539 flow
[2024-11-24 00:45:51,644 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 00:45:51,645 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow
[2024-11-24 00:45:51,646 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 00:45:51,647 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places.
[2024-11-24 00:45:51,647 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow
[2024-11-24 00:45:51,647 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 00:45:51,647 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:51,647 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 00:45:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 00:45:51,648 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 00:45:51,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1522059816, now seen corresponding path program 1 times
[2024-11-24 00:45:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:51,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881498872]
[2024-11-24 00:45:51,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:45:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:45:54,054 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 00:45:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:54,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881498872]
[2024-11-24 00:45:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881498872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:54,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-24 00:45:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991588910]
[2024-11-24 00:45:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-24 00:45:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-24 00:45:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-24 00:45:54,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 00:45:54,077 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 00:45:54,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:54,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 00:45:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:55,031 INFO L124 PetriNetUnfolderBase]: 2149/3522 cut-off events.
[2024-11-24 00:45:55,033 INFO L125 PetriNetUnfolderBase]: For 2226/2352 co-relation queries the response was YES.
[2024-11-24 00:45:55,050 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 00:45:55,063 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 56 selfloop transitions, 5 changer transitions 16/108 dead transitions.
[2024-11-24 00:45:55,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 531 flow
[2024-11-24 00:45:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 00:45:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 00:45:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 294 transitions.
[2024-11-24 00:45:55,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383
[2024-11-24 00:45:55,066 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 9 states and 294 transitions.
[2024-11-24 00:45:55,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 531 flow
[2024-11-24 00:45:55,092 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 00:45:55,094 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 176 flow
[2024-11-24 00:45:55,094 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 00:45:55,094 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places.
[2024-11-24 00:45:55,096 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 176 flow
[2024-11-24 00:45:55,096 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 00:45:55,096 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:55,096 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 00:45:55,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 00:45:55,096 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 00:45:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 915962552, now seen corresponding path program 2 times
[2024-11-24 00:45:55,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:55,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164557288]
[2024-11-24 00:45:55,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:45:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:55,230 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:45:55,231 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:45:55,596 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 00:45:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164557288]
[2024-11-24 00:45:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164557288] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:45:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764126175]
[2024-11-24 00:45:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:45:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:55,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:45:55,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:45:55,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54
[2024-11-24 00:45:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:45:55,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:55,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54
[2024-11-24 00:45:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:45:57,264 INFO L124 PetriNetUnfolderBase]: 10755/16507 cut-off events.
[2024-11-24 00:45:57,264 INFO L125 PetriNetUnfolderBase]: For 2509/2509 co-relation queries the response was YES.
[2024-11-24 00:45:57,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35299 conditions, 16507 events. 10755/16507 cut-off events. For 2509/2509 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 112917 event pairs, 3624 based on Foata normal form. 16/15930 useless extension candidates. Maximal degree in co-relation 35287. Up to 7858 conditions per place.
[2024-11-24 00:45:57,337 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 43 selfloop transitions, 8 changer transitions 14/90 dead transitions.
[2024-11-24 00:45:57,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 395 flow
[2024-11-24 00:45:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:45:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:45:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions.
[2024-11-24 00:45:57,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704
[2024-11-24 00:45:57,339 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 176 flow. Second operand 5 states and 154 transitions.
[2024-11-24 00:45:57,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 395 flow
[2024-11-24 00:45:57,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 375 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-11-24 00:45:57,348 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 227 flow
[2024-11-24 00:45:57,349 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=69, PETRI_TRANSITIONS=62}
[2024-11-24 00:45:57,349 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places.
[2024-11-24 00:45:57,349 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 227 flow
[2024-11-24 00:45:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:45:57,350 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:45:57,350 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 00:45:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 00:45:57,350 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 00:45:57,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:45:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 225199580, now seen corresponding path program 3 times
[2024-11-24 00:45:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:45:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408850535]
[2024-11-24 00:45:57,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:45:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:45:57,462 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 00:45:57,462 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:45:57,809 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 00:45:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:45:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408850535]
[2024-11-24 00:45:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408850535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:45:57,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:45:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:45:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921337126]
[2024-11-24 00:45:57,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:45:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:45:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:45:57,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:45:57,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:45:57,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54
[2024-11-24 00:45:57,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 227 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 00:45:57,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:45:57,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54
[2024-11-24 00:45:57,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:00,467 INFO L124 PetriNetUnfolderBase]: 12986/19824 cut-off events.
[2024-11-24 00:46:00,467 INFO L125 PetriNetUnfolderBase]: For 6996/7018 co-relation queries the response was YES.
[2024-11-24 00:46:00,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48276 conditions, 19824 events. 12986/19824 cut-off events. For 6996/7018 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 137727 event pairs, 3020 based on Foata normal form. 26/19097 useless extension candidates. Maximal degree in co-relation 48263. Up to 9140 conditions per place.
[2024-11-24 00:46:00,614 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 55 selfloop transitions, 10 changer transitions 24/114 dead transitions.
[2024-11-24 00:46:00,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 567 flow
[2024-11-24 00:46:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:46:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:46:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions.
[2024-11-24 00:46:00,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926
[2024-11-24 00:46:00,618 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 227 flow. Second operand 6 states and 192 transitions.
[2024-11-24 00:46:00,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 567 flow
[2024-11-24 00:46:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 527 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-11-24 00:46:00,806 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 269 flow
[2024-11-24 00:46:00,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=71, PETRI_TRANSITIONS=65}
[2024-11-24 00:46:00,810 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places.
[2024-11-24 00:46:00,810 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 269 flow
[2024-11-24 00:46:00,810 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 00:46:00,810 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:00,810 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 00:46:00,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 00:46:00,810 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 00:46:00,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 97147742, now seen corresponding path program 4 times
[2024-11-24 00:46:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:46:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162986276]
[2024-11-24 00:46:00,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:46:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:46:00,939 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:46:00,940 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:46:01,208 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 00:46:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:46:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162986276]
[2024-11-24 00:46:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162986276] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:46:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629798592]
[2024-11-24 00:46:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:01,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:46:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:46:01,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:46:01,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:46:01,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54
[2024-11-24 00:46:01,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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 00:46:01,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:01,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54
[2024-11-24 00:46:01,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:02,587 INFO L124 PetriNetUnfolderBase]: 7333/12190 cut-off events.
[2024-11-24 00:46:02,588 INFO L125 PetriNetUnfolderBase]: For 3748/4367 co-relation queries the response was YES.
[2024-11-24 00:46:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27255 conditions, 12190 events. 7333/12190 cut-off events. For 3748/4367 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 89947 event pairs, 2142 based on Foata normal form. 125/11484 useless extension candidates. Maximal degree in co-relation 27239. Up to 4440 conditions per place.
[2024-11-24 00:46:02,663 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 33 selfloop transitions, 1 changer transitions 35/101 dead transitions.
[2024-11-24 00:46:02,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 504 flow
[2024-11-24 00:46:02,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:46:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:46:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions.
[2024-11-24 00:46:02,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.595679012345679
[2024-11-24 00:46:02,666 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 269 flow. Second operand 6 states and 193 transitions.
[2024-11-24 00:46:02,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 504 flow
[2024-11-24 00:46:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 490 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-11-24 00:46:02,679 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 243 flow
[2024-11-24 00:46:02,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=75, PETRI_TRANSITIONS=60}
[2024-11-24 00:46:02,680 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places.
[2024-11-24 00:46:02,680 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 243 flow
[2024-11-24 00:46:02,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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 00:46:02,681 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:02,681 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 00:46:02,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 00:46:02,681 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 00:46:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1760806274, now seen corresponding path program 5 times
[2024-11-24 00:46:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:46:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694776169]
[2024-11-24 00:46:02,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 00:46:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:46:02,771 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:46:02,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:46:03,029 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 00:46:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:46:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694776169]
[2024-11-24 00:46:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694776169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:46:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251237437]
[2024-11-24 00:46:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:03,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:46:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:46:03,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:46:03,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:46:03,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 54
[2024-11-24 00:46:03,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 00:46:03,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:03,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 54
[2024-11-24 00:46:03,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:04,419 INFO L124 PetriNetUnfolderBase]: 5414/9268 cut-off events.
[2024-11-24 00:46:04,420 INFO L125 PetriNetUnfolderBase]: For 2532/2590 co-relation queries the response was YES.
[2024-11-24 00:46:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20707 conditions, 9268 events. 5414/9268 cut-off events. For 2532/2590 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 67896 event pairs, 2307 based on Foata normal form. 16/8633 useless extension candidates. Maximal degree in co-relation 20689. Up to 4243 conditions per place.
[2024-11-24 00:46:04,459 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 34 selfloop transitions, 3 changer transitions 21/89 dead transitions.
[2024-11-24 00:46:04,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 439 flow
[2024-11-24 00:46:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:46:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:46:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions.
[2024-11-24 00:46:04,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148
[2024-11-24 00:46:04,461 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 243 flow. Second operand 5 states and 166 transitions.
[2024-11-24 00:46:04,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 439 flow
[2024-11-24 00:46:04,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 402 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-11-24 00:46:04,472 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 214 flow
[2024-11-24 00:46:04,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=72, PETRI_TRANSITIONS=58}
[2024-11-24 00:46:04,473 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places.
[2024-11-24 00:46:04,473 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 214 flow
[2024-11-24 00:46:04,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 00:46:04,474 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:04,474 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 00:46:04,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 00:46:04,474 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 00:46:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1267773356, now seen corresponding path program 6 times
[2024-11-24 00:46:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:46:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561884189]
[2024-11-24 00:46:04,475 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-24 00:46:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:46:04,575 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2024-11-24 00:46:04,575 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 00:46:04,576 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:46:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:46:04,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 00:46:04,737 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 00:46:04,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining)
[2024-11-24 00:46:04,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2024-11-24 00:46:04,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining)
[2024-11-24 00:46:04,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 00:46:04,742 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:46:04,871 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 00:46:04,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 00:46:04,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:46:04 BasicIcfg
[2024-11-24 00:46:04,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 00:46:04,886 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 00:46:04,886 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 00:46:04,887 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 00:46:04,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:45:38" (3/4) ...
[2024-11-24 00:46:04,889 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 00:46:04,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 00:46:04,895 INFO L158 Benchmark]: Toolchain (without parser) took 28027.36ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 115.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 292.7MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,896 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:46:04,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 880.47ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 91.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.22ms. 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 00:46:04,898 INFO L158 Benchmark]: Boogie Preprocessor took 61.22ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,898 INFO L158 Benchmark]: RCFGBuilder took 1087.82ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 100.9MB in the end (delta: -15.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,899 INFO L158 Benchmark]: TraceAbstraction took 25916.56ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 100.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,901 INFO L158 Benchmark]: Witness Printer took 8.29ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:46:04,902 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.44ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 880.47ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 91.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 62.22ms. 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 61.22ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 1087.82ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 100.9MB in the end (delta: -15.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 25916.56ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 100.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB.
* Witness Printer took 8.29ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 193.9kB). 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_p1_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 t713;
[L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t713=-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_p1_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 t714;
[L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-3, t714=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L763] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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]
[L780] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0]
[L783] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, 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}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0]
[L868] 0 pthread_t t715;
[L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-3, t714=-2, t715=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L800] 3 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, z=0]
[L803] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, 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_p1_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=2, y=1, z=1]
[L870] 0 pthread_t t716;
[L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1]
[L820] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, 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_p1_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, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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_p1_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, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=2]
[L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_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_p1_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, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, 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_p1_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=1, weak$$choice2=1, x=2, y=1, z=2]
[L17] 0 __assert_fail ("0", "mix027_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=1, weak$$choice2=1, x=2, y=1, 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: 25.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 632 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1546 IncrementalHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 24 mSDtfsCounter, 1546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred 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, 1.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 1429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 00:46:04,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:46:07,824 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:46:07,973 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-24 00:46:07,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:46:07,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:46:08,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:46:08,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:46:08,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:46:08,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:46:08,006 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:46:08,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:46:08,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:46:08,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:46:08,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:46:08,007 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:46:08,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:46:08,007 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 00:46:08,008 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:46:08,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:46:08,010 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:46:08,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:46:08,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:46:08,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:46:08,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:46:08,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:46:08,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:46:08,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:46:08,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:46:08,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:46:08,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:46:08,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:46:08,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:46:08,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:46:08,012 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_54f95ff6-9b78-41b9-a310-a5b0e28393d4/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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20
[2024-11-24 00:46:08,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:46:08,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:46:08,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:46:08,378 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:46:08,378 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:46:08,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:46:11,585 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/cad391502/e7014dd8f6c942f6b7e0bb2cdfa84273/FLAGa48f7154e
[2024-11-24 00:46:12,011 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:46:12,012 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:46:12,034 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/cad391502/e7014dd8f6c942f6b7e0bb2cdfa84273/FLAGa48f7154e
[2024-11-24 00:46:12,059 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/data/cad391502/e7014dd8f6c942f6b7e0bb2cdfa84273
[2024-11-24 00:46:12,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:46:12,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:46:12,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:46:12,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:46:12,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:46:12,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cce503f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12, skipping insertion in model container
[2024-11-24 00:46:12,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,138 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:46:12,589 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:46:12,612 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:46:12,690 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:46:12,735 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:46:12,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12 WrapperNode
[2024-11-24 00:46:12,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:46:12,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:46:12,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:46:12,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:46:12,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,787 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132
[2024-11-24 00:46:12,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:46:12,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:46:12,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:46:12,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:46:12,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,845 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 00:46:12,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:46:12,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:46:12,897 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:46:12,897 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:46:12,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (1/1) ...
[2024-11-24 00:46:12,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:46:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:12,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:46:12,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:46:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 00:46:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:46:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-24 00:46:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 00:46:12,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 00:46:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 00:46:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 00:46:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 00:46:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 00:46:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 00:46:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 00:46:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 00:46:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:46:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:46:12,992 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 00:46:13,224 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:46:13,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:46:13,761 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 00:46:13,761 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:46:14,121 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:46:14,122 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 00:46:14,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:46:14 BoogieIcfgContainer
[2024-11-24 00:46:14,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:46:14,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:46:14,127 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:46:14,132 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:46:14,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:46:12" (1/3) ...
[2024-11-24 00:46:14,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dd5d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:46:14, skipping insertion in model container
[2024-11-24 00:46:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:46:12" (2/3) ...
[2024-11-24 00:46:14,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dd5d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:46:14, skipping insertion in model container
[2024-11-24 00:46:14,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:46:14" (3/3) ...
[2024-11-24 00:46:14,137 INFO L128 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 00:46:14,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:46:14,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 00:46:14,159 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 00:46:14,261 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 00:46:14,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 00:46:14,360 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events.
[2024-11-24 00:46:14,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:46:14,373 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 00:46:14,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow
[2024-11-24 00:46:14,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow
[2024-11-24 00:46:14,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:46:14,414 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;@3f36baa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:46:14,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-11-24 00:46:14,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 00:46:14,422 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-24 00:46:14,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:46:14,423 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:14,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 00:46:14,424 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 00:46:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash 12952057, now seen corresponding path program 1 times
[2024-11-24 00:46:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579526987]
[2024-11-24 00:46:14,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:14,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:14,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 00:46:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:14,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:14,653 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 00:46:14,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:14,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579526987]
[2024-11-24 00:46:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579526987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:46:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726395497]
[2024-11-24 00:46:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:46:14,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:14,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:46:14,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:46:14,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54
[2024-11-24 00:46:14,706 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 00:46:14,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:14,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54
[2024-11-24 00:46:14,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:16,283 INFO L124 PetriNetUnfolderBase]: 3311/5438 cut-off events.
[2024-11-24 00:46:16,284 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-11-24 00:46:16,308 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 00:46:16,337 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 41 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2024-11-24 00:46:16,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 243 flow
[2024-11-24 00:46:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:46:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:46:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions.
[2024-11-24 00:46:16,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049
[2024-11-24 00:46:16,350 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 125 transitions.
[2024-11-24 00:46:16,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 243 flow
[2024-11-24 00:46:16,357 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 00:46:16,359 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow
[2024-11-24 00:46:16,362 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 00:46:16,366 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places.
[2024-11-24 00:46:16,367 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow
[2024-11-24 00:46:16,367 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 00:46:16,367 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:16,367 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 00:46:16,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-24 00:46:16,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:16,568 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 00:46:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1378315492, now seen corresponding path program 1 times
[2024-11-24 00:46:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499335240]
[2024-11-24 00:46:16,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:16,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:16,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 00:46:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:16,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:16,699 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:16,747 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 00:46:16,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:16,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499335240]
[2024-11-24 00:46:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499335240] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:46:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95222759]
[2024-11-24 00:46:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:46:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:16,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:46:16,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:46:16,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54
[2024-11-24 00:46:16,751 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 00:46:16,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:16,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54
[2024-11-24 00:46:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:17,763 INFO L124 PetriNetUnfolderBase]: 2903/4911 cut-off events.
[2024-11-24 00:46:17,763 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES.
[2024-11-24 00:46:17,779 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 00:46:17,805 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions.
[2024-11-24 00:46:17,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow
[2024-11-24 00:46:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:46:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:46:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-24 00:46:17,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654
[2024-11-24 00:46:17,811 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions.
[2024-11-24 00:46:17,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow
[2024-11-24 00:46:17,812 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 00:46:17,815 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow
[2024-11-24 00:46:17,815 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 00:46:17,816 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places.
[2024-11-24 00:46:17,817 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow
[2024-11-24 00:46:17,817 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 00:46:17,818 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:17,818 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 00:46:17,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-24 00:46:18,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:18,019 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 00:46:18,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1378316870, now seen corresponding path program 1 times
[2024-11-24 00:46:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903922427]
[2024-11-24 00:46:18,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:18,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:18,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:18,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:18,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-24 00:46:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:18,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:18,154 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:18,210 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 00:46:18,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:18,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903922427]
[2024-11-24 00:46:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903922427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:46:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473004418]
[2024-11-24 00:46:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:18,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:46:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:18,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:46:18,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:46:18,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:46:18,224 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 00:46:18,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:18,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:46:18,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:20,265 INFO L124 PetriNetUnfolderBase]: 8875/13627 cut-off events.
[2024-11-24 00:46:20,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:46:20,306 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 00:46:20,380 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 53 selfloop transitions, 6 changer transitions 1/75 dead transitions.
[2024-11-24 00:46:20,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 286 flow
[2024-11-24 00:46:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:46:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:46:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions.
[2024-11-24 00:46:20,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074
[2024-11-24 00:46:20,386 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 142 transitions.
[2024-11-24 00:46:20,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 286 flow
[2024-11-24 00:46:20,387 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 00:46:20,390 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow
[2024-11-24 00:46:20,391 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 00:46:20,392 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places.
[2024-11-24 00:46:20,392 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow
[2024-11-24 00:46:20,393 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 00:46:20,393 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:20,393 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 00:46:20,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-24 00:46:20,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:20,594 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 00:46:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash -286193085, now seen corresponding path program 1 times
[2024-11-24 00:46:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857219274]
[2024-11-24 00:46:20,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:20,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:20,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-24 00:46:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:20,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:20,723 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:20,796 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 00:46:20,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:20,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:20,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857219274]
[2024-11-24 00:46:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857219274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 00:46:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368101097]
[2024-11-24 00:46:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:46:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:20,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:46:20,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:46:20,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:46:20,820 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 00:46:20,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:20,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:46:20,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:22,381 INFO L124 PetriNetUnfolderBase]: 6751/10387 cut-off events.
[2024-11-24 00:46:22,381 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES.
[2024-11-24 00:46:22,411 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 00:46:22,448 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 68 selfloop transitions, 10 changer transitions 1/94 dead transitions.
[2024-11-24 00:46:22,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 418 flow
[2024-11-24 00:46:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:46:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:46:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions.
[2024-11-24 00:46:22,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703703703703704
[2024-11-24 00:46:22,451 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 181 transitions.
[2024-11-24 00:46:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 418 flow
[2024-11-24 00:46:22,456 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 00:46:22,458 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow
[2024-11-24 00:46:22,458 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 00:46:22,459 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places.
[2024-11-24 00:46:22,459 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow
[2024-11-24 00:46:22,459 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 00:46:22,460 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:22,460 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 00:46:22,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-24 00:46:22,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:22,664 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 00:46:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1857983481, now seen corresponding path program 1 times
[2024-11-24 00:46:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666083188]
[2024-11-24 00:46:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:22,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:22,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:22,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:22,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-24 00:46:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:22,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:22,870 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 00:46:22,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:22,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666083188]
[2024-11-24 00:46:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666083188] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:46:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60333952]
[2024-11-24 00:46:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:46:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:22,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:46:22,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:46:22,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:46:22,897 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 00:46:22,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:22,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:46:22,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:23,746 INFO L124 PetriNetUnfolderBase]: 4259/6443 cut-off events.
[2024-11-24 00:46:23,747 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES.
[2024-11-24 00:46:23,757 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 00:46:23,777 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 81 selfloop transitions, 14 changer transitions 1/111 dead transitions.
[2024-11-24 00:46:23,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 549 flow
[2024-11-24 00:46:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:46:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:46:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions.
[2024-11-24 00:46:23,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6728395061728395
[2024-11-24 00:46:23,779 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 218 transitions.
[2024-11-24 00:46:23,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 549 flow
[2024-11-24 00:46:23,802 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 00:46:23,804 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow
[2024-11-24 00:46:23,804 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 00:46:23,805 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places.
[2024-11-24 00:46:23,805 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow
[2024-11-24 00:46:23,805 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 00:46:23,806 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:23,806 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 00:46:23,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-24 00:46:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:24,007 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 00:46:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1782447987, now seen corresponding path program 1 times
[2024-11-24 00:46:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281859732]
[2024-11-24 00:46:24,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:24,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:24,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:24,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:24,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-24 00:46:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:24,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:24,135 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:24,236 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 00:46:24,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:24,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281859732]
[2024-11-24 00:46:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281859732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:46:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51798534]
[2024-11-24 00:46:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:46:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:24,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:46:24,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:46:24,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54
[2024-11-24 00:46:24,264 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 00:46:24,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:24,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54
[2024-11-24 00:46:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:25,048 INFO L124 PetriNetUnfolderBase]: 2895/4211 cut-off events.
[2024-11-24 00:46:25,048 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES.
[2024-11-24 00:46:25,056 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 00:46:25,071 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 18 changer transitions 1/106 dead transitions.
[2024-11-24 00:46:25,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 539 flow
[2024-11-24 00:46:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:46:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:46:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions.
[2024-11-24 00:46:25,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164
[2024-11-24 00:46:25,073 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions.
[2024-11-24 00:46:25,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 539 flow
[2024-11-24 00:46:25,116 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 00:46:25,117 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow
[2024-11-24 00:46:25,118 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 00:46:25,119 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places.
[2024-11-24 00:46:25,119 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow
[2024-11-24 00:46:25,119 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 00:46:25,119 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:25,119 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 00:46:25,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-24 00:46:25,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:25,320 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 00:46:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1174216424, now seen corresponding path program 1 times
[2024-11-24 00:46:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152747899]
[2024-11-24 00:46:25,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:46:25,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:25,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:25,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-24 00:46:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:46:25,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:25,448 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:26,371 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 00:46:26,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:26,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152747899]
[2024-11-24 00:46:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152747899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:26,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-24 00:46:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882790092]
[2024-11-24 00:46:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:26,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-24 00:46:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:26,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-24 00:46:26,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-24 00:46:26,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54
[2024-11-24 00:46:26,397 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 00:46:26,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:26,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54
[2024-11-24 00:46:26,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:27,232 INFO L124 PetriNetUnfolderBase]: 2213/3606 cut-off events.
[2024-11-24 00:46:27,232 INFO L125 PetriNetUnfolderBase]: For 2251/2391 co-relation queries the response was YES.
[2024-11-24 00:46:27,249 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 00:46:27,261 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 57 selfloop transitions, 5 changer transitions 21/113 dead transitions.
[2024-11-24 00:46:27,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 557 flow
[2024-11-24 00:46:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 00:46:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-24 00:46:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions.
[2024-11-24 00:46:27,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814814814814815
[2024-11-24 00:46:27,269 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 10 states and 314 transitions.
[2024-11-24 00:46:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 557 flow
[2024-11-24 00:46:27,289 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 00:46:27,293 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 179 flow
[2024-11-24 00:46:27,293 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 00:46:27,294 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places.
[2024-11-24 00:46:27,294 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 179 flow
[2024-11-24 00:46:27,294 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 00:46:27,294 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:27,297 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 00:46:27,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-24 00:46:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:27,498 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 00:46:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 568119160, now seen corresponding path program 2 times
[2024-11-24 00:46:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936901605]
[2024-11-24 00:46:27,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:46:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:27,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:27,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-24 00:46:27,638 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:46:27,638 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:46:27,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:27,643 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:27,731 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 00:46:27,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:27,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936901605]
[2024-11-24 00:46:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936901605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:46:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449163477]
[2024-11-24 00:46:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:46:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:27,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:46:27,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:46:27,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 00:46:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 179 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 00:46:27,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:27,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 00:46:27,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:28,450 INFO L124 PetriNetUnfolderBase]: 4446/7222 cut-off events.
[2024-11-24 00:46:28,450 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES.
[2024-11-24 00:46:28,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15431 conditions, 7222 events. 4446/7222 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 49329 event pairs, 1643 based on Foata normal form. 16/6872 useless extension candidates. Maximal degree in co-relation 15418. Up to 2947 conditions per place.
[2024-11-24 00:46:28,507 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 34 selfloop transitions, 2 changer transitions 24/88 dead transitions.
[2024-11-24 00:46:28,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 386 flow
[2024-11-24 00:46:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:46:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:46:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-11-24 00:46:28,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876
[2024-11-24 00:46:28,509 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 179 flow. Second operand 6 states and 185 transitions.
[2024-11-24 00:46:28,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 386 flow
[2024-11-24 00:46:28,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 366 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-11-24 00:46:28,516 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 175 flow
[2024-11-24 00:46:28,516 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=71, PETRI_TRANSITIONS=55}
[2024-11-24 00:46:28,516 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places.
[2024-11-24 00:46:28,517 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 175 flow
[2024-11-24 00:46:28,517 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 00:46:28,517 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:28,517 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 00:46:28,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-24 00:46:28,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:28,717 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 00:46:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1932143102, now seen corresponding path program 3 times
[2024-11-24 00:46:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306538683]
[2024-11-24 00:46:28,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:46:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:28,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:28,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-24 00:46:28,846 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 00:46:28,846 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:46:28,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:28,852 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:28,943 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 00:46:28,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:28,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306538683]
[2024-11-24 00:46:28,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306538683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:28,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:46:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855900231]
[2024-11-24 00:46:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:28,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:46:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:28,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:46:28,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:46:28,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 00:46:28,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 175 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 00:46:28,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:28,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 00:46:28,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:29,686 INFO L124 PetriNetUnfolderBase]: 3413/5636 cut-off events.
[2024-11-24 00:46:29,687 INFO L125 PetriNetUnfolderBase]: For 452/487 co-relation queries the response was YES.
[2024-11-24 00:46:29,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11958 conditions, 5636 events. 3413/5636 cut-off events. For 452/487 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 36477 event pairs, 1563 based on Foata normal form. 16/5259 useless extension candidates. Maximal degree in co-relation 11945. Up to 2573 conditions per place.
[2024-11-24 00:46:29,709 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 2 changer transitions 19/89 dead transitions.
[2024-11-24 00:46:29,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 386 flow
[2024-11-24 00:46:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:46:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:46:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions.
[2024-11-24 00:46:29,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469
[2024-11-24 00:46:29,711 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 175 flow. Second operand 6 states and 188 transitions.
[2024-11-24 00:46:29,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 386 flow
[2024-11-24 00:46:29,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 360 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-11-24 00:46:29,717 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 177 flow
[2024-11-24 00:46:29,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=69, PETRI_TRANSITIONS=56}
[2024-11-24 00:46:29,718 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places.
[2024-11-24 00:46:29,718 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 177 flow
[2024-11-24 00:46:29,719 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 00:46:29,719 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:29,719 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 00:46:29,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-24 00:46:29,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:29,920 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 00:46:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 713169128, now seen corresponding path program 4 times
[2024-11-24 00:46:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508547673]
[2024-11-24 00:46:29,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:46:29,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:29,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:29,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-24 00:46:30,040 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:46:30,040 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:46:30,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-24 00:46:30,043 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:46:30,162 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 00:46:30,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:46:30,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:46:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508547673]
[2024-11-24 00:46:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508547673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:46:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:46:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 00:46:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243579687]
[2024-11-24 00:46:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:46:30,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:46:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:46:30,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:46:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:46:30,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54
[2024-11-24 00:46:30,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 177 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 00:46:30,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:46:30,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54
[2024-11-24 00:46:30,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:46:31,220 INFO L124 PetriNetUnfolderBase]: 5711/9482 cut-off events.
[2024-11-24 00:46:31,220 INFO L125 PetriNetUnfolderBase]: For 780/780 co-relation queries the response was YES.
[2024-11-24 00:46:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19514 conditions, 9482 events. 5711/9482 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 66543 event pairs, 1340 based on Foata normal form. 16/8983 useless extension candidates. Maximal degree in co-relation 19502. Up to 3766 conditions per place.
[2024-11-24 00:46:31,256 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 31 selfloop transitions, 1 changer transitions 34/95 dead transitions.
[2024-11-24 00:46:31,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 403 flow
[2024-11-24 00:46:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:46:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:46:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions.
[2024-11-24 00:46:31,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661375661375662
[2024-11-24 00:46:31,258 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 177 flow. Second operand 7 states and 214 transitions.
[2024-11-24 00:46:31,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 403 flow
[2024-11-24 00:46:31,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 391 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 00:46:31,262 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 182 flow
[2024-11-24 00:46:31,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=73, PETRI_TRANSITIONS=56}
[2024-11-24 00:46:31,263 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places.
[2024-11-24 00:46:31,263 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 182 flow
[2024-11-24 00:46:31,263 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 00:46:31,263 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:46:31,263 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 00:46:31,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-11-24 00:46:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:31,464 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 00:46:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:46:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 616984938, now seen corresponding path program 5 times
[2024-11-24 00:46:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:46:31,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382764098]
[2024-11-24 00:46:31,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 00:46:31,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:46:31,469 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:46:31,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-24 00:46:31,593 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:46:31,593 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 00:46:31,593 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:46:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:46:31,730 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-24 00:46:31,731 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 00:46:31,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining)
[2024-11-24 00:46:31,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining)
[2024-11-24 00:46:31,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining)
[2024-11-24 00:46:31,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-11-24 00:46:31,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining)
[2024-11-24 00:46:31,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining)
[2024-11-24 00:46:31,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2024-11-24 00:46:31,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining)
[2024-11-24 00:46:31,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2024-11-24 00:46:31,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:46:31,941 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:46:32,069 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 00:46:32,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 00:46:32,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:46:32 BasicIcfg
[2024-11-24 00:46:32,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 00:46:32,086 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 00:46:32,086 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 00:46:32,086 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 00:46:32,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:46:14" (3/4) ...
[2024-11-24 00:46:32,089 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 00:46:32,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 00:46:32,091 INFO L158 Benchmark]: Toolchain (without parser) took 20027.01ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 59.3MB in the beginning and 811.2MB in the end (delta: -751.9MB). Peak memory consumption was 410.5MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,092 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:46:32,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.47ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 35.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.79ms. Allocated memory is still 83.9MB. Free memory was 35.1MB in the beginning and 32.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:46:32,093 INFO L158 Benchmark]: Boogie Preprocessor took 108.07ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,093 INFO L158 Benchmark]: RCFGBuilder took 1226.49ms. Allocated memory is still 83.9MB. Free memory was 29.4MB in the beginning and 28.9MB in the end (delta: 504.2kB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,094 INFO L158 Benchmark]: TraceAbstraction took 17958.53ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 28.4MB in the beginning and 811.3MB in the end (delta: -782.9MB). Peak memory consumption was 370.9MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,095 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 1.2GB. Free memory was 811.3MB in the beginning and 811.2MB in the end (delta: 66.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:46:32,097 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.40ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 670.47ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 35.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 50.79ms. Allocated memory is still 83.9MB. Free memory was 35.1MB in the beginning and 32.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 108.07ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 29.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 1226.49ms. Allocated memory is still 83.9MB. Free memory was 29.4MB in the beginning and 28.9MB in the end (delta: 504.2kB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 17958.53ms. Allocated memory was 83.9MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 28.4MB in the beginning and 811.3MB in the end (delta: -782.9MB). Peak memory consumption was 370.9MB. Max. memory is 16.1GB.
* Witness Printer took 4.19ms. Allocated memory is still 1.2GB. Free memory was 811.3MB in the beginning and 811.2MB in the end (delta: 66.2kB). 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_p1_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 t713;
[L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t713=-1, 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_p1_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 t714;
[L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-1, t714=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L763] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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]
[L780] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0]
[L783] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0]
[L868] 0 pthread_t t715;
[L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-1, t714=0, t715=1, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L870] 0 pthread_t t716;
[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_p1_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=2, y=0, z=0]
[L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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, t713=-1, t714=0, t715=1, t716=2, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L800] 3 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, z=0]
[L803] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, z=1]
[L820] 4 z = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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, t713=-1, t714=0, t715=1, t716=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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_p1_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, t713=-1, t714=0, t715=1, t716=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2]
[L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_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_p1_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, t713=-1, t714=0, t715=1, t716=2, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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_p1_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=2, y=1, z=2]
[L17] 0 __assert_fail ("0", "mix027_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=2, y=1, 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: 17.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 18 mSDtfsCounter, 1876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 57, 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.7s InterpolantComputationTime, 309 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1004 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 69 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 00:46:32,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54f95ff6-9b78-41b9-a310-a5b0e28393d4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample