./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-30 03:04:40,285 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-30 03:04:40,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-30 03:04:40,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-30 03:04:40,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-30 03:04:40,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-30 03:04:40,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-30 03:04:40,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-30 03:04:40,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-30 03:04:40,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-30 03:04:40,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-30 03:04:40,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-30 03:04:40,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-30 03:04:40,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-30 03:04:40,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-30 03:04:40,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-30 03:04:40,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-30 03:04:40,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-30 03:04:40,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-30 03:04:40,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-30 03:04:40,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-30 03:04:40,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-30 03:04:40,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-30 03:04:40,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-30 03:04:40,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-30 03:04:40,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-30 03:04:40,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-30 03:04:40,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-30 03:04:40,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-30 03:04:40,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-30 03:04:40,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-30 03:04:40,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-30 03:04:40,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-30 03:04:40,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-30 03:04:40,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-30 03:04:40,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-30 03:04:40,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-30 03:04:40,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-30 03:04:40,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-30 03:04:40,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-30 03:04:40,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-30 03:04:40,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-08-30 03:04:40,395 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-30 03:04:40,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-30 03:04:40,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-30 03:04:40,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-30 03:04:40,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-30 03:04:40,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-30 03:04:40,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-30 03:04:40,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-30 03:04:40,398 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-30 03:04:40,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-30 03:04:40,399 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-30 03:04:40,400 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-30 03:04:40,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-30 03:04:40,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-30 03:04:40,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-30 03:04:40,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 03:04:40,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-30 03:04:40,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-30 03:04:40,402 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-30 03:04:40,403 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER
[2023-08-30 03:04:40,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-30 03:04:40,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-30 03:04:40,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-30 03:04:40,717 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-30 03:04:40,718 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-30 03:04:40,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:04:41,616 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-30 03:04:41,825 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-30 03:04:41,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:04:41,842 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169cc6faf/f1d77076324a41d5b0d0f12d21b58fee/FLAGe231f36d1
[2023-08-30 03:04:41,856 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169cc6faf/f1d77076324a41d5b0d0f12d21b58fee
[2023-08-30 03:04:41,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-30 03:04:41,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-30 03:04:41,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-30 03:04:41,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-30 03:04:41,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-30 03:04:41,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:04:41" (1/1) ...
[2023-08-30 03:04:41,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e76708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:41, skipping insertion in model container
[2023-08-30 03:04:41,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:04:41" (1/1) ...
[2023-08-30 03:04:41,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-30 03:04:41,916 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-30 03:04:42,045 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2023-08-30 03:04:42,201 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 03:04:42,248 INFO L203 MainTranslator]: Completed pre-run
[2023-08-30 03:04:42,255 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2023-08-30 03:04:42,292 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 03:04:42,318 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 03:04:42,318 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 03:04:42,322 INFO L208 MainTranslator]: Completed translation
[2023-08-30 03:04:42,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42 WrapperNode
[2023-08-30 03:04:42,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-30 03:04:42,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-30 03:04:42,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-30 03:04:42,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-30 03:04:42,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,377 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2023-08-30 03:04:42,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-30 03:04:42,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-30 03:04:42,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-30 03:04:42,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-30 03:04:42,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,400 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-30 03:04:42,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-30 03:04:42,413 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-30 03:04:42,413 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-30 03:04:42,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (1/1) ...
[2023-08-30 03:04:42,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 03:04:42,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-30 03:04:42,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-30 03:04:42,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-30 03:04:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-08-30 03:04:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-30 03:04:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-30 03:04:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-30 03:04:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-30 03:04:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-30 03:04:42,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-30 03:04:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-30 03:04:42,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-30 03:04:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-30 03:04:42,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-30 03:04:42,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-30 03:04:42,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-30 03:04:42,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-30 03:04:42,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-30 03:04:42,478 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-30 03:04:42,613 INFO L236 CfgBuilder]: Building ICFG
[2023-08-30 03:04:42,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-30 03:04:42,939 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-30 03:04:43,066 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-30 03:04:43,066 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-30 03:04:43,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:04:43 BoogieIcfgContainer
[2023-08-30 03:04:43,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-30 03:04:43,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-30 03:04:43,070 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-30 03:04:43,072 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-30 03:04:43,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:04:41" (1/3) ...
[2023-08-30 03:04:43,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2130472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:04:43, skipping insertion in model container
[2023-08-30 03:04:43,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:42" (2/3) ...
[2023-08-30 03:04:43,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2130472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:04:43, skipping insertion in model container
[2023-08-30 03:04:43,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:04:43" (3/3) ...
[2023-08-30 03:04:43,074 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:04:43,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-30 03:04:43,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-30 03:04:43,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-30 03:04:43,132 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-30 03:04:43,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow
[2023-08-30 03:04:43,206 INFO L130 PetriNetUnfolder]: 2/115 cut-off events.
[2023-08-30 03:04:43,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:04:43,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2023-08-30 03:04:43,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow
[2023-08-30 03:04:43,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow
[2023-08-30 03:04:43,218 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-30 03:04:43,227 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow
[2023-08-30 03:04:43,230 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow
[2023-08-30 03:04:43,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow
[2023-08-30 03:04:43,263 INFO L130 PetriNetUnfolder]: 2/115 cut-off events.
[2023-08-30 03:04:43,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:04:43,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2023-08-30 03:04:43,265 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144
[2023-08-30 03:04:46,830 INFO L134 LiptonReduction]: Checked pairs total: 6029
[2023-08-30 03:04:46,830 INFO L136 LiptonReduction]: Total number of compositions: 110
[2023-08-30 03:04:46,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-30 03:04:46,843 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@17ee0fa1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-30 03:04:46,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-30 03:04:46,844 INFO L130 PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-30 03:04:46,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:04:46,844 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:46,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-08-30 03:04:46,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:46,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 582, now seen corresponding path program 1 times
[2023-08-30 03:04:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9193078]
[2023-08-30 03:04:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9193078]
[2023-08-30 03:04:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9193078] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-30 03:04:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824400849]
[2023-08-30 03:04:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:46,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-30 03:04:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-30 03:04:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-30 03:04:46,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228
[2023-08-30 03:04:46,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 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)
[2023-08-30 03:04:46,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:46,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228
[2023-08-30 03:04:46,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:47,291 INFO L130 PetriNetUnfolder]: 1616/2377 cut-off events.
[2023-08-30 03:04:47,291 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2023-08-30 03:04:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 2377 events. 1616/2377 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11002 event pairs, 1616 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 4790. Up to 2368 conditions per place.
[2023-08-30 03:04:47,305 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions.
[2023-08-30 03:04:47,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow
[2023-08-30 03:04:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-30 03:04:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-30 03:04:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions.
[2023-08-30 03:04:47,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229
[2023-08-30 03:04:47,317 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions.
[2023-08-30 03:04:47,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions.
[2023-08-30 03:04:47,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:47,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions.
[2023-08-30 03:04:47,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 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)
[2023-08-30 03:04:47,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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)
[2023-08-30 03:04:47,328 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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)
[2023-08-30 03:04:47,329 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 236 transitions.
[2023-08-30 03:04:47,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow
[2023-08-30 03:04:47,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-30 03:04:47,332 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow
[2023-08-30 03:04:47,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25}
[2023-08-30 03:04:47,336 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places.
[2023-08-30 03:04:47,336 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow
[2023-08-30 03:04:47,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 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)
[2023-08-30 03:04:47,336 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:47,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-08-30 03:04:47,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-30 03:04:47,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:47,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash 574321, now seen corresponding path program 1 times
[2023-08-30 03:04:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:47,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883291093]
[2023-08-30 03:04:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883291093]
[2023-08-30 03:04:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883291093] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:47,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 03:04:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509661897]
[2023-08-30 03:04:47,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:47,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 03:04:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 03:04:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 03:04:47,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 228
[2023-08-30 03:04:47,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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)
[2023-08-30 03:04:47,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:47,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 228
[2023-08-30 03:04:47,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:47,831 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events.
[2023-08-30 03:04:47,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:04:47,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1942 events. 1263/1942 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9444 event pairs, 352 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 3848. Up to 1510 conditions per place.
[2023-08-30 03:04:47,837 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions.
[2023-08-30 03:04:47,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow
[2023-08-30 03:04:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-30 03:04:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 03:04:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions.
[2023-08-30 03:04:47,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058479532163743
[2023-08-30 03:04:47,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions.
[2023-08-30 03:04:47,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions.
[2023-08-30 03:04:47,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:47,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions.
[2023-08-30 03:04:47,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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)
[2023-08-30 03:04:47,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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)
[2023-08-30 03:04:47,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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)
[2023-08-30 03:04:47,843 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 346 transitions.
[2023-08-30 03:04:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow
[2023-08-30 03:04:47,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-30 03:04:47,844 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow
[2023-08-30 03:04:47,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23}
[2023-08-30 03:04:47,845 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places.
[2023-08-30 03:04:47,845 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow
[2023-08-30 03:04:47,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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)
[2023-08-30 03:04:47,845 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:47,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-30 03:04:47,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:47,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash 993790741, now seen corresponding path program 1 times
[2023-08-30 03:04:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:47,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198513489]
[2023-08-30 03:04:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198513489]
[2023-08-30 03:04:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198513489] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 03:04:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280447349]
[2023-08-30 03:04:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:48,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 03:04:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 03:04:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 03:04:48,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 228
[2023-08-30 03:04:48,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 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)
[2023-08-30 03:04:48,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:48,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 228
[2023-08-30 03:04:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:48,938 INFO L130 PetriNetUnfolder]: 1183/1759 cut-off events.
[2023-08-30 03:04:48,938 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES.
[2023-08-30 03:04:48,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 1759 events. 1183/1759 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8006 event pairs, 207 based on Foata normal form. 0/1689 useless extension candidates. Maximal degree in co-relation 3696. Up to 1025 conditions per place.
[2023-08-30 03:04:48,944 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 43 selfloop transitions, 5 changer transitions 0/50 dead transitions.
[2023-08-30 03:04:48,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 212 flow
[2023-08-30 03:04:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:04:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:04:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions.
[2023-08-30 03:04:48,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296
[2023-08-30 03:04:48,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions.
[2023-08-30 03:04:48,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions.
[2023-08-30 03:04:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:48,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions.
[2023-08-30 03:04:48,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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)
[2023-08-30 03:04:48,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:48,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:48,950 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 520 transitions.
[2023-08-30 03:04:48,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 212 flow
[2023-08-30 03:04:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 03:04:48,952 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 86 flow
[2023-08-30 03:04:48,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=26}
[2023-08-30 03:04:48,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places.
[2023-08-30 03:04:48,952 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 86 flow
[2023-08-30 03:04:48,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 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)
[2023-08-30 03:04:48,953 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:48,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:48,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-30 03:04:48,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:48,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 993790792, now seen corresponding path program 1 times
[2023-08-30 03:04:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331365719]
[2023-08-30 03:04:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331365719]
[2023-08-30 03:04:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331365719] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:04:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923252815]
[2023-08-30 03:04:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:49,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:04:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:49,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:04:49,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:04:49,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 228
[2023-08-30 03:04:49,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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)
[2023-08-30 03:04:49,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:49,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 228
[2023-08-30 03:04:49,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:49,626 INFO L130 PetriNetUnfolder]: 935/1427 cut-off events.
[2023-08-30 03:04:49,627 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES.
[2023-08-30 03:04:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1427 events. 935/1427 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6728 event pairs, 40 based on Foata normal form. 144/1571 useless extension candidates. Maximal degree in co-relation 3247. Up to 912 conditions per place.
[2023-08-30 03:04:49,632 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 35 selfloop transitions, 4 changer transitions 2/43 dead transitions.
[2023-08-30 03:04:49,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 202 flow
[2023-08-30 03:04:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:04:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:04:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2023-08-30 03:04:49,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4203216374269006
[2023-08-30 03:04:49,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2023-08-30 03:04:49,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2023-08-30 03:04:49,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:49,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2023-08-30 03:04:49,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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)
[2023-08-30 03:04:49,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:49,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:49,637 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 86 flow. Second operand 6 states and 575 transitions.
[2023-08-30 03:04:49,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 202 flow
[2023-08-30 03:04:49,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 03:04:49,639 INFO L231 Difference]: Finished difference. Result has 41 places, 22 transitions, 68 flow
[2023-08-30 03:04:49,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=22}
[2023-08-30 03:04:49,640 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2023-08-30 03:04:49,640 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 22 transitions, 68 flow
[2023-08-30 03:04:49,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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)
[2023-08-30 03:04:49,640 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:49,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:49,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-30 03:04:49,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:49,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash 741340173, now seen corresponding path program 1 times
[2023-08-30 03:04:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:49,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503356064]
[2023-08-30 03:04:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503356064]
[2023-08-30 03:04:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503356064] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-30 03:04:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342039664]
[2023-08-30 03:04:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:49,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 03:04:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 03:04:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 03:04:49,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228
[2023-08-30 03:04:49,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 22 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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)
[2023-08-30 03:04:49,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:49,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228
[2023-08-30 03:04:49,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:49,988 INFO L130 PetriNetUnfolder]: 831/1358 cut-off events.
[2023-08-30 03:04:49,988 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES.
[2023-08-30 03:04:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 1358 events. 831/1358 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6669 event pairs, 150 based on Foata normal form. 64/1421 useless extension candidates. Maximal degree in co-relation 2990. Up to 950 conditions per place.
[2023-08-30 03:04:49,993 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 29 selfloop transitions, 2 changer transitions 16/49 dead transitions.
[2023-08-30 03:04:49,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 230 flow
[2023-08-30 03:04:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:04:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:04:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions.
[2023-08-30 03:04:49,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157894736842105
[2023-08-30 03:04:49,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions.
[2023-08-30 03:04:49,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions.
[2023-08-30 03:04:49,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:49,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions.
[2023-08-30 03:04:49,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 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)
[2023-08-30 03:04:49,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:49,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:49,999 INFO L175 Difference]: Start difference. First operand has 41 places, 22 transitions, 68 flow. Second operand 5 states and 549 transitions.
[2023-08-30 03:04:49,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 230 flow
[2023-08-30 03:04:50,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 211 flow, removed 2 selfloop flow, removed 7 redundant places.
[2023-08-30 03:04:50,003 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 67 flow
[2023-08-30 03:04:50,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=22}
[2023-08-30 03:04:50,005 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places.
[2023-08-30 03:04:50,005 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 67 flow
[2023-08-30 03:04:50,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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)
[2023-08-30 03:04:50,005 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:50,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:50,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-30 03:04:50,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:50,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1506699646, now seen corresponding path program 1 times
[2023-08-30 03:04:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:50,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242077030]
[2023-08-30 03:04:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242077030]
[2023-08-30 03:04:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242077030] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-30 03:04:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669547864]
[2023-08-30 03:04:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 03:04:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 03:04:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 03:04:50,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 228
[2023-08-30 03:04:50,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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)
[2023-08-30 03:04:50,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:50,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 228
[2023-08-30 03:04:50,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:50,318 INFO L130 PetriNetUnfolder]: 745/1154 cut-off events.
[2023-08-30 03:04:50,318 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES.
[2023-08-30 03:04:50,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 1154 events. 745/1154 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5061 event pairs, 263 based on Foata normal form. 48/1198 useless extension candidates. Maximal degree in co-relation 2755. Up to 679 conditions per place.
[2023-08-30 03:04:50,323 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions.
[2023-08-30 03:04:50,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 203 flow
[2023-08-30 03:04:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:04:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:04:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions.
[2023-08-30 03:04:50,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157894736842105
[2023-08-30 03:04:50,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions.
[2023-08-30 03:04:50,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions.
[2023-08-30 03:04:50,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:50,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions.
[2023-08-30 03:04:50,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 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)
[2023-08-30 03:04:50,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:50,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:50,328 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 67 flow. Second operand 5 states and 549 transitions.
[2023-08-30 03:04:50,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 203 flow
[2023-08-30 03:04:50,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 193 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-08-30 03:04:50,330 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 71 flow
[2023-08-30 03:04:50,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=40, PETRI_TRANSITIONS=22}
[2023-08-30 03:04:50,331 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places.
[2023-08-30 03:04:50,331 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 71 flow
[2023-08-30 03:04:50,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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)
[2023-08-30 03:04:50,331 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:50,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-30 03:04:50,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:50,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1337780706, now seen corresponding path program 1 times
[2023-08-30 03:04:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699781978]
[2023-08-30 03:04:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699781978]
[2023-08-30 03:04:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699781978] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:50,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:50,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:04:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536243609]
[2023-08-30 03:04:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:04:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:04:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:04:50,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 228
[2023-08-30 03:04:50,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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)
[2023-08-30 03:04:50,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:50,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 228
[2023-08-30 03:04:50,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:51,151 INFO L130 PetriNetUnfolder]: 1147/1805 cut-off events.
[2023-08-30 03:04:51,151 INFO L131 PetriNetUnfolder]: For 540/540 co-relation queries the response was YES.
[2023-08-30 03:04:51,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4338 conditions, 1805 events. 1147/1805 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9063 event pairs, 265 based on Foata normal form. 45/1848 useless extension candidates. Maximal degree in co-relation 4329. Up to 634 conditions per place.
[2023-08-30 03:04:51,157 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 38 selfloop transitions, 3 changer transitions 19/61 dead transitions.
[2023-08-30 03:04:51,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 298 flow
[2023-08-30 03:04:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:04:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:04:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions.
[2023-08-30 03:04:51,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883040935672514
[2023-08-30 03:04:51,167 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 614 transitions.
[2023-08-30 03:04:51,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 614 transitions.
[2023-08-30 03:04:51,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:51,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 614 transitions.
[2023-08-30 03:04:51,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 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)
[2023-08-30 03:04:51,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:51,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:51,170 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 71 flow. Second operand 6 states and 614 transitions.
[2023-08-30 03:04:51,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 298 flow
[2023-08-30 03:04:51,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 276 flow, removed 5 selfloop flow, removed 5 redundant places.
[2023-08-30 03:04:51,174 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 77 flow
[2023-08-30 03:04:51,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=42, PETRI_TRANSITIONS=22}
[2023-08-30 03:04:51,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places.
[2023-08-30 03:04:51,174 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 77 flow
[2023-08-30 03:04:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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)
[2023-08-30 03:04:51,175 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:51,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-30 03:04:51,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:51,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1097594989, now seen corresponding path program 1 times
[2023-08-30 03:04:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062066366]
[2023-08-30 03:04:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:51,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062066366]
[2023-08-30 03:04:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062066366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:51,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:51,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 03:04:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784937708]
[2023-08-30 03:04:51,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:51,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 03:04:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:51,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 03:04:51,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-08-30 03:04:51,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 228
[2023-08-30 03:04:51,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 22 transitions, 77 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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)
[2023-08-30 03:04:51,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:51,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 228
[2023-08-30 03:04:51,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:52,159 INFO L130 PetriNetUnfolder]: 1033/1592 cut-off events.
[2023-08-30 03:04:52,159 INFO L131 PetriNetUnfolder]: For 681/682 co-relation queries the response was YES.
[2023-08-30 03:04:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 1592 events. 1033/1592 cut-off events. For 681/682 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6944 event pairs, 185 based on Foata normal form. 36/1627 useless extension candidates. Maximal degree in co-relation 4006. Up to 731 conditions per place.
[2023-08-30 03:04:52,164 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 35 selfloop transitions, 5 changer transitions 15/56 dead transitions.
[2023-08-30 03:04:52,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 279 flow
[2023-08-30 03:04:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:04:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:04:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions.
[2023-08-30 03:04:52,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844
[2023-08-30 03:04:52,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions.
[2023-08-30 03:04:52,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions.
[2023-08-30 03:04:52,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:52,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions.
[2023-08-30 03:04:52,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 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)
[2023-08-30 03:04:52,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:52,169 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:52,169 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 77 flow. Second operand 5 states and 516 transitions.
[2023-08-30 03:04:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 279 flow
[2023-08-30 03:04:52,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 255 flow, removed 6 selfloop flow, removed 6 redundant places.
[2023-08-30 03:04:52,172 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 95 flow
[2023-08-30 03:04:52,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=41, PETRI_TRANSITIONS=25}
[2023-08-30 03:04:52,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2023-08-30 03:04:52,174 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 95 flow
[2023-08-30 03:04:52,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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)
[2023-08-30 03:04:52,174 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:52,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:52,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-30 03:04:52,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:52,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -403614193, now seen corresponding path program 2 times
[2023-08-30 03:04:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:52,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098953722]
[2023-08-30 03:04:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098953722]
[2023-08-30 03:04:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098953722] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 03:04:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046303292]
[2023-08-30 03:04:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 03:04:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 03:04:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-08-30 03:04:52,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228
[2023-08-30 03:04:52,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 95 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 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)
[2023-08-30 03:04:52,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:52,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228
[2023-08-30 03:04:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:52,886 INFO L130 PetriNetUnfolder]: 714/1127 cut-off events.
[2023-08-30 03:04:52,886 INFO L131 PetriNetUnfolder]: For 710/711 co-relation queries the response was YES.
[2023-08-30 03:04:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 1127 events. 714/1127 cut-off events. For 710/711 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4606 event pairs, 99 based on Foata normal form. 36/1162 useless extension candidates. Maximal degree in co-relation 3052. Up to 677 conditions per place.
[2023-08-30 03:04:52,891 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 34 selfloop transitions, 6 changer transitions 20/61 dead transitions.
[2023-08-30 03:04:52,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 332 flow
[2023-08-30 03:04:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:04:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:04:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions.
[2023-08-30 03:04:52,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576
[2023-08-30 03:04:52,893 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions.
[2023-08-30 03:04:52,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions.
[2023-08-30 03:04:52,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:52,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions.
[2023-08-30 03:04:52,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 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)
[2023-08-30 03:04:52,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:52,897 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:52,897 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 95 flow. Second operand 6 states and 648 transitions.
[2023-08-30 03:04:52,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 332 flow
[2023-08-30 03:04:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 316 flow, removed 4 selfloop flow, removed 3 redundant places.
[2023-08-30 03:04:52,900 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 131 flow
[2023-08-30 03:04:52,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=27}
[2023-08-30 03:04:52,901 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places.
[2023-08-30 03:04:52,901 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 131 flow
[2023-08-30 03:04:52,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 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)
[2023-08-30 03:04:52,902 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:52,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:52,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-30 03:04:52,902 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:52,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash -296740294, now seen corresponding path program 1 times
[2023-08-30 03:04:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837874303]
[2023-08-30 03:04:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837874303]
[2023-08-30 03:04:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837874303] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:53,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-08-30 03:04:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776912195]
[2023-08-30 03:04:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-08-30 03:04:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-08-30 03:04:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2023-08-30 03:04:53,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 228
[2023-08-30 03:04:53,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 131 flow. Second operand has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 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)
[2023-08-30 03:04:53,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:53,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 228
[2023-08-30 03:04:53,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:54,602 INFO L130 PetriNetUnfolder]: 976/1550 cut-off events.
[2023-08-30 03:04:54,602 INFO L131 PetriNetUnfolder]: For 1767/1767 co-relation queries the response was YES.
[2023-08-30 03:04:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 1550 events. 976/1550 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6952 event pairs, 109 based on Foata normal form. 75/1625 useless extension candidates. Maximal degree in co-relation 4339. Up to 584 conditions per place.
[2023-08-30 03:04:54,607 INFO L137 encePairwiseOnDemand]: 216/228 looper letters, 56 selfloop transitions, 21 changer transitions 54/132 dead transitions.
[2023-08-30 03:04:54,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 132 transitions, 754 flow
[2023-08-30 03:04:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2023-08-30 03:04:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2023-08-30 03:04:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1662 transitions.
[2023-08-30 03:04:54,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42879256965944273
[2023-08-30 03:04:54,612 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1662 transitions.
[2023-08-30 03:04:54,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1662 transitions.
[2023-08-30 03:04:54,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:54,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1662 transitions.
[2023-08-30 03:04:54,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 97.76470588235294) internal successors, (1662), 17 states have internal predecessors, (1662), 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)
[2023-08-30 03:04:54,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 228.0) internal successors, (4104), 18 states have internal predecessors, (4104), 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)
[2023-08-30 03:04:54,620 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 228.0) internal successors, (4104), 18 states have internal predecessors, (4104), 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)
[2023-08-30 03:04:54,620 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 131 flow. Second operand 17 states and 1662 transitions.
[2023-08-30 03:04:54,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 132 transitions, 754 flow
[2023-08-30 03:04:54,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 132 transitions, 705 flow, removed 12 selfloop flow, removed 4 redundant places.
[2023-08-30 03:04:54,625 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 282 flow
[2023-08-30 03:04:54,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=282, PETRI_PLACES=69, PETRI_TRANSITIONS=41}
[2023-08-30 03:04:54,626 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places.
[2023-08-30 03:04:54,626 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 282 flow
[2023-08-30 03:04:54,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 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)
[2023-08-30 03:04:54,627 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:54,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:54,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-30 03:04:54,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:54,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1185252435, now seen corresponding path program 1 times
[2023-08-30 03:04:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:54,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207527422]
[2023-08-30 03:04:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207527422]
[2023-08-30 03:04:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207527422] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:04:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771981600]
[2023-08-30 03:04:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:55,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:04:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:04:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:04:55,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228
[2023-08-30 03:04:55,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 41 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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)
[2023-08-30 03:04:55,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:55,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228
[2023-08-30 03:04:55,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:55,335 INFO L130 PetriNetUnfolder]: 641/1038 cut-off events.
[2023-08-30 03:04:55,335 INFO L131 PetriNetUnfolder]: For 4442/4442 co-relation queries the response was YES.
[2023-08-30 03:04:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 1038 events. 641/1038 cut-off events. For 4442/4442 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4205 event pairs, 239 based on Foata normal form. 28/1066 useless extension candidates. Maximal degree in co-relation 3947. Up to 829 conditions per place.
[2023-08-30 03:04:55,345 INFO L137 encePairwiseOnDemand]: 218/228 looper letters, 43 selfloop transitions, 19 changer transitions 12/75 dead transitions.
[2023-08-30 03:04:55,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 605 flow
[2023-08-30 03:04:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-30 03:04:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 03:04:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions.
[2023-08-30 03:04:55,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2023-08-30 03:04:55,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions.
[2023-08-30 03:04:55,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions.
[2023-08-30 03:04:55,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:55,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions.
[2023-08-30 03:04:55,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 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)
[2023-08-30 03:04:55,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 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)
[2023-08-30 03:04:55,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 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)
[2023-08-30 03:04:55,351 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 282 flow. Second operand 7 states and 741 transitions.
[2023-08-30 03:04:55,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 605 flow
[2023-08-30 03:04:55,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 564 flow, removed 18 selfloop flow, removed 10 redundant places.
[2023-08-30 03:04:55,360 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 386 flow
[2023-08-30 03:04:55,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=59, PETRI_TRANSITIONS=48}
[2023-08-30 03:04:55,361 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places.
[2023-08-30 03:04:55,361 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 386 flow
[2023-08-30 03:04:55,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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)
[2023-08-30 03:04:55,361 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:55,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:55,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-30 03:04:55,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:55,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -165516466, now seen corresponding path program 1 times
[2023-08-30 03:04:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:55,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713977011]
[2023-08-30 03:04:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713977011]
[2023-08-30 03:04:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713977011] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-08-30 03:04:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879260295]
[2023-08-30 03:04:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:56,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-08-30 03:04:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-08-30 03:04:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2023-08-30 03:04:56,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 228
[2023-08-30 03:04:56,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 96.6) internal successors, (966), 10 states have internal predecessors, (966), 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)
[2023-08-30 03:04:56,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:56,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 228
[2023-08-30 03:04:56,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:56,957 INFO L130 PetriNetUnfolder]: 779/1279 cut-off events.
[2023-08-30 03:04:56,957 INFO L131 PetriNetUnfolder]: For 3766/3766 co-relation queries the response was YES.
[2023-08-30 03:04:56,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 1279 events. 779/1279 cut-off events. For 3766/3766 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5743 event pairs, 83 based on Foata normal form. 46/1325 useless extension candidates. Maximal degree in co-relation 4971. Up to 466 conditions per place.
[2023-08-30 03:04:56,962 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 43 selfloop transitions, 15 changer transitions 45/104 dead transitions.
[2023-08-30 03:04:56,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 885 flow
[2023-08-30 03:04:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2023-08-30 03:04:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-08-30 03:04:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1228 transitions.
[2023-08-30 03:04:56,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883040935672514
[2023-08-30 03:04:56,966 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1228 transitions.
[2023-08-30 03:04:56,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1228 transitions.
[2023-08-30 03:04:56,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:56,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1228 transitions.
[2023-08-30 03:04:56,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 102.33333333333333) internal successors, (1228), 12 states have internal predecessors, (1228), 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)
[2023-08-30 03:04:56,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 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)
[2023-08-30 03:04:56,972 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 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)
[2023-08-30 03:04:56,972 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 386 flow. Second operand 12 states and 1228 transitions.
[2023-08-30 03:04:56,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 885 flow
[2023-08-30 03:04:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 843 flow, removed 9 selfloop flow, removed 4 redundant places.
[2023-08-30 03:04:56,989 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 329 flow
[2023-08-30 03:04:56,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=329, PETRI_PLACES=72, PETRI_TRANSITIONS=37}
[2023-08-30 03:04:56,990 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places.
[2023-08-30 03:04:56,990 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 329 flow
[2023-08-30 03:04:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.6) internal successors, (966), 10 states have internal predecessors, (966), 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)
[2023-08-30 03:04:56,991 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:56,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-30 03:04:56,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:56,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -248928383, now seen corresponding path program 2 times
[2023-08-30 03:04:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411938090]
[2023-08-30 03:04:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411938090]
[2023-08-30 03:04:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411938090] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:57,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 03:04:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526105053]
[2023-08-30 03:04:57,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 03:04:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:57,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 03:04:57,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 03:04:57,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228
[2023-08-30 03:04:57,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 37 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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)
[2023-08-30 03:04:57,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:57,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228
[2023-08-30 03:04:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:57,314 INFO L130 PetriNetUnfolder]: 293/524 cut-off events.
[2023-08-30 03:04:57,314 INFO L131 PetriNetUnfolder]: For 3372/3375 co-relation queries the response was YES.
[2023-08-30 03:04:57,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 524 events. 293/524 cut-off events. For 3372/3375 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2110 event pairs, 52 based on Foata normal form. 55/577 useless extension candidates. Maximal degree in co-relation 2318. Up to 336 conditions per place.
[2023-08-30 03:04:57,316 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 40 selfloop transitions, 4 changer transitions 33/79 dead transitions.
[2023-08-30 03:04:57,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 860 flow
[2023-08-30 03:04:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:04:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:04:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions.
[2023-08-30 03:04:57,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745614035087719
[2023-08-30 03:04:57,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions.
[2023-08-30 03:04:57,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions.
[2023-08-30 03:04:57,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:57,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions.
[2023-08-30 03:04:57,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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)
[2023-08-30 03:04:57,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:57,321 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 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)
[2023-08-30 03:04:57,321 INFO L175 Difference]: Start difference. First operand has 72 places, 37 transitions, 329 flow. Second operand 5 states and 541 transitions.
[2023-08-30 03:04:57,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 860 flow
[2023-08-30 03:04:57,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 745 flow, removed 30 selfloop flow, removed 16 redundant places.
[2023-08-30 03:04:57,325 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 253 flow
[2023-08-30 03:04:57,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=57, PETRI_TRANSITIONS=34}
[2023-08-30 03:04:57,326 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2023-08-30 03:04:57,326 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 253 flow
[2023-08-30 03:04:57,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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)
[2023-08-30 03:04:57,326 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:57,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:57,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-30 03:04:57,326 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:57,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1058050121, now seen corresponding path program 1 times
[2023-08-30 03:04:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212321248]
[2023-08-30 03:04:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:57,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212321248]
[2023-08-30 03:04:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212321248] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:04:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437567928]
[2023-08-30 03:04:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:57,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 03:04:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 03:04:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 03:04:57,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228
[2023-08-30 03:04:57,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 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)
[2023-08-30 03:04:57,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:57,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228
[2023-08-30 03:04:57,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:57,656 INFO L130 PetriNetUnfolder]: 147/295 cut-off events.
[2023-08-30 03:04:57,656 INFO L131 PetriNetUnfolder]: For 1311/1312 co-relation queries the response was YES.
[2023-08-30 03:04:57,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 295 events. 147/295 cut-off events. For 1311/1312 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1061 event pairs, 17 based on Foata normal form. 33/326 useless extension candidates. Maximal degree in co-relation 1365. Up to 123 conditions per place.
[2023-08-30 03:04:57,659 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 44 selfloop transitions, 7 changer transitions 25/78 dead transitions.
[2023-08-30 03:04:57,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 767 flow
[2023-08-30 03:04:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:04:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:04:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2023-08-30 03:04:57,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47149122807017546
[2023-08-30 03:04:57,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2023-08-30 03:04:57,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2023-08-30 03:04:57,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:57,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2023-08-30 03:04:57,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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)
[2023-08-30 03:04:57,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:57,666 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 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)
[2023-08-30 03:04:57,666 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 253 flow. Second operand 6 states and 645 transitions.
[2023-08-30 03:04:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 767 flow
[2023-08-30 03:04:57,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 745 flow, removed 9 selfloop flow, removed 2 redundant places.
[2023-08-30 03:04:57,671 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 295 flow
[2023-08-30 03:04:57,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=61, PETRI_TRANSITIONS=37}
[2023-08-30 03:04:57,672 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places.
[2023-08-30 03:04:57,672 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 295 flow
[2023-08-30 03:04:57,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 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)
[2023-08-30 03:04:57,673 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:57,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:57,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-08-30 03:04:57,673 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:57,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1706966367, now seen corresponding path program 1 times
[2023-08-30 03:04:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961410321]
[2023-08-30 03:04:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:04:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:04:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 03:04:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961410321]
[2023-08-30 03:04:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961410321] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:04:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:04:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 03:04:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983967554]
[2023-08-30 03:04:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:04:57,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:04:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 03:04:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:04:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:04:57,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228
[2023-08-30 03:04:57,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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)
[2023-08-30 03:04:57,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:04:57,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228
[2023-08-30 03:04:57,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:04:58,012 INFO L130 PetriNetUnfolder]: 88/185 cut-off events.
[2023-08-30 03:04:58,013 INFO L131 PetriNetUnfolder]: For 826/827 co-relation queries the response was YES.
[2023-08-30 03:04:58,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 185 events. 88/185 cut-off events. For 826/827 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 566 event pairs, 14 based on Foata normal form. 10/193 useless extension candidates. Maximal degree in co-relation 904. Up to 70 conditions per place.
[2023-08-30 03:04:58,014 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 41 selfloop transitions, 10 changer transitions 12/65 dead transitions.
[2023-08-30 03:04:58,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 658 flow
[2023-08-30 03:04:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-30 03:04:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 03:04:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions.
[2023-08-30 03:04:58,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737
[2023-08-30 03:04:58,016 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions.
[2023-08-30 03:04:58,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions.
[2023-08-30 03:04:58,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:04:58,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions.
[2023-08-30 03:04:58,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 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)
[2023-08-30 03:04:58,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 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)
[2023-08-30 03:04:58,019 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 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)
[2023-08-30 03:04:58,020 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 295 flow. Second operand 7 states and 735 transitions.
[2023-08-30 03:04:58,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 658 flow
[2023-08-30 03:04:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 568 flow, removed 34 selfloop flow, removed 6 redundant places.
[2023-08-30 03:04:58,022 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 267 flow
[2023-08-30 03:04:58,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=62, PETRI_TRANSITIONS=37}
[2023-08-30 03:04:58,023 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places.
[2023-08-30 03:04:58,023 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 267 flow
[2023-08-30 03:04:58,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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)
[2023-08-30 03:04:58,023 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:04:58,024 INFO L208 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]
[2023-08-30 03:04:58,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-08-30 03:04:58,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:04:58,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:04:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash 710784996, now seen corresponding path program 1 times
[2023-08-30 03:04:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 03:04:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948182852]
[2023-08-30 03:04:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:04:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 03:04:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 03:04:58,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-30 03:04:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 03:04:58,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-30 03:04:58,174 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-30 03:04:58,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-30 03:04:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-30 03:04:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-30 03:04:58,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-08-30 03:04:58,179 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:04:58,182 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-30 03:04:58,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-30 03:04:58,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:04:58 BasicIcfg
[2023-08-30 03:04:58,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-30 03:04:58,242 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-30 03:04:58,242 INFO L271 PluginConnector]: Initializing Witness Printer...
[2023-08-30 03:04:58,242 INFO L275 PluginConnector]: Witness Printer initialized
[2023-08-30 03:04:58,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:04:43" (3/4) ...
[2023-08-30 03:04:58,244 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-08-30 03:04:58,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-30 03:04:58,245 INFO L158 Benchmark]: Toolchain (without parser) took 16386.23ms. Allocated memory was 77.6MB in the beginning and 499.1MB in the end (delta: 421.5MB). Free memory was 53.7MB in the beginning and 298.4MB in the end (delta: -244.8MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,245 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 03:04:58,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.71ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 46.4MB in the end (delta: 7.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 43.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,246 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 77.6MB. Free memory was 43.7MB in the beginning and 41.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,246 INFO L158 Benchmark]: RCFGBuilder took 655.28ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 41.3MB in the beginning and 47.9MB in the end (delta: -6.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,246 INFO L158 Benchmark]: TraceAbstraction took 15171.84ms. Allocated memory was 94.4MB in the beginning and 499.1MB in the end (delta: 404.8MB). Free memory was 47.4MB in the beginning and 298.4MB in the end (delta: -251.0MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB.
[2023-08-30 03:04:58,246 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 499.1MB. Free memory is still 298.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 03:04:58,247 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 462.71ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 46.4MB in the end (delta: 7.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 53.92ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 43.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 26.63ms. Allocated memory is still 77.6MB. Free memory was 43.7MB in the beginning and 41.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 655.28ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 41.3MB in the beginning and 47.9MB in the end (delta: -6.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 15171.84ms. Allocated memory was 94.4MB in the beginning and 499.1MB in the end (delta: 404.8MB). Free memory was 47.4MB in the beginning and 298.4MB in the end (delta: -251.0MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB.
* Witness Printer took 2.47ms. Allocated memory is still 499.1MB. Free memory is still 298.4MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 3.6s, 123 PlacesBefore, 41 PlacesAfterwards, 115 TransitionsBefore, 32 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 6029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2355, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1080, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2355, independent: 1126, independent conditional: 0, independent unconditional: 1126, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1080, unknown conditional: 0, unknown unconditional: 1080] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 int __unbuffered_p2_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff0_thd3;
[L728] 0 _Bool y$r_buff1_thd0;
[L729] 0 _Bool y$r_buff1_thd1;
[L730] 0 _Bool y$r_buff1_thd2;
[L731] 0 _Bool y$r_buff1_thd3;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1849;
[L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-3, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 2
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3
[L752] 1 y$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848] 0 pthread_t t1850;
[L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-2, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L850] 0 pthread_t t1851;
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L792] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L793] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L794] 3 y$flush_delayed = weak$$choice2
[L795] 3 y$mem_tmp = y
[L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] 3 __unbuffered_p2_EAX = y
[L804] 3 y = y$flush_delayed ? y$mem_tmp : y
[L805] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L808] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L809] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L810] 3 y$flush_delayed = weak$$choice2
[L811] 3 y$mem_tmp = y
[L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819] 3 __unbuffered_p2_EBX = y
[L820] 3 y = y$flush_delayed ? y$mem_tmp : y
[L821] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L787] 2 return 0;
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L767] 1 return 0;
[L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L833] 3 return 0;
[L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L855] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L855] RET 0 assume_abort_if_not(main$tmp_guard0)
[L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L864] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L865] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L866] 0 y$flush_delayed = weak$$choice2
[L867] 0 y$mem_tmp = y
[L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L876] 0 y = y$flush_delayed ? y$mem_tmp : y
[L877] 0 y$flush_delayed = (_Bool)0
[L879] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 145 locations, 13 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: 15.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1061 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 868 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 683 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2297 IncrementalHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 57 mSDtfsCounter, 2297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 2191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-30 03:04:58,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-30 03:04:59,879 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-30 03:04:59,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-30 03:04:59,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-30 03:04:59,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-30 03:04:59,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-30 03:04:59,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-30 03:04:59,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-30 03:04:59,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-30 03:04:59,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-30 03:04:59,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-30 03:04:59,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-30 03:04:59,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-30 03:04:59,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-30 03:04:59,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-30 03:04:59,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-30 03:04:59,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-30 03:04:59,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-30 03:04:59,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-30 03:04:59,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-30 03:04:59,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-30 03:04:59,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-30 03:04:59,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-30 03:04:59,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-30 03:04:59,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-30 03:04:59,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-30 03:04:59,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-30 03:04:59,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-30 03:04:59,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-30 03:04:59,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-30 03:04:59,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-30 03:04:59,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-30 03:04:59,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-30 03:04:59,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-30 03:04:59,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-30 03:04:59,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-30 03:04:59,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-30 03:04:59,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-30 03:04:59,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-30 03:04:59,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-30 03:04:59,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-30 03:04:59,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-08-30 03:04:59,979 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-30 03:04:59,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-30 03:04:59,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-30 03:04:59,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-30 03:04:59,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-30 03:04:59,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-30 03:04:59,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-30 03:04:59,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-30 03:04:59,984 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-30 03:04:59,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-30 03:04:59,984 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2023-08-30 03:04:59,985 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-30 03:04:59,986 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-30 03:04:59,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-30 03:04:59,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-30 03:04:59,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-30 03:04:59,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 03:04:59,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-30 03:04:59,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-30 03:04:59,987 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * Logic for external solver=AUFBV
[2023-08-30 03:04:59,988 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-30 03:04:59,989 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER
[2023-08-30 03:05:00,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-30 03:05:00,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-30 03:05:00,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-30 03:05:00,253 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-30 03:05:00,253 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-30 03:05:00,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:05:01,241 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-30 03:05:01,451 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-30 03:05:01,451 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:05:01,467 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f130216c7/3f341ee9c99c467e80bc17d3c202ab62/FLAGdefeb26bf
[2023-08-30 03:05:01,484 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f130216c7/3f341ee9c99c467e80bc17d3c202ab62
[2023-08-30 03:05:01,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-30 03:05:01,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-30 03:05:01,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-30 03:05:01,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-30 03:05:01,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-30 03:05:01,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:01,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0a96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01, skipping insertion in model container
[2023-08-30 03:05:01,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:01,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-30 03:05:01,542 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-30 03:05:01,672 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2023-08-30 03:05:01,857 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 03:05:01,867 INFO L203 MainTranslator]: Completed pre-run
[2023-08-30 03:05:01,876 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2023-08-30 03:05:01,940 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 03:05:01,978 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 03:05:01,978 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 03:05:01,982 INFO L208 MainTranslator]: Completed translation
[2023-08-30 03:05:01,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01 WrapperNode
[2023-08-30 03:05:01,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-30 03:05:01,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-30 03:05:01,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-30 03:05:01,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-30 03:05:01,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,037 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146
[2023-08-30 03:05:02,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-30 03:05:02,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-30 03:05:02,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-30 03:05:02,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-30 03:05:02,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,069 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-30 03:05:02,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-30 03:05:02,074 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-30 03:05:02,074 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-30 03:05:02,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (1/1) ...
[2023-08-30 03:05:02,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 03:05:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-30 03:05:02,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:02,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-30 03:05:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-30 03:05:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-30 03:05:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-30 03:05:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-30 03:05:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-30 03:05:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-30 03:05:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-30 03:05:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-30 03:05:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-30 03:05:02,135 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-30 03:05:02,256 INFO L236 CfgBuilder]: Building ICFG
[2023-08-30 03:05:02,258 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-30 03:05:02,554 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-30 03:05:02,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-30 03:05:02,711 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-30 03:05:02,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:02 BoogieIcfgContainer
[2023-08-30 03:05:02,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-30 03:05:02,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-30 03:05:02,715 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-30 03:05:02,717 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-30 03:05:02,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:05:01" (1/3) ...
[2023-08-30 03:05:02,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d1453b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:02, skipping insertion in model container
[2023-08-30 03:05:02,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:01" (2/3) ...
[2023-08-30 03:05:02,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d1453b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:02, skipping insertion in model container
[2023-08-30 03:05:02,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:02" (3/3) ...
[2023-08-30 03:05:02,719 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-08-30 03:05:02,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-30 03:05:02,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-30 03:05:02,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-30 03:05:02,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-30 03:05:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow
[2023-08-30 03:05:02,851 INFO L130 PetriNetUnfolder]: 2/116 cut-off events.
[2023-08-30 03:05:02,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:05:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2023-08-30 03:05:02,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow
[2023-08-30 03:05:02,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow
[2023-08-30 03:05:02,866 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-30 03:05:02,875 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow
[2023-08-30 03:05:02,877 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow
[2023-08-30 03:05:02,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow
[2023-08-30 03:05:02,907 INFO L130 PetriNetUnfolder]: 2/116 cut-off events.
[2023-08-30 03:05:02,907 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:05:02,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2023-08-30 03:05:02,910 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144
[2023-08-30 03:05:08,219 INFO L134 LiptonReduction]: Checked pairs total: 5574
[2023-08-30 03:05:08,219 INFO L136 LiptonReduction]: Total number of compositions: 113
[2023-08-30 03:05:08,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-30 03:05:08,233 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@30694ce8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-30 03:05:08,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-30 03:05:08,234 INFO L130 PetriNetUnfolder]: 0/1 cut-off events.
[2023-08-30 03:05:08,235 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:05:08,235 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:08,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-08-30 03:05:08,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:08,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times
[2023-08-30 03:05:08,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:08,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161162509]
[2023-08-30 03:05:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:08,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:08,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:08,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:08,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-08-30 03:05:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-08-30 03:05:08,317 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:08,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:08,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161162509]
[2023-08-30 03:05:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161162509] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-30 03:05:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308356479]
[2023-08-30 03:05:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:08,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-30 03:05:08,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-30 03:05:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-30 03:05:08,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232
[2023-08-30 03:05:08,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 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)
[2023-08-30 03:05:08,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:08,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232
[2023-08-30 03:05:08,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:08,660 INFO L130 PetriNetUnfolder]: 1616/2372 cut-off events.
[2023-08-30 03:05:08,660 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2023-08-30 03:05:08,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 2372 events. 1616/2372 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10997 event pairs, 1616 based on Foata normal form. 0/2016 useless extension candidates. Maximal degree in co-relation 4785. Up to 2368 conditions per place.
[2023-08-30 03:05:08,671 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions.
[2023-08-30 03:05:08,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow
[2023-08-30 03:05:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-30 03:05:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-30 03:05:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions.
[2023-08-30 03:05:08,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587
[2023-08-30 03:05:08,681 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions.
[2023-08-30 03:05:08,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions.
[2023-08-30 03:05:08,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:08,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions.
[2023-08-30 03:05:08,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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)
[2023-08-30 03:05:08,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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)
[2023-08-30 03:05:08,690 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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)
[2023-08-30 03:05:08,692 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 238 transitions.
[2023-08-30 03:05:08,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow
[2023-08-30 03:05:08,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-30 03:05:08,696 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow
[2023-08-30 03:05:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25}
[2023-08-30 03:05:08,700 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places.
[2023-08-30 03:05:08,700 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow
[2023-08-30 03:05:08,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 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)
[2023-08-30 03:05:08,701 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:08,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-08-30 03:05:08,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:08,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:08,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:08,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash 578229, now seen corresponding path program 1 times
[2023-08-30 03:05:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:08,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381971704]
[2023-08-30 03:05:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:08,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:08,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-08-30 03:05:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-30 03:05:08,980 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:08,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:08,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381971704]
[2023-08-30 03:05:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381971704] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 03:05:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222326041]
[2023-08-30 03:05:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 03:05:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 03:05:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 03:05:09,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232
[2023-08-30 03:05:09,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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)
[2023-08-30 03:05:09,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:09,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232
[2023-08-30 03:05:09,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:09,226 INFO L130 PetriNetUnfolder]: 1263/2015 cut-off events.
[2023-08-30 03:05:09,226 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 03:05:09,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2015 events. 1263/2015 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10956 event pairs, 204 based on Foata normal form. 0/1854 useless extension candidates. Maximal degree in co-relation 3921. Up to 1510 conditions per place.
[2023-08-30 03:05:09,233 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions.
[2023-08-30 03:05:09,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow
[2023-08-30 03:05:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-30 03:05:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 03:05:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions.
[2023-08-30 03:05:09,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014367816091954
[2023-08-30 03:05:09,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions.
[2023-08-30 03:05:09,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions.
[2023-08-30 03:05:09,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:09,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions.
[2023-08-30 03:05:09,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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)
[2023-08-30 03:05:09,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2023-08-30 03:05:09,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2023-08-30 03:05:09,243 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 349 transitions.
[2023-08-30 03:05:09,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow
[2023-08-30 03:05:09,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-30 03:05:09,245 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow
[2023-08-30 03:05:09,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23}
[2023-08-30 03:05:09,246 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places.
[2023-08-30 03:05:09,246 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow
[2023-08-30 03:05:09,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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)
[2023-08-30 03:05:09,246 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:09,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:05:09,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:09,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:09,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:09,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1132145577, now seen corresponding path program 1 times
[2023-08-30 03:05:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508103639]
[2023-08-30 03:05:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:09,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:09,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2023-08-30 03:05:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:09,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-30 03:05:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:09,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:09,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508103639]
[2023-08-30 03:05:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508103639] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 03:05:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903221201]
[2023-08-30 03:05:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 03:05:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 03:05:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 03:05:09,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232
[2023-08-30 03:05:09,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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)
[2023-08-30 03:05:09,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:09,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232
[2023-08-30 03:05:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:09,785 INFO L130 PetriNetUnfolder]: 679/1105 cut-off events.
[2023-08-30 03:05:09,786 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES.
[2023-08-30 03:05:09,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 1105 events. 679/1105 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5173 event pairs, 130 based on Foata normal form. 80/1137 useless extension candidates. Maximal degree in co-relation 2338. Up to 752 conditions per place.
[2023-08-30 03:05:09,789 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 31 selfloop transitions, 4 changer transitions 21/58 dead transitions.
[2023-08-30 03:05:09,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 248 flow
[2023-08-30 03:05:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:05:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:05:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions.
[2023-08-30 03:05:09,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47672413793103446
[2023-08-30 03:05:09,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions.
[2023-08-30 03:05:09,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions.
[2023-08-30 03:05:09,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:09,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions.
[2023-08-30 03:05:09,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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)
[2023-08-30 03:05:09,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:09,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:09,795 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 553 transitions.
[2023-08-30 03:05:09,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 248 flow
[2023-08-30 03:05:09,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 03:05:09,796 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow
[2023-08-30 03:05:09,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2023-08-30 03:05:09,797 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2023-08-30 03:05:09,797 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow
[2023-08-30 03:05:09,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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)
[2023-08-30 03:05:09,798 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:09,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:05:09,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:10,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:10,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 629998256, now seen corresponding path program 1 times
[2023-08-30 03:05:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:10,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749542408]
[2023-08-30 03:05:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:10,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:10,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:10,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2023-08-30 03:05:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:10,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-30 03:05:10,091 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:10,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:10,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749542408]
[2023-08-30 03:05:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749542408] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:05:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022003120]
[2023-08-30 03:05:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:10,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 03:05:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 03:05:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 03:05:10,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232
[2023-08-30 03:05:10,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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)
[2023-08-30 03:05:10,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:10,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232
[2023-08-30 03:05:10,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:10,342 INFO L130 PetriNetUnfolder]: 274/498 cut-off events.
[2023-08-30 03:05:10,342 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES.
[2023-08-30 03:05:10,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 498 events. 274/498 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2107 event pairs, 73 based on Foata normal form. 44/527 useless extension candidates. Maximal degree in co-relation 1325. Up to 157 conditions per place.
[2023-08-30 03:05:10,344 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 40 selfloop transitions, 7 changer transitions 21/70 dead transitions.
[2023-08-30 03:05:10,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 356 flow
[2023-08-30 03:05:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:05:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:05:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions.
[2023-08-30 03:05:10,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354
[2023-08-30 03:05:10,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions.
[2023-08-30 03:05:10,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions.
[2023-08-30 03:05:10,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:10,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions.
[2023-08-30 03:05:10,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 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)
[2023-08-30 03:05:10,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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)
[2023-08-30 03:05:10,350 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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)
[2023-08-30 03:05:10,350 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 664 transitions.
[2023-08-30 03:05:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 356 flow
[2023-08-30 03:05:10,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-08-30 03:05:10,352 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow
[2023-08-30 03:05:10,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29}
[2023-08-30 03:05:10,353 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places.
[2023-08-30 03:05:10,353 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow
[2023-08-30 03:05:10,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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)
[2023-08-30 03:05:10,354 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:10,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:05:10,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:10,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:10,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:10,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash -875696159, now seen corresponding path program 1 times
[2023-08-30 03:05:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66192489]
[2023-08-30 03:05:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:10,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:10,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:10,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2023-08-30 03:05:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:10,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-08-30 03:05:10,640 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:10,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:10,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66192489]
[2023-08-30 03:05:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66192489] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 03:05:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7442887]
[2023-08-30 03:05:10,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:10,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:05:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:05:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:05:10,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232
[2023-08-30 03:05:10,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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)
[2023-08-30 03:05:10,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:10,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232
[2023-08-30 03:05:10,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:10,915 INFO L130 PetriNetUnfolder]: 168/309 cut-off events.
[2023-08-30 03:05:10,916 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES.
[2023-08-30 03:05:10,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 309 events. 168/309 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1189 event pairs, 68 based on Foata normal form. 11/315 useless extension candidates. Maximal degree in co-relation 897. Up to 129 conditions per place.
[2023-08-30 03:05:10,917 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 37 selfloop transitions, 10 changer transitions 11/60 dead transitions.
[2023-08-30 03:05:10,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 350 flow
[2023-08-30 03:05:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-30 03:05:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 03:05:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions.
[2023-08-30 03:05:10,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46366995073891626
[2023-08-30 03:05:10,920 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions.
[2023-08-30 03:05:10,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions.
[2023-08-30 03:05:10,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:10,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions.
[2023-08-30 03:05:10,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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)
[2023-08-30 03:05:10,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 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)
[2023-08-30 03:05:10,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 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)
[2023-08-30 03:05:10,928 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 753 transitions.
[2023-08-30 03:05:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 350 flow
[2023-08-30 03:05:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places.
[2023-08-30 03:05:10,933 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow
[2023-08-30 03:05:10,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29}
[2023-08-30 03:05:10,934 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2023-08-30 03:05:10,934 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow
[2023-08-30 03:05:10,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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)
[2023-08-30 03:05:10,935 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:10,935 INFO L208 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]
[2023-08-30 03:05:10,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:11,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:11,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:11,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1641938106, now seen corresponding path program 1 times
[2023-08-30 03:05:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771357309]
[2023-08-30 03:05:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:11,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:11,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2023-08-30 03:05:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:11,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2023-08-30 03:05:11,236 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:11,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:11,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771357309]
[2023-08-30 03:05:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771357309] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:11,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:11,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-08-30 03:05:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661085418]
[2023-08-30 03:05:11,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:11,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-08-30 03:05:11,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:11,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-08-30 03:05:11,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2023-08-30 03:05:11,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232
[2023-08-30 03:05:11,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 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)
[2023-08-30 03:05:11,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:11,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232
[2023-08-30 03:05:11,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:12,199 INFO L130 PetriNetUnfolder]: 286/551 cut-off events.
[2023-08-30 03:05:12,199 INFO L131 PetriNetUnfolder]: For 692/692 co-relation queries the response was YES.
[2023-08-30 03:05:12,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 551 events. 286/551 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2454 event pairs, 78 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 1596. Up to 217 conditions per place.
[2023-08-30 03:05:12,202 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 75 selfloop transitions, 10 changer transitions 0/86 dead transitions.
[2023-08-30 03:05:12,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 618 flow
[2023-08-30 03:05:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-08-30 03:05:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-30 03:05:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions.
[2023-08-30 03:05:12,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492337164750958
[2023-08-30 03:05:12,204 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions.
[2023-08-30 03:05:12,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions.
[2023-08-30 03:05:12,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:12,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions.
[2023-08-30 03:05:12,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.22222222222223) internal successors, (938), 9 states have internal predecessors, (938), 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)
[2023-08-30 03:05:12,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 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)
[2023-08-30 03:05:12,209 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 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)
[2023-08-30 03:05:12,209 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 9 states and 938 transitions.
[2023-08-30 03:05:12,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 618 flow
[2023-08-30 03:05:12,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 496 flow, removed 36 selfloop flow, removed 6 redundant places.
[2023-08-30 03:05:12,212 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 157 flow
[2023-08-30 03:05:12,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=36}
[2023-08-30 03:05:12,212 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places.
[2023-08-30 03:05:12,212 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 157 flow
[2023-08-30 03:05:12,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 99.1) internal successors, (991), 10 states have internal predecessors, (991), 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)
[2023-08-30 03:05:12,213 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:12,213 INFO L208 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]
[2023-08-30 03:05:12,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2023-08-30 03:05:12,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:12,421 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:12,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 606892096, now seen corresponding path program 1 times
[2023-08-30 03:05:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223013076]
[2023-08-30 03:05:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 03:05:12,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:12,423 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:12,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2023-08-30 03:05:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 03:05:12,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core
[2023-08-30 03:05:12,549 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:12,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:12,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223013076]
[2023-08-30 03:05:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223013076] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:12,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:12,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 03:05:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126112802]
[2023-08-30 03:05:12,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:12,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 03:05:12,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:12,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 03:05:12,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 03:05:12,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 232
[2023-08-30 03:05:12,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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)
[2023-08-30 03:05:12,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:12,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 232
[2023-08-30 03:05:12,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:13,057 INFO L130 PetriNetUnfolder]: 269/502 cut-off events.
[2023-08-30 03:05:13,057 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES.
[2023-08-30 03:05:13,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 502 events. 269/502 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2274 event pairs, 28 based on Foata normal form. 3/500 useless extension candidates. Maximal degree in co-relation 1529. Up to 435 conditions per place.
[2023-08-30 03:05:13,059 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 37 selfloop transitions, 3 changer transitions 4/47 dead transitions.
[2023-08-30 03:05:13,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 302 flow
[2023-08-30 03:05:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:05:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:05:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions.
[2023-08-30 03:05:13,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4051724137931034
[2023-08-30 03:05:13,061 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 470 transitions.
[2023-08-30 03:05:13,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 470 transitions.
[2023-08-30 03:05:13,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:13,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 470 transitions.
[2023-08-30 03:05:13,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 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)
[2023-08-30 03:05:13,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:13,063 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:13,063 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 157 flow. Second operand 5 states and 470 transitions.
[2023-08-30 03:05:13,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 302 flow
[2023-08-30 03:05:13,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 03:05:13,065 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 149 flow
[2023-08-30 03:05:13,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=33}
[2023-08-30 03:05:13,066 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2023-08-30 03:05:13,066 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 149 flow
[2023-08-30 03:05:13,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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)
[2023-08-30 03:05:13,066 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:13,066 INFO L208 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]
[2023-08-30 03:05:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:13,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:13,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:13,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1943436492, now seen corresponding path program 2 times
[2023-08-30 03:05:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317539794]
[2023-08-30 03:05:13,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-08-30 03:05:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:13,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:13,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2023-08-30 03:05:13,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-30 03:05:13,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 03:05:13,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core
[2023-08-30 03:05:13,402 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:13,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:13,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317539794]
[2023-08-30 03:05:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317539794] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-30 03:05:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520168294]
[2023-08-30 03:05:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:13,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-30 03:05:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-30 03:05:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2023-08-30 03:05:13,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232
[2023-08-30 03:05:13,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 149 flow. Second operand has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 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)
[2023-08-30 03:05:13,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:13,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232
[2023-08-30 03:05:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:13,913 INFO L130 PetriNetUnfolder]: 365/714 cut-off events.
[2023-08-30 03:05:13,914 INFO L131 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES.
[2023-08-30 03:05:13,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 714 events. 365/714 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3509 event pairs, 71 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 2241. Up to 213 conditions per place.
[2023-08-30 03:05:13,916 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 45 selfloop transitions, 7 changer transitions 45/98 dead transitions.
[2023-08-30 03:05:13,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 632 flow
[2023-08-30 03:05:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-08-30 03:05:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-30 03:05:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 836 transitions.
[2023-08-30 03:05:13,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504310344827586
[2023-08-30 03:05:13,918 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 836 transitions.
[2023-08-30 03:05:13,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 836 transitions.
[2023-08-30 03:05:13,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:13,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 836 transitions.
[2023-08-30 03:05:13,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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)
[2023-08-30 03:05:13,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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)
[2023-08-30 03:05:13,922 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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)
[2023-08-30 03:05:13,922 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 149 flow. Second operand 8 states and 836 transitions.
[2023-08-30 03:05:13,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 632 flow
[2023-08-30 03:05:13,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 617 flow, removed 2 selfloop flow, removed 5 redundant places.
[2023-08-30 03:05:13,926 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 167 flow
[2023-08-30 03:05:13,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=55, PETRI_TRANSITIONS=33}
[2023-08-30 03:05:13,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2023-08-30 03:05:13,926 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 167 flow
[2023-08-30 03:05:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 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)
[2023-08-30 03:05:13,927 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:13,927 INFO L208 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]
[2023-08-30 03:05:13,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2023-08-30 03:05:14,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:14,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:14,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1023619402, now seen corresponding path program 3 times
[2023-08-30 03:05:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:14,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084980962]
[2023-08-30 03:05:14,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-08-30 03:05:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:14,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:14,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2023-08-30 03:05:14,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2023-08-30 03:05:14,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 03:05:14,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-30 03:05:14,225 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:14,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:14,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084980962]
[2023-08-30 03:05:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084980962] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 03:05:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637645228]
[2023-08-30 03:05:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 03:05:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 03:05:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 03:05:14,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232
[2023-08-30 03:05:14,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 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)
[2023-08-30 03:05:14,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:14,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232
[2023-08-30 03:05:14,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:14,420 INFO L130 PetriNetUnfolder]: 354/653 cut-off events.
[2023-08-30 03:05:14,420 INFO L131 PetriNetUnfolder]: For 1103/1105 co-relation queries the response was YES.
[2023-08-30 03:05:14,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 653 events. 354/653 cut-off events. For 1103/1105 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3107 event pairs, 91 based on Foata normal form. 2/645 useless extension candidates. Maximal degree in co-relation 2136. Up to 281 conditions per place.
[2023-08-30 03:05:14,423 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 3 changer transitions 23/65 dead transitions.
[2023-08-30 03:05:14,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 438 flow
[2023-08-30 03:05:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 03:05:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 03:05:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions.
[2023-08-30 03:05:14,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663793103448276
[2023-08-30 03:05:14,425 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions.
[2023-08-30 03:05:14,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions.
[2023-08-30 03:05:14,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:14,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions.
[2023-08-30 03:05:14,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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)
[2023-08-30 03:05:14,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:14,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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)
[2023-08-30 03:05:14,428 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 167 flow. Second operand 5 states and 541 transitions.
[2023-08-30 03:05:14,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 438 flow
[2023-08-30 03:05:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 408 flow, removed 6 selfloop flow, removed 7 redundant places.
[2023-08-30 03:05:14,431 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 129 flow
[2023-08-30 03:05:14,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=51, PETRI_TRANSITIONS=28}
[2023-08-30 03:05:14,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2023-08-30 03:05:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 129 flow
[2023-08-30 03:05:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 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)
[2023-08-30 03:05:14,432 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:14,432 INFO L208 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]
[2023-08-30 03:05:14,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:14,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:14,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash 581173014, now seen corresponding path program 4 times
[2023-08-30 03:05:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937131965]
[2023-08-30 03:05:14,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-08-30 03:05:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:14,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:14,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2023-08-30 03:05:14,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-08-30 03:05:14,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 03:05:14,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-08-30 03:05:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:14,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:14,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937131965]
[2023-08-30 03:05:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937131965] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:14,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:14,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 03:05:14,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857846408]
[2023-08-30 03:05:14,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:14,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 03:05:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:14,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 03:05:14,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 03:05:14,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232
[2023-08-30 03:05:14,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 28 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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)
[2023-08-30 03:05:14,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:14,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232
[2023-08-30 03:05:14,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:15,127 INFO L130 PetriNetUnfolder]: 167/340 cut-off events.
[2023-08-30 03:05:15,128 INFO L131 PetriNetUnfolder]: For 491/491 co-relation queries the response was YES.
[2023-08-30 03:05:15,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 340 events. 167/340 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1342 event pairs, 36 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1107. Up to 208 conditions per place.
[2023-08-30 03:05:15,129 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 31 selfloop transitions, 4 changer transitions 26/62 dead transitions.
[2023-08-30 03:05:15,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 397 flow
[2023-08-30 03:05:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-30 03:05:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 03:05:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 644 transitions.
[2023-08-30 03:05:15,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46264367816091956
[2023-08-30 03:05:15,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 644 transitions.
[2023-08-30 03:05:15,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 644 transitions.
[2023-08-30 03:05:15,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:15,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 644 transitions.
[2023-08-30 03:05:15,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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)
[2023-08-30 03:05:15,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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)
[2023-08-30 03:05:15,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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)
[2023-08-30 03:05:15,134 INFO L175 Difference]: Start difference. First operand has 51 places, 28 transitions, 129 flow. Second operand 6 states and 644 transitions.
[2023-08-30 03:05:15,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 397 flow
[2023-08-30 03:05:15,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 366 flow, removed 7 selfloop flow, removed 7 redundant places.
[2023-08-30 03:05:15,137 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 130 flow
[2023-08-30 03:05:15,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=28}
[2023-08-30 03:05:15,138 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places.
[2023-08-30 03:05:15,138 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 130 flow
[2023-08-30 03:05:15,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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)
[2023-08-30 03:05:15,138 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:15,138 INFO L208 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]
[2023-08-30 03:05:15,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:15,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:15,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:15,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1573810658, now seen corresponding path program 5 times
[2023-08-30 03:05:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622818630]
[2023-08-30 03:05:15,349 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-08-30 03:05:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:15,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:15,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2023-08-30 03:05:15,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-30 03:05:15,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 03:05:15,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-08-30 03:05:15,444 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 03:05:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 03:05:15,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 03:05:15,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 03:05:15,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622818630]
[2023-08-30 03:05:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622818630] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 03:05:15,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 03:05:15,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-08-30 03:05:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555685001]
[2023-08-30 03:05:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 03:05:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-08-30 03:05:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 03:05:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-08-30 03:05:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2023-08-30 03:05:15,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232
[2023-08-30 03:05:15,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 130 flow. Second operand has 9 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 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)
[2023-08-30 03:05:15,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 03:05:15,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232
[2023-08-30 03:05:15,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 03:05:16,014 INFO L130 PetriNetUnfolder]: 122/266 cut-off events.
[2023-08-30 03:05:16,015 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES.
[2023-08-30 03:05:16,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 266 events. 122/266 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 997 event pairs, 15 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 867. Up to 87 conditions per place.
[2023-08-30 03:05:16,017 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 45 selfloop transitions, 6 changer transitions 23/75 dead transitions.
[2023-08-30 03:05:16,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 488 flow
[2023-08-30 03:05:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-08-30 03:05:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-30 03:05:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 821 transitions.
[2023-08-30 03:05:16,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423491379310345
[2023-08-30 03:05:16,020 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 821 transitions.
[2023-08-30 03:05:16,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 821 transitions.
[2023-08-30 03:05:16,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 03:05:16,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 821 transitions.
[2023-08-30 03:05:16,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 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)
[2023-08-30 03:05:16,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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)
[2023-08-30 03:05:16,026 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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)
[2023-08-30 03:05:16,026 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 130 flow. Second operand 8 states and 821 transitions.
[2023-08-30 03:05:16,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 488 flow
[2023-08-30 03:05:16,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places.
[2023-08-30 03:05:16,029 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 155 flow
[2023-08-30 03:05:16,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=53, PETRI_TRANSITIONS=31}
[2023-08-30 03:05:16,029 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places.
[2023-08-30 03:05:16,029 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 155 flow
[2023-08-30 03:05:16,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 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)
[2023-08-30 03:05:16,030 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 03:05:16,030 INFO L208 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]
[2023-08-30 03:05:16,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:16,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:16,237 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-30 03:05:16,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 03:05:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1393221508, now seen corresponding path program 6 times
[2023-08-30 03:05:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 03:05:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614871022]
[2023-08-30 03:05:16,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-08-30 03:05:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 03:05:16,239 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 03:05:16,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2023-08-30 03:05:16,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2023-08-30 03:05:16,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2023-08-30 03:05:16,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-30 03:05:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 03:05:16,512 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-08-30 03:05:16,512 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-30 03:05:16,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-30 03:05:16,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-30 03:05:16,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-30 03:05:16,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2023-08-30 03:05:16,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 03:05:16,729 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1]
[2023-08-30 03:05:16,733 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-30 03:05:16,733 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-30 03:05:16,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:05:16 BasicIcfg
[2023-08-30 03:05:16,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-30 03:05:16,801 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-30 03:05:16,801 INFO L271 PluginConnector]: Initializing Witness Printer...
[2023-08-30 03:05:16,801 INFO L275 PluginConnector]: Witness Printer initialized
[2023-08-30 03:05:16,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:02" (3/4) ...
[2023-08-30 03:05:16,803 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-08-30 03:05:16,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-30 03:05:16,804 INFO L158 Benchmark]: Toolchain (without parser) took 15316.35ms. Allocated memory was 71.3MB in the beginning and 197.1MB in the end (delta: 125.8MB). Free memory was 45.0MB in the beginning and 69.2MB in the end (delta: -24.2MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,804 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 03:05:16,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.03ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 36.4MB in the end (delta: 8.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.36ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 33.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,805 INFO L158 Benchmark]: Boogie Preprocessor took 35.37ms. Allocated memory is still 71.3MB. Free memory was 33.6MB in the beginning and 31.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,805 INFO L158 Benchmark]: RCFGBuilder took 638.57ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 31.4MB in the beginning and 61.8MB in the end (delta: -30.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,805 INFO L158 Benchmark]: TraceAbstraction took 14085.51ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 61.2MB in the beginning and 69.2MB in the end (delta: -8.0MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB.
[2023-08-30 03:05:16,805 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 197.1MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 03:05:16,807 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 494.03ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 36.4MB in the end (delta: 8.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 54.36ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 33.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 35.37ms. Allocated memory is still 71.3MB. Free memory was 33.6MB in the beginning and 31.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 638.57ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 31.4MB in the beginning and 61.8MB in the end (delta: -30.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 14085.51ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 61.2MB in the beginning and 69.2MB in the end (delta: -8.0MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB.
* Witness Printer took 2.64ms. Allocated memory is still 197.1MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 5.3s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 5574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2348, independent: 2192, independent conditional: 0, independent unconditional: 2192, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1080, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2348, independent: 1143, independent conditional: 0, independent unconditional: 1143, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1080, unknown conditional: 0, unknown unconditional: 1080] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 int __unbuffered_p2_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff0_thd3;
[L728] 0 _Bool y$r_buff1_thd0;
[L729] 0 _Bool y$r_buff1_thd1;
[L730] 0 _Bool y$r_buff1_thd2;
[L731] 0 _Bool y$r_buff1_thd3;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1849;
[L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=0, t1849={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848] 0 pthread_t t1850;
[L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=1, t1849={-6:0}, t1850={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L850] 0 pthread_t t1851;
[L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=2, t1849={-6:0}, t1850={-10:0}, t1851={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 2
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3
[L752] 1 y$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L787] 2 return 0;
[L792] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L793] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L794] 3 y$flush_delayed = weak$$choice2
[L795] 3 y$mem_tmp = y
[L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] 3 __unbuffered_p2_EAX = y
[L804] 3 y = y$flush_delayed ? y$mem_tmp : y
[L805] 3 y$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L808] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L809] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L810] 3 y$flush_delayed = weak$$choice2
[L811] 3 y$mem_tmp = y
[L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819] 3 __unbuffered_p2_EBX = y
[L820] 3 y = y$flush_delayed ? y$mem_tmp : y
[L821] 3 y$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L767] 1 return 0;
[L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L833] 3 return 0;
[L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L855] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L855] RET 0 assume_abort_if_not(main$tmp_guard0)
[L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={-6:0}, t1850={-10:0}, t1851={-2:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L864] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L865] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L866] 0 y$flush_delayed = weak$$choice2
[L867] 0 y$mem_tmp = y
[L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L876] 0 y = y$flush_delayed ? y$mem_tmp : y
[L877] 0 y$flush_delayed = (_Bool)0
[L879] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 146 locations, 13 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: 13.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1894 IncrementalHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 17 mSDtfsCounter, 1894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=8, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 167 ConstructedInterpolants, 13 QuantifiedInterpolants, 1755 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1549 ConjunctsInSsa, 118 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-30 03:05:16,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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