./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 BEFORE --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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:29:40,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:29:40,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:29:40,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:29:40,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:29:40,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:29:40,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:29:40,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:29:40,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:29:40,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:29:40,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:29:40,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:29:40,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:29:40,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:29:40,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:29:40,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:29:40,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:29:40,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:29:40,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:29:40,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:29:40,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:29:40,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:29:40,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:29:40,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:29:40,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:29:40,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:29:40,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:29:40,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:29:40,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:29:40,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:29:40,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:29:40,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:29:40,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:29:40,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:29:40,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:29:40,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:29:40,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:29:40,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:29:40,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:29:40,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:29:40,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:29:40,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:29:40,452 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:29:40,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:29:40,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:29:40,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:29:40,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:29:40,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:29:40,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:29:40,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:29:40,455 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:29:40,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:29:40,456 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:29:40,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:29:40,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:29:40,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:29:40,457 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:29:40,458 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:29:40,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:29:40,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:29:40,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:29:40,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:40,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:29:40,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:29:40,460 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:29:40,460 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 -> BEFORE [2023-08-31 23:29:40,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:29:40,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:29:40,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:29:40,811 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:29:40,811 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:29:40,812 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-31 23:29:41,834 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:29:42,082 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:29:42,097 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-31 23:29:42,123 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2942c2f/271fc3dd5b4c4861b4e92aeb3553d958/FLAGa454d4528 [2023-08-31 23:29:42,137 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2942c2f/271fc3dd5b4c4861b4e92aeb3553d958 [2023-08-31 23:29:42,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:29:42,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:29:42,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:42,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:29:42,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:29:42,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a33649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42, skipping insertion in model container [2023-08-31 23:29:42,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:29:42,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:29:42,278 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-31 23:29:42,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:42,443 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:29:42,451 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-31 23:29:42,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:42,529 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:42,529 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:42,533 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:29:42,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42 WrapperNode [2023-08-31 23:29:42,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:42,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:42,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:29:42,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:29:42,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,588 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-31 23:29:42,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:42,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:29:42,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:29:42,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:29:42,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:29:42,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:29:42,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:29:42,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:29:42,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (1/1) ... [2023-08-31 23:29:42,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:42,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:29:42,665 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-31 23:29:42,711 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-31 23:29:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:29:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:29:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:29:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:29:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:29:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:29:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:29:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:29:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:29:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:29:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:29:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:29:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:29:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:29:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:29:42,720 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:29:42,865 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:29:42,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:29:43,238 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:29:43,342 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:29:43,342 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:29:43,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:43 BoogieIcfgContainer [2023-08-31 23:29:43,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:29:43,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:29:43,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:29:43,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:29:43,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:29:42" (1/3) ... [2023-08-31 23:29:43,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c4c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:43, skipping insertion in model container [2023-08-31 23:29:43,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:42" (2/3) ... [2023-08-31 23:29:43,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c4c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:43, skipping insertion in model container [2023-08-31 23:29:43,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:43" (3/3) ... [2023-08-31 23:29:43,349 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:29:43,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:29:43,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:29:43,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:29:43,401 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:29:43,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:29:43,455 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:29:43,455 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:43,459 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-31 23:29:43,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:29:43,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:43,464 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:29:43,470 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:43,472 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:43,493 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:29:43,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:43,494 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-31 23:29:43,495 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-31 23:29:46,466 INFO L134 LiptonReduction]: Checked pairs total: 6029 [2023-08-31 23:29:46,466 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-31 23:29:46,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:29:46,489 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;@5326f15b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:29:46,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:29:46,490 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:29:46,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:46,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:46,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:29:46,491 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-31 23:29:46,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 582, now seen corresponding path program 1 times [2023-08-31 23:29:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818551786] [2023-08-31 23:29:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:46,578 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-31 23:29:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818551786] [2023-08-31 23:29:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818551786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:29:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137453212] [2023-08-31 23:29:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:29:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:29:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:29:46,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2023-08-31 23:29:46,602 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-31 23:29:46,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:46,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2023-08-31 23:29:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:46,971 INFO L130 PetriNetUnfolder]: 1616/2377 cut-off events. [2023-08-31 23:29:46,971 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-31 23:29:46,976 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-31 23:29:46,985 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:29:46,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-31 23:29:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:29:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:29:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-31 23:29:46,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2023-08-31 23:29:46,998 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-31 23:29:46,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-31 23:29:46,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:47,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-31 23:29:47,002 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-31 23:29:47,005 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-31 23:29:47,005 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-31 23:29:47,006 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 236 transitions. [2023-08-31 23:29:47,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-31 23:29:47,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:29:47,009 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:29:47,010 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-31 23:29:47,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:29:47,013 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:29:47,013 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-31 23:29:47,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:47,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:29:47,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:29:47,014 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-31 23:29:47,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 574321, now seen corresponding path program 1 times [2023-08-31 23:29:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892464170] [2023-08-31 23:29:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:47,183 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-31 23:29:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892464170] [2023-08-31 23:29:47,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892464170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:47,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:47,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:29:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329265895] [2023-08-31 23:29:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:29:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:29:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:29:47,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 228 [2023-08-31 23:29:47,188 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-31 23:29:47,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:47,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 228 [2023-08-31 23:29:47,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:47,403 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events. [2023-08-31 23:29:47,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:47,405 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-31 23:29:47,409 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:29:47,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2023-08-31 23:29:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:29:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:29:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-31 23:29:47,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058479532163743 [2023-08-31 23:29:47,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-31 23:29:47,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-31 23:29:47,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:47,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-31 23:29:47,413 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-31 23:29:47,415 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-31 23:29:47,415 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-31 23:29:47,415 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 346 transitions. [2023-08-31 23:29:47,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2023-08-31 23:29:47,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:29:47,416 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-31 23:29:47,417 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-31 23:29:47,417 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:29:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-31 23:29:47,418 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-31 23:29:47,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:47,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:47,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:29:47,418 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-31 23:29:47,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 993790741, now seen corresponding path program 1 times [2023-08-31 23:29:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146855668] [2023-08-31 23:29:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:48,178 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-31 23:29:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146855668] [2023-08-31 23:29:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146855668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:48,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646908578] [2023-08-31 23:29:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:48,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:48,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 228 [2023-08-31 23:29:48,230 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-31 23:29:48,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:48,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 228 [2023-08-31 23:29:48,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:48,556 INFO L130 PetriNetUnfolder]: 1183/1759 cut-off events. [2023-08-31 23:29:48,556 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-31 23:29:48,558 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-31 23:29:48,563 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 43 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-31 23:29:48,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 212 flow [2023-08-31 23:29:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2023-08-31 23:29:48,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2023-08-31 23:29:48,565 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2023-08-31 23:29:48,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2023-08-31 23:29:48,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:48,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2023-08-31 23:29:48,567 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-31 23:29:48,569 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-31 23:29:48,569 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-31 23:29:48,569 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 520 transitions. [2023-08-31 23:29:48,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 212 flow [2023-08-31 23:29:48,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:48,570 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 86 flow [2023-08-31 23:29:48,571 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-31 23:29:48,571 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-31 23:29:48,571 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 86 flow [2023-08-31 23:29:48,571 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-31 23:29:48,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:48,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:48,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:29:48,572 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-31 23:29:48,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 993790792, now seen corresponding path program 1 times [2023-08-31 23:29:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076852914] [2023-08-31 23:29:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:48,818 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-31 23:29:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076852914] [2023-08-31 23:29:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076852914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:48,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:48,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695069034] [2023-08-31 23:29:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:48,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 228 [2023-08-31 23:29:48,948 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-31 23:29:48,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:48,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 228 [2023-08-31 23:29:48,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:49,152 INFO L130 PetriNetUnfolder]: 935/1427 cut-off events. [2023-08-31 23:29:49,153 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES. [2023-08-31 23:29:49,154 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-31 23:29:49,158 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 35 selfloop transitions, 4 changer transitions 2/43 dead transitions. [2023-08-31 23:29:49,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 202 flow [2023-08-31 23:29:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-08-31 23:29:49,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4203216374269006 [2023-08-31 23:29:49,160 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-08-31 23:29:49,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-08-31 23:29:49,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:49,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-08-31 23:29:49,161 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-31 23:29:49,163 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-31 23:29:49,164 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-31 23:29:49,164 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 86 flow. Second operand 6 states and 575 transitions. [2023-08-31 23:29:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 202 flow [2023-08-31 23:29:49,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:49,166 INFO L231 Difference]: Finished difference. Result has 41 places, 22 transitions, 68 flow [2023-08-31 23:29:49,166 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-31 23:29:49,166 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-31 23:29:49,166 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 22 transitions, 68 flow [2023-08-31 23:29:49,167 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-31 23:29:49,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:49,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:29:49,167 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-31 23:29:49,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash 741340173, now seen corresponding path program 1 times [2023-08-31 23:29:49,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:49,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662919502] [2023-08-31 23:29:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:49,302 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-31 23:29:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662919502] [2023-08-31 23:29:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662919502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:29:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989403062] [2023-08-31 23:29:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:49,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2023-08-31 23:29:49,308 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-31 23:29:49,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:49,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2023-08-31 23:29:49,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:49,481 INFO L130 PetriNetUnfolder]: 831/1358 cut-off events. [2023-08-31 23:29:49,482 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES. [2023-08-31 23:29:49,483 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-31 23:29:49,486 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 29 selfloop transitions, 2 changer transitions 16/49 dead transitions. [2023-08-31 23:29:49,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 230 flow [2023-08-31 23:29:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-31 23:29:49,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157894736842105 [2023-08-31 23:29:49,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:49,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,489 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-31 23:29:49,490 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-31 23:29:49,491 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-31 23:29:49,491 INFO L175 Difference]: Start difference. First operand has 41 places, 22 transitions, 68 flow. Second operand 5 states and 549 transitions. [2023-08-31 23:29:49,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 230 flow [2023-08-31 23:29:49,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 211 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-31 23:29:49,493 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 67 flow [2023-08-31 23:29:49,493 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-31 23:29:49,494 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-31 23:29:49,494 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 67 flow [2023-08-31 23:29:49,494 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-31 23:29:49,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:49,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:49,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:29:49,494 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-31 23:29:49,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1506699646, now seen corresponding path program 1 times [2023-08-31 23:29:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472274947] [2023-08-31 23:29:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:49,626 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-31 23:29:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:49,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472274947] [2023-08-31 23:29:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472274947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:29:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076398014] [2023-08-31 23:29:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:49,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 228 [2023-08-31 23:29:49,631 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-31 23:29:49,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:49,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 228 [2023-08-31 23:29:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:49,809 INFO L130 PetriNetUnfolder]: 745/1154 cut-off events. [2023-08-31 23:29:49,809 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-08-31 23:29:49,811 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-31 23:29:49,814 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-08-31 23:29:49,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 203 flow [2023-08-31 23:29:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-31 23:29:49,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157894736842105 [2023-08-31 23:29:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:49,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-31 23:29:49,817 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-31 23:29:49,819 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-31 23:29:49,819 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-31 23:29:49,819 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 67 flow. Second operand 5 states and 549 transitions. [2023-08-31 23:29:49,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 203 flow [2023-08-31 23:29:49,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 193 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:29:49,821 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 71 flow [2023-08-31 23:29:49,821 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-31 23:29:49,822 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-31 23:29:49,822 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 71 flow [2023-08-31 23:29:49,822 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-31 23:29:49,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:49,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:49,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:29:49,822 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-31 23:29:49,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1337780706, now seen corresponding path program 1 times [2023-08-31 23:29:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198012348] [2023-08-31 23:29:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:50,362 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-31 23:29:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198012348] [2023-08-31 23:29:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198012348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:50,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:50,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106937445] [2023-08-31 23:29:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:50,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:50,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 228 [2023-08-31 23:29:50,396 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-31 23:29:50,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:50,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 228 [2023-08-31 23:29:50,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:50,649 INFO L130 PetriNetUnfolder]: 1147/1805 cut-off events. [2023-08-31 23:29:50,649 INFO L131 PetriNetUnfolder]: For 540/540 co-relation queries the response was YES. [2023-08-31 23:29:50,651 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-31 23:29:50,654 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 38 selfloop transitions, 3 changer transitions 19/61 dead transitions. [2023-08-31 23:29:50,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 298 flow [2023-08-31 23:29:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2023-08-31 23:29:50,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883040935672514 [2023-08-31 23:29:50,656 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 614 transitions. [2023-08-31 23:29:50,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 614 transitions. [2023-08-31 23:29:50,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:50,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 614 transitions. [2023-08-31 23:29:50,658 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-31 23:29:50,659 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-31 23:29:50,659 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-31 23:29:50,659 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 71 flow. Second operand 6 states and 614 transitions. [2023-08-31 23:29:50,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 298 flow [2023-08-31 23:29:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 276 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-31 23:29:50,664 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 77 flow [2023-08-31 23:29:50,664 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-31 23:29:50,664 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:29:50,664 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 77 flow [2023-08-31 23:29:50,665 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-31 23:29:50,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:50,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:50,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:29:50,665 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-31 23:29:50,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1097594989, now seen corresponding path program 1 times [2023-08-31 23:29:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299083186] [2023-08-31 23:29:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:51,366 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-31 23:29:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299083186] [2023-08-31 23:29:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299083186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111379234] [2023-08-31 23:29:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:51,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:29:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:29:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:29:51,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 228 [2023-08-31 23:29:51,417 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-31 23:29:51,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:51,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 228 [2023-08-31 23:29:51,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:51,636 INFO L130 PetriNetUnfolder]: 1033/1592 cut-off events. [2023-08-31 23:29:51,637 INFO L131 PetriNetUnfolder]: For 681/682 co-relation queries the response was YES. [2023-08-31 23:29:51,639 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-31 23:29:51,642 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 35 selfloop transitions, 5 changer transitions 15/56 dead transitions. [2023-08-31 23:29:51,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 279 flow [2023-08-31 23:29:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-31 23:29:51,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2023-08-31 23:29:51,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-31 23:29:51,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-31 23:29:51,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:51,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-31 23:29:51,645 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-31 23:29:51,647 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-31 23:29:51,647 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-31 23:29:51,647 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 77 flow. Second operand 5 states and 516 transitions. [2023-08-31 23:29:51,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 279 flow [2023-08-31 23:29:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 255 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:51,650 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 95 flow [2023-08-31 23:29:51,650 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-31 23:29:51,650 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-31 23:29:51,650 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 95 flow [2023-08-31 23:29:51,651 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-31 23:29:51,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:51,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:51,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:29:51,651 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-31 23:29:51,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -403614193, now seen corresponding path program 2 times [2023-08-31 23:29:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593576335] [2023-08-31 23:29:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:52,047 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-31 23:29:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593576335] [2023-08-31 23:29:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593576335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376898240] [2023-08-31 23:29:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:52,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:29:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:29:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:29:52,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-31 23:29:52,072 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-31 23:29:52,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:52,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-31 23:29:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:52,285 INFO L130 PetriNetUnfolder]: 714/1127 cut-off events. [2023-08-31 23:29:52,285 INFO L131 PetriNetUnfolder]: For 710/711 co-relation queries the response was YES. [2023-08-31 23:29:52,287 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-31 23:29:52,290 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 34 selfloop transitions, 6 changer transitions 20/61 dead transitions. [2023-08-31 23:29:52,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 332 flow [2023-08-31 23:29:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2023-08-31 23:29:52,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-31 23:29:52,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2023-08-31 23:29:52,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2023-08-31 23:29:52,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:52,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2023-08-31 23:29:52,294 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-31 23:29:52,296 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-31 23:29:52,297 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-31 23:29:52,297 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 95 flow. Second operand 6 states and 648 transitions. [2023-08-31 23:29:52,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 332 flow [2023-08-31 23:29:52,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 316 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-31 23:29:52,299 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 131 flow [2023-08-31 23:29:52,300 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-31 23:29:52,300 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-31 23:29:52,300 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 131 flow [2023-08-31 23:29:52,302 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-31 23:29:52,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:52,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:52,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:29:52,302 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-31 23:29:52,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash -296740294, now seen corresponding path program 1 times [2023-08-31 23:29:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788198106] [2023-08-31 23:29:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:53,169 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-31 23:29:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788198106] [2023-08-31 23:29:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788198106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:53,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:29:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768064679] [2023-08-31 23:29:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:53,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:29:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:29:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:29:53,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 228 [2023-08-31 23:29:53,251 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-31 23:29:53,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:53,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 228 [2023-08-31 23:29:53,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:54,083 INFO L130 PetriNetUnfolder]: 976/1550 cut-off events. [2023-08-31 23:29:54,083 INFO L131 PetriNetUnfolder]: For 1767/1767 co-relation queries the response was YES. [2023-08-31 23:29:54,086 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-31 23:29:54,090 INFO L137 encePairwiseOnDemand]: 216/228 looper letters, 56 selfloop transitions, 21 changer transitions 54/132 dead transitions. [2023-08-31 23:29:54,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 132 transitions, 754 flow [2023-08-31 23:29:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 23:29:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 23:29:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1662 transitions. [2023-08-31 23:29:54,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42879256965944273 [2023-08-31 23:29:54,095 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1662 transitions. [2023-08-31 23:29:54,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1662 transitions. [2023-08-31 23:29:54,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:54,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1662 transitions. [2023-08-31 23:29:54,098 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-31 23:29:54,102 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-31 23:29:54,103 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-31 23:29:54,103 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 131 flow. Second operand 17 states and 1662 transitions. [2023-08-31 23:29:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 132 transitions, 754 flow [2023-08-31 23:29:54,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 132 transitions, 705 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-31 23:29:54,109 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 282 flow [2023-08-31 23:29:54,110 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-31 23:29:54,111 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-31 23:29:54,111 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 282 flow [2023-08-31 23:29:54,111 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-31 23:29:54,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:54,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:29:54,112 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-31 23:29:54,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1185252435, now seen corresponding path program 1 times [2023-08-31 23:29:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220561233] [2023-08-31 23:29:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:54,530 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-31 23:29:54,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:54,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220561233] [2023-08-31 23:29:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220561233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:54,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434267845] [2023-08-31 23:29:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:54,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:54,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:54,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-31 23:29:54,553 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-31 23:29:54,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:54,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-31 23:29:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:54,809 INFO L130 PetriNetUnfolder]: 641/1038 cut-off events. [2023-08-31 23:29:54,810 INFO L131 PetriNetUnfolder]: For 4442/4442 co-relation queries the response was YES. [2023-08-31 23:29:54,812 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-31 23:29:54,819 INFO L137 encePairwiseOnDemand]: 218/228 looper letters, 43 selfloop transitions, 19 changer transitions 12/75 dead transitions. [2023-08-31 23:29:54,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 605 flow [2023-08-31 23:29:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions. [2023-08-31 23:29:54,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-08-31 23:29:54,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions. [2023-08-31 23:29:54,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions. [2023-08-31 23:29:54,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:54,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions. [2023-08-31 23:29:54,823 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-31 23:29:54,825 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-31 23:29:54,825 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-31 23:29:54,825 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 282 flow. Second operand 7 states and 741 transitions. [2023-08-31 23:29:54,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 605 flow [2023-08-31 23:29:54,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 564 flow, removed 18 selfloop flow, removed 10 redundant places. [2023-08-31 23:29:54,834 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 386 flow [2023-08-31 23:29:54,834 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-31 23:29:54,834 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-31 23:29:54,835 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 386 flow [2023-08-31 23:29:54,835 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-31 23:29:54,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:54,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:54,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:29:54,835 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-31 23:29:54,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -165516466, now seen corresponding path program 1 times [2023-08-31 23:29:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423461794] [2023-08-31 23:29:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:55,803 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-31 23:29:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423461794] [2023-08-31 23:29:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423461794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:29:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170710647] [2023-08-31 23:29:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:29:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:29:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:29:55,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 228 [2023-08-31 23:29:55,879 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-31 23:29:55,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:55,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 228 [2023-08-31 23:29:55,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:56,493 INFO L130 PetriNetUnfolder]: 779/1279 cut-off events. [2023-08-31 23:29:56,494 INFO L131 PetriNetUnfolder]: For 3766/3766 co-relation queries the response was YES. [2023-08-31 23:29:56,497 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-31 23:29:56,499 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 43 selfloop transitions, 15 changer transitions 45/104 dead transitions. [2023-08-31 23:29:56,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 885 flow [2023-08-31 23:29:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:29:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:29:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1228 transitions. [2023-08-31 23:29:56,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883040935672514 [2023-08-31 23:29:56,503 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1228 transitions. [2023-08-31 23:29:56,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1228 transitions. [2023-08-31 23:29:56,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:56,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1228 transitions. [2023-08-31 23:29:56,506 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-31 23:29:56,509 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-31 23:29:56,510 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-31 23:29:56,510 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 386 flow. Second operand 12 states and 1228 transitions. [2023-08-31 23:29:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 885 flow [2023-08-31 23:29:56,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 843 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-31 23:29:56,519 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 329 flow [2023-08-31 23:29:56,519 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-31 23:29:56,520 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-08-31 23:29:56,521 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 329 flow [2023-08-31 23:29:56,521 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-31 23:29:56,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:56,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:29:56,522 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-31 23:29:56,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -248928383, now seen corresponding path program 2 times [2023-08-31 23:29:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586452125] [2023-08-31 23:29:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:56,714 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-31 23:29:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586452125] [2023-08-31 23:29:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586452125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:56,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788534430] [2023-08-31 23:29:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:56,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:56,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:56,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-31 23:29:56,724 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-31 23:29:56,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:56,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-31 23:29:56,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:56,844 INFO L130 PetriNetUnfolder]: 293/524 cut-off events. [2023-08-31 23:29:56,844 INFO L131 PetriNetUnfolder]: For 3372/3375 co-relation queries the response was YES. [2023-08-31 23:29:56,845 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-31 23:29:56,849 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 40 selfloop transitions, 4 changer transitions 33/79 dead transitions. [2023-08-31 23:29:56,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 860 flow [2023-08-31 23:29:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 23:29:56,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745614035087719 [2023-08-31 23:29:56,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 23:29:56,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 23:29:56,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:56,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 23:29:56,852 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-31 23:29:56,853 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-31 23:29:56,853 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-31 23:29:56,853 INFO L175 Difference]: Start difference. First operand has 72 places, 37 transitions, 329 flow. Second operand 5 states and 541 transitions. [2023-08-31 23:29:56,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 860 flow [2023-08-31 23:29:56,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 745 flow, removed 30 selfloop flow, removed 16 redundant places. [2023-08-31 23:29:56,857 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 253 flow [2023-08-31 23:29:56,857 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-31 23:29:56,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-31 23:29:56,858 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 253 flow [2023-08-31 23:29:56,858 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-31 23:29:56,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:56,859 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-31 23:29:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:29:56,859 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-31 23:29:56,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1058050121, now seen corresponding path program 1 times [2023-08-31 23:29:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:56,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634390113] [2023-08-31 23:29:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:57,053 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-31 23:29:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634390113] [2023-08-31 23:29:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634390113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:57,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033418712] [2023-08-31 23:29:57,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:57,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:57,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-31 23:29:57,064 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-31 23:29:57,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:57,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-31 23:29:57,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:57,189 INFO L130 PetriNetUnfolder]: 147/295 cut-off events. [2023-08-31 23:29:57,190 INFO L131 PetriNetUnfolder]: For 1311/1312 co-relation queries the response was YES. [2023-08-31 23:29:57,190 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-31 23:29:57,192 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 44 selfloop transitions, 7 changer transitions 25/78 dead transitions. [2023-08-31 23:29:57,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 767 flow [2023-08-31 23:29:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2023-08-31 23:29:57,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47149122807017546 [2023-08-31 23:29:57,194 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions. [2023-08-31 23:29:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions. [2023-08-31 23:29:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:57,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions. [2023-08-31 23:29:57,196 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-31 23:29:57,197 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-31 23:29:57,197 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-31 23:29:57,198 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 253 flow. Second operand 6 states and 645 transitions. [2023-08-31 23:29:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 767 flow [2023-08-31 23:29:57,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 745 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:57,201 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 295 flow [2023-08-31 23:29:57,201 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-31 23:29:57,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-31 23:29:57,202 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 295 flow [2023-08-31 23:29:57,202 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-31 23:29:57,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:57,202 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-31 23:29:57,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:29:57,203 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-31 23:29:57,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1706966367, now seen corresponding path program 1 times [2023-08-31 23:29:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77418084] [2023-08-31 23:29:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:57,427 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-31 23:29:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77418084] [2023-08-31 23:29:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77418084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304845936] [2023-08-31 23:29:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:57,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:57,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-31 23:29:57,440 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-31 23:29:57,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:57,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-31 23:29:57,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:57,534 INFO L130 PetriNetUnfolder]: 88/185 cut-off events. [2023-08-31 23:29:57,534 INFO L131 PetriNetUnfolder]: For 826/827 co-relation queries the response was YES. [2023-08-31 23:29:57,535 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-31 23:29:57,535 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 41 selfloop transitions, 10 changer transitions 12/65 dead transitions. [2023-08-31 23:29:57,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 658 flow [2023-08-31 23:29:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 735 transitions. [2023-08-31 23:29:57,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2023-08-31 23:29:57,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 735 transitions. [2023-08-31 23:29:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 735 transitions. [2023-08-31 23:29:57,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:57,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 735 transitions. [2023-08-31 23:29:57,539 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-31 23:29:57,540 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-31 23:29:57,541 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-31 23:29:57,541 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 295 flow. Second operand 7 states and 735 transitions. [2023-08-31 23:29:57,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 658 flow [2023-08-31 23:29:57,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 568 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:57,544 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 267 flow [2023-08-31 23:29:57,544 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-31 23:29:57,544 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-31 23:29:57,544 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 267 flow [2023-08-31 23:29:57,545 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-31 23:29:57,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:57,545 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-31 23:29:57,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:29:57,545 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-31 23:29:57,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 710784996, now seen corresponding path program 1 times [2023-08-31 23:29:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6803809] [2023-08-31 23:29:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:57,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:29:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:57,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:29:57,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:29:57,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:29:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:29:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:29:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:29:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:29:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:29:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:29:57,678 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:57,681 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:29:57,681 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:29:57,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:29:57 BasicIcfg [2023-08-31 23:29:57,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:29:57,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:29:57,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:29:57,742 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:29:57,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:43" (3/4) ... [2023-08-31 23:29:57,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:29:57,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:29:57,744 INFO L158 Benchmark]: Toolchain (without parser) took 15604.64ms. Allocated memory was 67.1MB in the beginning and 587.2MB in the end (delta: 520.1MB). Free memory was 43.4MB in the beginning and 244.9MB in the end (delta: -201.6MB). Peak memory consumption was 318.7MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,745 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:57,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.57ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 34.6MB in the end (delta: 8.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 67.1MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,745 INFO L158 Benchmark]: Boogie Preprocessor took 46.94ms. Allocated memory is still 67.1MB. Free memory was 31.7MB in the beginning and 29.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,746 INFO L158 Benchmark]: RCFGBuilder took 707.64ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 46.1MB in the end (delta: -16.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,746 INFO L158 Benchmark]: TraceAbstraction took 14396.12ms. Allocated memory was 81.8MB in the beginning and 587.2MB in the end (delta: 505.4MB). Free memory was 45.2MB in the beginning and 244.9MB in the end (delta: -199.7MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. [2023-08-31 23:29:57,746 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 587.2MB. Free memory is still 244.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:57,747 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.12ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.57ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 34.6MB in the end (delta: 8.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 67.1MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.94ms. Allocated memory is still 67.1MB. Free memory was 31.7MB in the beginning and 29.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.64ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 46.1MB in the end (delta: -16.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14396.12ms. Allocated memory was 81.8MB in the beginning and 587.2MB in the end (delta: 505.4MB). Free memory was 45.2MB in the beginning and 244.9MB in the end (delta: -199.7MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 587.2MB. Free memory is still 244.9MB. 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.0s, 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: 14.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1061 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 868 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 1.7s 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.4s 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-31 23:29:57,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:29:59,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:29:59,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:29:59,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:29:59,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:29:59,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:29:59,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:29:59,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:29:59,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:29:59,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:29:59,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:29:59,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:29:59,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:29:59,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:29:59,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:29:59,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:29:59,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:29:59,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:29:59,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:29:59,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:29:59,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:29:59,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:29:59,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:29:59,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:29:59,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:29:59,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:29:59,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:29:59,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:29:59,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:29:59,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:29:59,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:29:59,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:29:59,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:29:59,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:29:59,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:29:59,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:29:59,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:29:59,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:29:59,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:29:59,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:29:59,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:29:59,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:29:59,616 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:29:59,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:29:59,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:29:59,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:29:59,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:29:59,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:29:59,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:29:59,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:29:59,619 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:29:59,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:29:59,620 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:29:59,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:29:59,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:29:59,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:29:59,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:29:59,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:29:59,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:59,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:29:59,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:29:59,623 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:29:59,623 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:29:59,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:29:59,624 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:29:59,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:29:59,624 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:29:59,624 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:29:59,624 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 -> BEFORE [2023-08-31 23:29:59,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:29:59,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:29:59,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:29:59,981 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:29:59,982 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:29:59,982 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-31 23:30:01,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:30:01,318 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:30:01,318 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-31 23:30:01,331 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced3ed52e/25ec9f1992c6474c95302c5b4cdbfa84/FLAGa16ede4d9 [2023-08-31 23:30:01,347 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced3ed52e/25ec9f1992c6474c95302c5b4cdbfa84 [2023-08-31 23:30:01,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:30:01,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:30:01,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:30:01,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:30:01,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:30:01,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26625e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01, skipping insertion in model container [2023-08-31 23:30:01,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:30:01,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:30:01,541 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-31 23:30:01,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:30:01,706 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:30:01,715 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-31 23:30:01,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:30:01,787 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:30:01,787 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:30:01,791 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:30:01,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01 WrapperNode [2023-08-31 23:30:01,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:30:01,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:30:01,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:30:01,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:30:01,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,830 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:30:01,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:30:01,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:30:01,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:30:01,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:30:01,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,849 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:30:01,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:30:01,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:30:01,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:30:01,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (1/1) ... [2023-08-31 23:30:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:30:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:30:01,876 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-31 23:30:01,887 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-31 23:30:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:30:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:30:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:30:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:30:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:30:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:30:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:30:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:30:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:30:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:30:01,904 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:30:02,023 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:30:02,025 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:30:02,433 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:30:02,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:30:02,580 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:30:02,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:02 BoogieIcfgContainer [2023-08-31 23:30:02,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:30:02,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:30:02,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:30:02,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:30:02,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:30:01" (1/3) ... [2023-08-31 23:30:02,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f45ec1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:30:02, skipping insertion in model container [2023-08-31 23:30:02,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:01" (2/3) ... [2023-08-31 23:30:02,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f45ec1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:30:02, skipping insertion in model container [2023-08-31 23:30:02,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:02" (3/3) ... [2023-08-31 23:30:02,587 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:30:02,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:30:02,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:30:02,598 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:30:02,644 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:30:02,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:30:02,715 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:30:02,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:02,719 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-31 23:30:02,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:30:02,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-31 23:30:02,725 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:30:02,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:30:02,736 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:30:02,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-31 23:30:02,764 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:30:02,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:02,765 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-31 23:30:02,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-31 23:30:07,464 INFO L134 LiptonReduction]: Checked pairs total: 5574 [2023-08-31 23:30:07,464 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-31 23:30:07,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:30:07,499 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;@771e2803, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:30:07,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:30:07,504 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:30:07,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:07,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:07,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:30:07,505 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-31 23:30:07,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-31 23:30:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075571176] [2023-08-31 23:30:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:07,518 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-31 23:30:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:07,521 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-31 23:30:07,603 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-31 23:30:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:07,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:30:07,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:07,648 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-31 23:30:07,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:07,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:07,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075571176] [2023-08-31 23:30:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075571176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:30:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706225107] [2023-08-31 23:30:07,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:07,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:30:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:30:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:30:07,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-31 23:30:07,674 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-31 23:30:07,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:07,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-31 23:30:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:08,035 INFO L130 PetriNetUnfolder]: 1616/2372 cut-off events. [2023-08-31 23:30:08,036 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-31 23:30:08,039 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-31 23:30:08,046 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:30:08,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-31 23:30:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:30:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:30:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-31 23:30:08,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-08-31 23:30:08,055 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-31 23:30:08,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-31 23:30:08,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:08,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-31 23:30:08,059 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-31 23:30:08,061 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-31 23:30:08,062 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-31 23:30:08,063 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 238 transitions. [2023-08-31 23:30:08,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-31 23:30:08,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:08,066 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:30:08,067 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-31 23:30:08,069 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:30:08,069 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:30:08,069 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-31 23:30:08,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:08,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:30:08,076 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 (2)] Ended with exit code 0 [2023-08-31 23:30:08,275 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-31 23:30:08,276 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-31 23:30:08,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 578229, now seen corresponding path program 1 times [2023-08-31 23:30:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:08,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590139321] [2023-08-31 23:30:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:08,277 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-31 23:30:08,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:08,278 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-31 23:30:08,280 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-31 23:30:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:08,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:30:08,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:08,354 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-31 23:30:08,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:08,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590139321] [2023-08-31 23:30:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590139321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738348918] [2023-08-31 23:30:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:08,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-31 23:30:08,359 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-31 23:30:08,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:08,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-31 23:30:08,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:08,549 INFO L130 PetriNetUnfolder]: 1263/2015 cut-off events. [2023-08-31 23:30:08,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:08,551 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-31 23:30:08,555 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:30:08,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2023-08-31 23:30:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-31 23:30:08,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014367816091954 [2023-08-31 23:30:08,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-31 23:30:08,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-31 23:30:08,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:08,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-31 23:30:08,569 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-31 23:30:08,571 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-31 23:30:08,571 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-31 23:30:08,571 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 349 transitions. [2023-08-31 23:30:08,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2023-08-31 23:30:08,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:30:08,573 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-31 23:30:08,573 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-31 23:30:08,574 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:30:08,574 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-31 23:30:08,574 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-31 23:30:08,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:08,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:08,581 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-31 23:30:08,777 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-31 23:30:08,778 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-31 23:30:08,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1132145577, now seen corresponding path program 1 times [2023-08-31 23:30:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557604800] [2023-08-31 23:30:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:08,780 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-31 23:30:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:08,781 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-31 23:30:08,783 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-31 23:30:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:08,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:30:08,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:08,884 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-31 23:30:08,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:08,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557604800] [2023-08-31 23:30:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557604800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138273186] [2023-08-31 23:30:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:08,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:08,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:08,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-31 23:30:08,903 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-31 23:30:08,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:08,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-31 23:30:08,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:09,112 INFO L130 PetriNetUnfolder]: 679/1105 cut-off events. [2023-08-31 23:30:09,112 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-31 23:30:09,114 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-31 23:30:09,116 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 31 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-08-31 23:30:09,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 248 flow [2023-08-31 23:30:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-31 23:30:09,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47672413793103446 [2023-08-31 23:30:09,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-31 23:30:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-31 23:30:09,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:09,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-31 23:30:09,121 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-31 23:30:09,123 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-31 23:30:09,123 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-31 23:30:09,124 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 553 transitions. [2023-08-31 23:30:09,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 248 flow [2023-08-31 23:30:09,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:09,125 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-31 23:30:09,125 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-31 23:30:09,126 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-31 23:30:09,126 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-31 23:30:09,126 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-31 23:30:09,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:09,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:09,137 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 (4)] Ended with exit code 0 [2023-08-31 23:30:09,337 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-31 23:30:09,337 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-31 23:30:09,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash 629998256, now seen corresponding path program 1 times [2023-08-31 23:30:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050496717] [2023-08-31 23:30:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:09,338 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-31 23:30:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:09,339 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-31 23:30:09,353 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-31 23:30:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:09,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:30:09,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:09,464 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-31 23:30:09,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:09,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050496717] [2023-08-31 23:30:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050496717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:30:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092337420] [2023-08-31 23:30:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:09,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:09,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-31 23:30:09,480 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-31 23:30:09,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:09,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-31 23:30:09,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:09,674 INFO L130 PetriNetUnfolder]: 274/498 cut-off events. [2023-08-31 23:30:09,675 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2023-08-31 23:30:09,676 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-31 23:30:09,677 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 40 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-08-31 23:30:09,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 356 flow [2023-08-31 23:30:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:30:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:30:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions. [2023-08-31 23:30:09,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2023-08-31 23:30:09,679 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions. [2023-08-31 23:30:09,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions. [2023-08-31 23:30:09,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:09,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions. [2023-08-31 23:30:09,680 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-31 23:30:09,682 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-31 23:30:09,682 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-31 23:30:09,682 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 664 transitions. [2023-08-31 23:30:09,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 356 flow [2023-08-31 23:30:09,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:09,685 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-31 23:30:09,686 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-31 23:30:09,687 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:30:09,687 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-31 23:30:09,687 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-31 23:30:09,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:09,687 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-31 23:30:09,711 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 (5)] Ended with exit code 0 [2023-08-31 23:30:09,894 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-31 23:30:09,895 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-31 23:30:09,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash -875696159, now seen corresponding path program 1 times [2023-08-31 23:30:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230253624] [2023-08-31 23:30:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:09,896 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-31 23:30:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:09,909 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-31 23:30:09,922 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-31 23:30:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:10,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:30:10,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:10,052 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-31 23:30:10,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:10,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230253624] [2023-08-31 23:30:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230253624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:30:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479658337] [2023-08-31 23:30:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:30:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:30:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:30:10,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-31 23:30:10,077 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-31 23:30:10,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:10,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-31 23:30:10,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:10,321 INFO L130 PetriNetUnfolder]: 168/309 cut-off events. [2023-08-31 23:30:10,321 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-31 23:30:10,322 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-31 23:30:10,322 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 37 selfloop transitions, 10 changer transitions 11/60 dead transitions. [2023-08-31 23:30:10,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 350 flow [2023-08-31 23:30:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:30:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:30:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2023-08-31 23:30:10,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46366995073891626 [2023-08-31 23:30:10,324 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2023-08-31 23:30:10,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2023-08-31 23:30:10,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:10,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2023-08-31 23:30:10,326 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-31 23:30:10,328 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-31 23:30:10,328 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-31 23:30:10,329 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 753 transitions. [2023-08-31 23:30:10,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 350 flow [2023-08-31 23:30:10,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:30:10,331 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-31 23:30:10,331 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-31 23:30:10,332 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-31 23:30:10,332 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-31 23:30:10,332 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-31 23:30:10,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:10,332 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-31 23:30:10,342 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-31 23:30:10,542 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-31 23:30:10,542 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-31 23:30:10,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1641938106, now seen corresponding path program 1 times [2023-08-31 23:30:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224755824] [2023-08-31 23:30:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:10,543 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-31 23:30:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:10,544 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-31 23:30:10,545 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-31 23:30:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:10,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-31 23:30:10,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:11,284 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-31 23:30:11,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:11,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224755824] [2023-08-31 23:30:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224755824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:11,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:30:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130374238] [2023-08-31 23:30:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:11,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:30:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:30:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:30:11,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-31 23:30:11,378 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-31 23:30:11,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:11,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-31 23:30:11,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:11,649 INFO L130 PetriNetUnfolder]: 286/551 cut-off events. [2023-08-31 23:30:11,649 INFO L131 PetriNetUnfolder]: For 692/692 co-relation queries the response was YES. [2023-08-31 23:30:11,650 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-31 23:30:11,652 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 75 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-31 23:30:11,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 618 flow [2023-08-31 23:30:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:30:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:30:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions. [2023-08-31 23:30:11,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492337164750958 [2023-08-31 23:30:11,654 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions. [2023-08-31 23:30:11,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions. [2023-08-31 23:30:11,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:11,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions. [2023-08-31 23:30:11,656 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-31 23:30:11,658 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-31 23:30:11,659 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-31 23:30:11,659 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 9 states and 938 transitions. [2023-08-31 23:30:11,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 618 flow [2023-08-31 23:30:11,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 496 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-31 23:30:11,662 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 157 flow [2023-08-31 23:30:11,662 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-31 23:30:11,662 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-31 23:30:11,663 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 157 flow [2023-08-31 23:30:11,663 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-31 23:30:11,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:11,663 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-31 23:30:11,692 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-31 23:30:11,871 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-31 23:30:11,871 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-31 23:30:11,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash 606892096, now seen corresponding path program 1 times [2023-08-31 23:30:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988966956] [2023-08-31 23:30:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:11,872 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-31 23:30:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:11,873 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-31 23:30:11,918 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-31 23:30:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:12,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:30:12,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:12,201 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-31 23:30:12,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:12,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988966956] [2023-08-31 23:30:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988966956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738680081] [2023-08-31 23:30:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:12,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:12,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 232 [2023-08-31 23:30:12,307 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-31 23:30:12,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:12,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 232 [2023-08-31 23:30:12,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:12,454 INFO L130 PetriNetUnfolder]: 269/502 cut-off events. [2023-08-31 23:30:12,454 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-31 23:30:12,455 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-31 23:30:12,456 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 37 selfloop transitions, 3 changer transitions 4/47 dead transitions. [2023-08-31 23:30:12,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 302 flow [2023-08-31 23:30:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2023-08-31 23:30:12,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4051724137931034 [2023-08-31 23:30:12,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 470 transitions. [2023-08-31 23:30:12,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 470 transitions. [2023-08-31 23:30:12,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:12,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 470 transitions. [2023-08-31 23:30:12,459 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-31 23:30:12,460 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-31 23:30:12,460 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-31 23:30:12,460 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 157 flow. Second operand 5 states and 470 transitions. [2023-08-31 23:30:12,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 302 flow [2023-08-31 23:30:12,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:12,463 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 149 flow [2023-08-31 23:30:12,463 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-31 23:30:12,463 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-31 23:30:12,463 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 149 flow [2023-08-31 23:30:12,464 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-31 23:30:12,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:12,464 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-31 23:30:12,472 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-31 23:30:12,671 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-31 23:30:12,671 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-31 23:30:12,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1943436492, now seen corresponding path program 2 times [2023-08-31 23:30:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309349157] [2023-08-31 23:30:12,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:30:12,672 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-31 23:30:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:12,673 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-31 23:30:12,675 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-31 23:30:12,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:30:12,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:12,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:30:12,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:12,970 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-31 23:30:12,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:12,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309349157] [2023-08-31 23:30:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309349157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:12,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:30:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153593936] [2023-08-31 23:30:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:30:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:30:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:30:13,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-31 23:30:13,008 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-31 23:30:13,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:13,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-31 23:30:13,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:13,282 INFO L130 PetriNetUnfolder]: 365/714 cut-off events. [2023-08-31 23:30:13,282 INFO L131 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES. [2023-08-31 23:30:13,283 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-31 23:30:13,285 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 45 selfloop transitions, 7 changer transitions 45/98 dead transitions. [2023-08-31 23:30:13,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 632 flow [2023-08-31 23:30:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:30:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:30:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 836 transitions. [2023-08-31 23:30:13,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504310344827586 [2023-08-31 23:30:13,287 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 836 transitions. [2023-08-31 23:30:13,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 836 transitions. [2023-08-31 23:30:13,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:13,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 836 transitions. [2023-08-31 23:30:13,289 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-31 23:30:13,291 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-31 23:30:13,291 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-31 23:30:13,291 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 149 flow. Second operand 8 states and 836 transitions. [2023-08-31 23:30:13,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 632 flow [2023-08-31 23:30:13,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 617 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-31 23:30:13,296 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 167 flow [2023-08-31 23:30:13,296 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-31 23:30:13,298 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-31 23:30:13,298 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 167 flow [2023-08-31 23:30:13,299 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-31 23:30:13,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:13,299 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-31 23:30:13,322 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 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:30:13,507 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-31 23:30:13,507 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-31 23:30:13,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1023619402, now seen corresponding path program 3 times [2023-08-31 23:30:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105471200] [2023-08-31 23:30:13,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:30:13,511 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-31 23:30:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:13,512 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-31 23:30:13,515 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-31 23:30:13,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:30:13,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:13,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:30:13,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:13,653 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-31 23:30:13,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:13,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105471200] [2023-08-31 23:30:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105471200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:13,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629850168] [2023-08-31 23:30:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:13,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-31 23:30:13,662 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-31 23:30:13,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:13,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-31 23:30:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:13,821 INFO L130 PetriNetUnfolder]: 354/653 cut-off events. [2023-08-31 23:30:13,821 INFO L131 PetriNetUnfolder]: For 1103/1105 co-relation queries the response was YES. [2023-08-31 23:30:13,822 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-31 23:30:13,823 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 3 changer transitions 23/65 dead transitions. [2023-08-31 23:30:13,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 438 flow [2023-08-31 23:30:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 23:30:13,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663793103448276 [2023-08-31 23:30:13,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 23:30:13,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 23:30:13,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:13,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 23:30:13,827 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-31 23:30:13,828 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-31 23:30:13,830 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-31 23:30:13,830 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 167 flow. Second operand 5 states and 541 transitions. [2023-08-31 23:30:13,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 438 flow [2023-08-31 23:30:13,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 408 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-31 23:30:13,833 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 129 flow [2023-08-31 23:30:13,833 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-31 23:30:13,834 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-31 23:30:13,834 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 129 flow [2023-08-31 23:30:13,834 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-31 23:30:13,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:13,834 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-31 23:30:13,844 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-31 23:30:14,042 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-31 23:30:14,042 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-31 23:30:14,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash 581173014, now seen corresponding path program 4 times [2023-08-31 23:30:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506173203] [2023-08-31 23:30:14,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:30:14,043 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-31 23:30:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:14,044 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-31 23:30:14,046 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-31 23:30:14,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:30:14,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:14,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 23:30:14,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:14,375 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-31 23:30:14,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:14,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506173203] [2023-08-31 23:30:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506173203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:30:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188357824] [2023-08-31 23:30:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:30:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:30:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:30:14,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 232 [2023-08-31 23:30:14,393 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-31 23:30:14,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:14,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 232 [2023-08-31 23:30:14,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:14,587 INFO L130 PetriNetUnfolder]: 167/340 cut-off events. [2023-08-31 23:30:14,587 INFO L131 PetriNetUnfolder]: For 491/491 co-relation queries the response was YES. [2023-08-31 23:30:14,588 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-31 23:30:14,589 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 31 selfloop transitions, 4 changer transitions 26/62 dead transitions. [2023-08-31 23:30:14,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 397 flow [2023-08-31 23:30:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:30:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:30:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 644 transitions. [2023-08-31 23:30:14,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46264367816091956 [2023-08-31 23:30:14,591 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 644 transitions. [2023-08-31 23:30:14,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 644 transitions. [2023-08-31 23:30:14,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:14,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 644 transitions. [2023-08-31 23:30:14,592 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-31 23:30:14,593 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-31 23:30:14,594 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-31 23:30:14,594 INFO L175 Difference]: Start difference. First operand has 51 places, 28 transitions, 129 flow. Second operand 6 states and 644 transitions. [2023-08-31 23:30:14,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 397 flow [2023-08-31 23:30:14,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 366 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-31 23:30:14,596 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 130 flow [2023-08-31 23:30:14,596 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-31 23:30:14,596 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-31 23:30:14,596 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 130 flow [2023-08-31 23:30:14,597 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-31 23:30:14,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:14,597 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-31 23:30:14,619 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-31 23:30:14,804 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-31 23:30:14,805 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-31 23:30:14,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1573810658, now seen corresponding path program 5 times [2023-08-31 23:30:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:14,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597645302] [2023-08-31 23:30:14,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:30:14,806 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-31 23:30:14,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:14,806 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-31 23:30:14,808 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-31 23:30:14,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:30:14,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:14,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 23:30:14,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:15,183 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-31 23:30:15,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:15,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597645302] [2023-08-31 23:30:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597645302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:30:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577586138] [2023-08-31 23:30:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:30:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:30:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:30:15,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-31 23:30:15,231 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-31 23:30:15,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:15,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-31 23:30:15,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:15,453 INFO L130 PetriNetUnfolder]: 122/266 cut-off events. [2023-08-31 23:30:15,453 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2023-08-31 23:30:15,453 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-31 23:30:15,454 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 45 selfloop transitions, 6 changer transitions 23/75 dead transitions. [2023-08-31 23:30:15,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 488 flow [2023-08-31 23:30:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:30:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:30:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 821 transitions. [2023-08-31 23:30:15,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423491379310345 [2023-08-31 23:30:15,456 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 821 transitions. [2023-08-31 23:30:15,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 821 transitions. [2023-08-31 23:30:15,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:15,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 821 transitions. [2023-08-31 23:30:15,458 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-31 23:30:15,460 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-31 23:30:15,460 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-31 23:30:15,461 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 130 flow. Second operand 8 states and 821 transitions. [2023-08-31 23:30:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 488 flow [2023-08-31 23:30:15,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 23:30:15,462 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 155 flow [2023-08-31 23:30:15,463 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-31 23:30:15,463 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-31 23:30:15,463 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 155 flow [2023-08-31 23:30:15,463 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-31 23:30:15,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:15,464 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-31 23:30:15,473 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-31 23:30:15,671 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-31 23:30:15,671 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-31 23:30:15,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1393221508, now seen corresponding path program 6 times [2023-08-31 23:30:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159162456] [2023-08-31 23:30:15,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:30:15,672 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-31 23:30:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:15,673 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-31 23:30:15,675 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-31 23:30:15,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:30:15,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:30:15,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:30:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:30:15,888 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:30:15,888 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:30:15,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:30:15,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:30:15,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:30:15,899 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 (13)] Ended with exit code 0 [2023-08-31 23:30:16,091 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-31 23:30:16,092 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:16,096 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:30:16,096 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:30:16,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:30:16 BasicIcfg [2023-08-31 23:30:16,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:30:16,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:30:16,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:30:16,136 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:30:16,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:02" (3/4) ... [2023-08-31 23:30:16,138 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:30:16,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:30:16,138 INFO L158 Benchmark]: Toolchain (without parser) took 14788.60ms. Allocated memory was 65.0MB in the beginning and 323.0MB in the end (delta: 257.9MB). Free memory was 30.4MB in the beginning and 168.7MB in the end (delta: -138.3MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,139 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:30:16,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.73ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 36.2MB in the end (delta: 9.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.60ms. Allocated memory is still 65.0MB. Free memory was 35.9MB in the beginning and 33.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,139 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 65.0MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,139 INFO L158 Benchmark]: RCFGBuilder took 728.60ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.8MB in the beginning and 35.9MB in the end (delta: -5.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,140 INFO L158 Benchmark]: TraceAbstraction took 13552.00ms. Allocated memory was 79.7MB in the beginning and 323.0MB in the end (delta: 243.3MB). Free memory was 35.4MB in the beginning and 169.7MB in the end (delta: -134.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2023-08-31 23:30:16,140 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 323.0MB. Free memory is still 168.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:30:16,141 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 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.73ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 36.2MB in the end (delta: 9.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.60ms. Allocated memory is still 65.0MB. Free memory was 35.9MB in the beginning and 33.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 65.0MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 728.60ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.8MB in the beginning and 35.9MB in the end (delta: -5.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13552.00ms. Allocated memory was 79.7MB in the beginning and 323.0MB in the end (delta: 243.3MB). Free memory was 35.4MB in the beginning and 169.7MB in the end (delta: -134.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 323.0MB. Free memory is still 168.7MB. 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: 4.7s, 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.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.7s 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.7s 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-31 23:30:16,157 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