./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.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/mix014_power.oepc_pso.oepc_rmo.oepc.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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --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:11:50,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:11:50,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:11:50,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:11:50,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:11:50,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:11:50,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:11:50,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:11:50,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:11:50,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:11:50,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:11:50,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:11:50,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:11:50,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:11:50,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:11:50,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:11:50,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:11:50,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:11:50,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:11:50,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:11:50,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:11:50,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:11:50,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:11:50,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:11:50,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:11:50,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:11:50,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:11:50,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:11:50,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:11:50,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:11:50,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:11:50,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:11:50,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:11:50,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:11:50,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:11:50,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:11:50,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:11:50,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:11:50,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:11:50,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:11:50,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:11:50,510 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:11:50,538 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:11:50,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:11:50,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:11:50,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:11:50,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:11:50,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:11:50,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:11:50,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:11:50,541 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:11:50,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:11:50,542 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:11:50,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:11:50,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:11:50,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:11:50,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:11:50,544 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:11:50,544 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:11:50,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:11:50,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:11:50,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:11:50,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:50,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:11:50,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:11:50,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:11:50,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:11:50,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:11:50,545 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:11:50,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:11:50,546 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:11:50,546 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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 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:11:50,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:11:50,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:11:50,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:11:50,836 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:11:50,836 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:11:50,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:51,921 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:11:52,146 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:11:52,147 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:52,164 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00be3adec/5e472a1e644746fd8aa3dc443d22e453/FLAGa4b4748e7 [2023-08-31 23:11:52,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00be3adec/5e472a1e644746fd8aa3dc443d22e453 [2023-08-31 23:11:52,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:11:52,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:11:52,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:52,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:11:52,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:11:52,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6793f286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52, skipping insertion in model container [2023-08-31 23:11:52,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:11:52,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:11:52,367 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:11:52,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:52,552 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:11:52,563 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:11:52,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:52,619 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:52,619 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:52,623 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:11:52,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52 WrapperNode [2023-08-31 23:11:52,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:52,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:52,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:11:52,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:11:52,631 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:11:52" (1/1) ... [2023-08-31 23:11:52,643 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:11:52" (1/1) ... [2023-08-31 23:11:52,661 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:11:52,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:52,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:11:52,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:11:52,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:11:52,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,689 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:11:52,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:11:52,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:11:52,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:11:52,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (1/1) ... [2023-08-31 23:11:52,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:52,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:11:52,721 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:11:52,753 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:11:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:11:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:11:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:11:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:11:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:11:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:11:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:11:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:11:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:11:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:11:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:11:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:11:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:11:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:11:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:11:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:11:52,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:11:52,778 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:11:52,947 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:11:52,949 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:11:53,249 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:11:53,335 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:11:53,336 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:11:53,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:53 BoogieIcfgContainer [2023-08-31 23:11:53,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:11:53,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:11:53,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:11:53,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:11:53,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:11:52" (1/3) ... [2023-08-31 23:11:53,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:53, skipping insertion in model container [2023-08-31 23:11:53,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:52" (2/3) ... [2023-08-31 23:11:53,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:53, skipping insertion in model container [2023-08-31 23:11:53,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:53" (3/3) ... [2023-08-31 23:11:53,344 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:53,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:11:53,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:11:53,355 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:11:53,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:11:53,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:11:53,479 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:11:53,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:53,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:11:53,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:11:53,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:53,506 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:11:53,514 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:53,515 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:53,551 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:11:53,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:11:53,555 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-31 23:11:56,812 INFO L134 LiptonReduction]: Checked pairs total: 11113 [2023-08-31 23:11:56,813 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-31 23:11:56,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:11:56,825 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;@e228d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:11:56,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:11:56,827 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:11:56,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:56,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:56,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:11:56,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:56,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-31 23:11:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195062260] [2023-08-31 23:11:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:56,910 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:11:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195062260] [2023-08-31 23:11:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195062260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:11:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808170921] [2023-08-31 23:11:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:56,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:11:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:11:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:11:56,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-31 23:11:56,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:11:56,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:56,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-31 23:11:56,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:58,000 INFO L130 PetriNetUnfolder]: 8719/11822 cut-off events. [2023-08-31 23:11:58,001 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:11:58,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23770 conditions, 11822 events. 8719/11822 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 63407 event pairs, 8719 based on Foata normal form. 0/10329 useless extension candidates. Maximal degree in co-relation 23758. Up to 11731 conditions per place. [2023-08-31 23:11:58,047 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:11:58,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-31 23:11:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:11:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:11:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:11:58,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2023-08-31 23:11:58,056 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:11:58,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:11:58,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:58,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:11:58,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:11:58,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:11:58,064 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:11:58,065 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:11:58,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-31 23:11:58,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:11:58,069 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-31 23:11:58,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-31 23:11:58,072 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:11:58,072 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-31 23:11:58,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:11:58,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:58,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:11:58,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:11:58,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:58,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash 603375, now seen corresponding path program 1 times [2023-08-31 23:11:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:58,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793145842] [2023-08-31 23:11:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:58,306 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:11:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793145842] [2023-08-31 23:11:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793145842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:11:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161074519] [2023-08-31 23:11:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:58,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:11:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:11:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:11:58,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 282 [2023-08-31 23:11:58,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:11:58,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:58,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 282 [2023-08-31 23:11:58,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:59,192 INFO L130 PetriNetUnfolder]: 6855/9353 cut-off events. [2023-08-31 23:11:59,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18790 conditions, 9353 events. 6855/9353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 48357 event pairs, 3527 based on Foata normal form. 0/8694 useless extension candidates. Maximal degree in co-relation 18787. Up to 7399 conditions per place. [2023-08-31 23:11:59,232 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-31 23:11:59,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-31 23:11:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:11:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:11:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-31 23:11:59,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516548463356974 [2023-08-31 23:11:59,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-31 23:11:59,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-31 23:11:59,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:59,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-31 23:11:59,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:11:59,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:11:59,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:11:59,239 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 437 transitions. [2023-08-31 23:11:59,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-31 23:11:59,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:11:59,240 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-31 23:11:59,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:11:59,241 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-31 23:11:59,241 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-31 23:11:59,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:11:59,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:59,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:11:59,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:59,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -688554600, now seen corresponding path program 1 times [2023-08-31 23:11:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704375075] [2023-08-31 23:11:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:59,445 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:11:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704375075] [2023-08-31 23:11:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704375075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:59,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:11:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590981035] [2023-08-31 23:11:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:59,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:11:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:59,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:11:59,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:11:59,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 282 [2023-08-31 23:11:59,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:11:59,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:59,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 282 [2023-08-31 23:11:59,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:02,113 INFO L130 PetriNetUnfolder]: 28839/38660 cut-off events. [2023-08-31 23:12:02,114 INFO L131 PetriNetUnfolder]: For 1501/1501 co-relation queries the response was YES. [2023-08-31 23:12:02,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79397 conditions, 38660 events. 28839/38660 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 211914 event pairs, 10679 based on Foata normal form. 0/37780 useless extension candidates. Maximal degree in co-relation 79393. Up to 24943 conditions per place. [2023-08-31 23:12:02,241 INFO L137 encePairwiseOnDemand]: 272/282 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2023-08-31 23:12:02,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2023-08-31 23:12:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:12:02,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48699763593380613 [2023-08-31 23:12:02,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:12:02,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:12:02,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:02,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:12:02,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:12:02,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:02,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:02,247 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:12:02,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2023-08-31 23:12:02,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:02,248 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 140 flow [2023-08-31 23:12:02,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-31 23:12:02,249 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-31 23:12:02,249 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 140 flow [2023-08-31 23:12:02,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:12:02,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:02,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:02,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:12:02,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:02,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 129642339, now seen corresponding path program 1 times [2023-08-31 23:12:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413339287] [2023-08-31 23:12:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:02,446 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:12:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413339287] [2023-08-31 23:12:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413339287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:12:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423153877] [2023-08-31 23:12:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:02,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:02,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:02,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:02,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 282 [2023-08-31 23:12:02,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:12:02,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:02,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 282 [2023-08-31 23:12:02,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:04,507 INFO L130 PetriNetUnfolder]: 21075/29423 cut-off events. [2023-08-31 23:12:04,507 INFO L131 PetriNetUnfolder]: For 9306/9515 co-relation queries the response was YES. [2023-08-31 23:12:04,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69729 conditions, 29423 events. 21075/29423 cut-off events. For 9306/9515 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 177104 event pairs, 6853 based on Foata normal form. 188/28756 useless extension candidates. Maximal degree in co-relation 69724. Up to 19977 conditions per place. [2023-08-31 23:12:04,655 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 43 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-08-31 23:12:04,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 274 flow [2023-08-31 23:12:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:12:04,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023640661938534 [2023-08-31 23:12:04,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:12:04,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:12:04,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:04,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:12:04,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:12:04,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:04,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:04,677 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 140 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:12:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 274 flow [2023-08-31 23:12:04,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:04,760 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 133 flow [2023-08-31 23:12:04,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-31 23:12:04,761 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-08-31 23:12:04,761 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 133 flow [2023-08-31 23:12:04,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:12:04,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:04,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:04,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:12:04,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:04,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 129644477, now seen corresponding path program 1 times [2023-08-31 23:12:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:04,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028010105] [2023-08-31 23:12:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:05,194 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:12:05,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:05,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028010105] [2023-08-31 23:12:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028010105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058708010] [2023-08-31 23:12:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:05,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:05,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 282 [2023-08-31 23:12:05,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:12:05,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:05,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 282 [2023-08-31 23:12:05,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:07,688 INFO L130 PetriNetUnfolder]: 20793/29518 cut-off events. [2023-08-31 23:12:07,688 INFO L131 PetriNetUnfolder]: For 6966/6987 co-relation queries the response was YES. [2023-08-31 23:12:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68654 conditions, 29518 events. 20793/29518 cut-off events. For 6966/6987 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 183497 event pairs, 4474 based on Foata normal form. 1201/30019 useless extension candidates. Maximal degree in co-relation 68648. Up to 19092 conditions per place. [2023-08-31 23:12:07,867 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 56 selfloop transitions, 6 changer transitions 19/89 dead transitions. [2023-08-31 23:12:07,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 427 flow [2023-08-31 23:12:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-08-31 23:12:07,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371833839918946 [2023-08-31 23:12:07,875 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-08-31 23:12:07,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-08-31 23:12:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:07,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-08-31 23:12:07,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states 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:12:07,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:07,883 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:07,883 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 133 flow. Second operand 7 states and 863 transitions. [2023-08-31 23:12:07,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 427 flow [2023-08-31 23:12:07,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:07,904 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 148 flow [2023-08-31 23:12:07,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:12:07,906 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-31 23:12:07,906 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 148 flow [2023-08-31 23:12:07,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:12:07,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:07,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:07,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:12:07,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:07,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash -358574608, now seen corresponding path program 1 times [2023-08-31 23:12:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602682253] [2023-08-31 23:12:07,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:08,068 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:12:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602682253] [2023-08-31 23:12:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602682253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:08,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:08,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939106738] [2023-08-31 23:12:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:08,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:08,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:08,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 282 [2023-08-31 23:12:08,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:12:08,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:08,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 282 [2023-08-31 23:12:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:09,947 INFO L130 PetriNetUnfolder]: 23306/31399 cut-off events. [2023-08-31 23:12:09,948 INFO L131 PetriNetUnfolder]: For 9915/9915 co-relation queries the response was YES. [2023-08-31 23:12:10,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78937 conditions, 31399 events. 23306/31399 cut-off events. For 9915/9915 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 169879 event pairs, 4796 based on Foata normal form. 40/31439 useless extension candidates. Maximal degree in co-relation 78929. Up to 19748 conditions per place. [2023-08-31 23:12:10,113 INFO L137 encePairwiseOnDemand]: 272/282 looper letters, 71 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2023-08-31 23:12:10,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 464 flow [2023-08-31 23:12:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2023-08-31 23:12:10,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2023-08-31 23:12:10,115 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2023-08-31 23:12:10,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2023-08-31 23:12:10,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:10,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2023-08-31 23:12:10,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:12:10,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:10,119 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:10,119 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 148 flow. Second operand 4 states and 552 transitions. [2023-08-31 23:12:10,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 464 flow [2023-08-31 23:12:10,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 432 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:12:10,240 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 236 flow [2023-08-31 23:12:10,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-31 23:12:10,240 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-31 23:12:10,241 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 236 flow [2023-08-31 23:12:10,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:12:10,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:10,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:12:10,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:10,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1769147949, now seen corresponding path program 1 times [2023-08-31 23:12:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441379643] [2023-08-31 23:12:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:10,360 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:12:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441379643] [2023-08-31 23:12:10,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441379643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:10,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:10,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430722146] [2023-08-31 23:12:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:10,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:10,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 282 [2023-08-31 23:12:10,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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:12:10,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:10,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 282 [2023-08-31 23:12:10,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:12,124 INFO L130 PetriNetUnfolder]: 22645/30518 cut-off events. [2023-08-31 23:12:12,124 INFO L131 PetriNetUnfolder]: For 29653/29653 co-relation queries the response was YES. [2023-08-31 23:12:12,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85198 conditions, 30518 events. 22645/30518 cut-off events. For 29653/29653 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 165287 event pairs, 4656 based on Foata normal form. 160/30678 useless extension candidates. Maximal degree in co-relation 85189. Up to 14425 conditions per place. [2023-08-31 23:12:12,306 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 82 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2023-08-31 23:12:12,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 566 flow [2023-08-31 23:12:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:12:12,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867021276595745 [2023-08-31 23:12:12,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:12:12,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:12:12,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:12,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:12:12,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 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:12:12,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:12,311 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:12,311 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 236 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:12:12,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 566 flow [2023-08-31 23:12:12,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:12,447 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 328 flow [2023-08-31 23:12:12,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-31 23:12:12,448 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-31 23:12:12,448 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 328 flow [2023-08-31 23:12:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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:12:12,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:12,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:12,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:12:12,449 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:12,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1765284077, now seen corresponding path program 1 times [2023-08-31 23:12:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301021568] [2023-08-31 23:12:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:12,710 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:12:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301021568] [2023-08-31 23:12:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301021568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509364152] [2023-08-31 23:12:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:12,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:12,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-31 23:12:12,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:12:12,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:12,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-31 23:12:12,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:14,361 INFO L130 PetriNetUnfolder]: 13865/19533 cut-off events. [2023-08-31 23:12:14,361 INFO L131 PetriNetUnfolder]: For 30034/31931 co-relation queries the response was YES. [2023-08-31 23:12:14,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55477 conditions, 19533 events. 13865/19533 cut-off events. For 30034/31931 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 115857 event pairs, 4536 based on Foata normal form. 1438/20260 useless extension candidates. Maximal degree in co-relation 55465. Up to 13692 conditions per place. [2023-08-31 23:12:14,455 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 47 selfloop transitions, 4 changer transitions 23/90 dead transitions. [2023-08-31 23:12:14,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 626 flow [2023-08-31 23:12:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-08-31 23:12:14,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219858156028369 [2023-08-31 23:12:14,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-08-31 23:12:14,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-08-31 23:12:14,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:14,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-08-31 23:12:14,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states 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:12:14,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:14,462 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:14,462 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 328 flow. Second operand 7 states and 833 transitions. [2023-08-31 23:12:14,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 626 flow [2023-08-31 23:12:14,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 90 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:14,513 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 279 flow [2023-08-31 23:12:14,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-08-31 23:12:14,513 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-31 23:12:14,513 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 279 flow [2023-08-31 23:12:14,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:12:14,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:14,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:14,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:12:14,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:14,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1112907080, now seen corresponding path program 1 times [2023-08-31 23:12:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152401787] [2023-08-31 23:12:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:14,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:12:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152401787] [2023-08-31 23:12:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152401787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:14,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623642765] [2023-08-31 23:12:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:14,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:14,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 282 [2023-08-31 23:12:14,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:12:14,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:14,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 282 [2023-08-31 23:12:14,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:15,602 INFO L130 PetriNetUnfolder]: 9107/13576 cut-off events. [2023-08-31 23:12:15,602 INFO L131 PetriNetUnfolder]: For 11898/12520 co-relation queries the response was YES. [2023-08-31 23:12:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34154 conditions, 13576 events. 9107/13576 cut-off events. For 11898/12520 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 86405 event pairs, 1668 based on Foata normal form. 1255/14437 useless extension candidates. Maximal degree in co-relation 34141. Up to 8175 conditions per place. [2023-08-31 23:12:15,667 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 78 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2023-08-31 23:12:15,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 700 flow [2023-08-31 23:12:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-31 23:12:15,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48014184397163123 [2023-08-31 23:12:15,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-31 23:12:15,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-31 23:12:15,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:15,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-31 23:12:15,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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:12:15,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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:12:15,672 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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:12:15,672 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 279 flow. Second operand 5 states and 677 transitions. [2023-08-31 23:12:15,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 700 flow [2023-08-31 23:12:15,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 104 transitions, 653 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-31 23:12:15,685 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 326 flow [2023-08-31 23:12:15,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-08-31 23:12:15,686 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-08-31 23:12:15,686 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 326 flow [2023-08-31 23:12:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:12:15,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:15,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:15,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:12:15,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:15,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 979962033, now seen corresponding path program 1 times [2023-08-31 23:12:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302182405] [2023-08-31 23:12:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:15,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:12:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302182405] [2023-08-31 23:12:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302182405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069427058] [2023-08-31 23:12:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:15,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 282 [2023-08-31 23:12:15,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:12:15,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:15,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 282 [2023-08-31 23:12:15,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:16,718 INFO L130 PetriNetUnfolder]: 7575/11597 cut-off events. [2023-08-31 23:12:16,718 INFO L131 PetriNetUnfolder]: For 10914/11440 co-relation queries the response was YES. [2023-08-31 23:12:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36588 conditions, 11597 events. 7575/11597 cut-off events. For 10914/11440 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 75228 event pairs, 1044 based on Foata normal form. 856/12149 useless extension candidates. Maximal degree in co-relation 36573. Up to 3543 conditions per place. [2023-08-31 23:12:16,773 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 106 selfloop transitions, 19 changer transitions 2/143 dead transitions. [2023-08-31 23:12:16,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 985 flow [2023-08-31 23:12:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 950 transitions. [2023-08-31 23:12:16,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125633232016213 [2023-08-31 23:12:16,776 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 950 transitions. [2023-08-31 23:12:16,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 950 transitions. [2023-08-31 23:12:16,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:16,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 950 transitions. [2023-08-31 23:12:16,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.71428571428572) internal successors, (950), 7 states have internal predecessors, (950), 0 states have call successors, (0), 0 states 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:12:16,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:16,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:16,780 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 326 flow. Second operand 7 states and 950 transitions. [2023-08-31 23:12:16,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 985 flow [2023-08-31 23:12:16,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:16,820 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 455 flow [2023-08-31 23:12:16,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-08-31 23:12:16,820 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-08-31 23:12:16,820 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 455 flow [2023-08-31 23:12:16,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:12:16,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:16,821 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:12:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:12:16,821 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:16,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash 10091241, now seen corresponding path program 1 times [2023-08-31 23:12:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396499568] [2023-08-31 23:12:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:16,946 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:12:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396499568] [2023-08-31 23:12:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396499568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:16,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:16,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537216182] [2023-08-31 23:12:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:16,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:16,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-31 23:12:16,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:12:16,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:16,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-31 23:12:16,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:18,346 INFO L130 PetriNetUnfolder]: 11450/17520 cut-off events. [2023-08-31 23:12:18,346 INFO L131 PetriNetUnfolder]: For 41214/42105 co-relation queries the response was YES. [2023-08-31 23:12:18,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66236 conditions, 17520 events. 11450/17520 cut-off events. For 41214/42105 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 118251 event pairs, 2647 based on Foata normal form. 263/17442 useless extension candidates. Maximal degree in co-relation 66218. Up to 9028 conditions per place. [2023-08-31 23:12:18,404 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 91 selfloop transitions, 3 changer transitions 25/133 dead transitions. [2023-08-31 23:12:18,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 1197 flow [2023-08-31 23:12:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-31 23:12:18,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2023-08-31 23:12:18,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-31 23:12:18,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-31 23:12:18,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:18,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-31 23:12:18,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:12:18,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:18,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:18,411 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 455 flow. Second operand 4 states and 561 transitions. [2023-08-31 23:12:18,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 1197 flow [2023-08-31 23:12:18,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 1062 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:18,960 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 437 flow [2023-08-31 23:12:18,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=437, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2023-08-31 23:12:18,961 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2023-08-31 23:12:18,961 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 437 flow [2023-08-31 23:12:18,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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:12:18,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:18,961 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, 1] [2023-08-31 23:12:18,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:12:18,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:18,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash -19426243, now seen corresponding path program 1 times [2023-08-31 23:12:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762620585] [2023-08-31 23:12:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:19,117 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:12:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762620585] [2023-08-31 23:12:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762620585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969265921] [2023-08-31 23:12:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:19,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:19,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-31 23:12:19,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:12:19,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:19,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-31 23:12:19,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:21,268 INFO L130 PetriNetUnfolder]: 17246/26593 cut-off events. [2023-08-31 23:12:21,269 INFO L131 PetriNetUnfolder]: For 52554/53340 co-relation queries the response was YES. [2023-08-31 23:12:21,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95189 conditions, 26593 events. 17246/26593 cut-off events. For 52554/53340 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 194302 event pairs, 3290 based on Foata normal form. 552/26790 useless extension candidates. Maximal degree in co-relation 95169. Up to 11863 conditions per place. [2023-08-31 23:12:21,358 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 83 selfloop transitions, 3 changer transitions 32/132 dead transitions. [2023-08-31 23:12:21,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 1091 flow [2023-08-31 23:12:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-31 23:12:21,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2023-08-31 23:12:21,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-31 23:12:21,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-31 23:12:21,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:21,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-31 23:12:21,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:12:21,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:21,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:21,363 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 437 flow. Second operand 4 states and 555 transitions. [2023-08-31 23:12:21,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 1091 flow [2023-08-31 23:12:22,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:22,155 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 450 flow [2023-08-31 23:12:22,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-08-31 23:12:22,156 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-31 23:12:22,156 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 450 flow [2023-08-31 23:12:22,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:12:22,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:22,156 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] [2023-08-31 23:12:22,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:12:22,156 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:22,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1890363690, now seen corresponding path program 1 times [2023-08-31 23:12:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975851963] [2023-08-31 23:12:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:22,345 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:12:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975851963] [2023-08-31 23:12:22,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975851963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:22,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:22,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042367660] [2023-08-31 23:12:22,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:22,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:22,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:22,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:22,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 282 [2023-08-31 23:12:22,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:12:22,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:22,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 282 [2023-08-31 23:12:22,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:24,225 INFO L130 PetriNetUnfolder]: 12997/20310 cut-off events. [2023-08-31 23:12:24,225 INFO L131 PetriNetUnfolder]: For 32358/33229 co-relation queries the response was YES. [2023-08-31 23:12:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68687 conditions, 20310 events. 12997/20310 cut-off events. For 32358/33229 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 151444 event pairs, 1375 based on Foata normal form. 863/20593 useless extension candidates. Maximal degree in co-relation 68665. Up to 4461 conditions per place. [2023-08-31 23:12:24,295 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 120 selfloop transitions, 25 changer transitions 12/177 dead transitions. [2023-08-31 23:12:24,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 177 transitions, 1345 flow [2023-08-31 23:12:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:12:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:12:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1218 transitions. [2023-08-31 23:12:24,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799054373522459 [2023-08-31 23:12:24,298 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1218 transitions. [2023-08-31 23:12:24,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1218 transitions. [2023-08-31 23:12:24,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:24,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1218 transitions. [2023-08-31 23:12:24,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.33333333333334) internal successors, (1218), 9 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:12:24,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 282.0) internal successors, (2820), 10 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states 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:12:24,303 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 282.0) internal successors, (2820), 10 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states 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:12:24,303 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 450 flow. Second operand 9 states and 1218 transitions. [2023-08-31 23:12:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 177 transitions, 1345 flow [2023-08-31 23:12:25,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 177 transitions, 1337 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:25,185 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 620 flow [2023-08-31 23:12:25,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2023-08-31 23:12:25,185 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2023-08-31 23:12:25,186 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 620 flow [2023-08-31 23:12:25,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:12:25,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:25,186 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, 1, 1, 1] [2023-08-31 23:12:25,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:12:25,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:25,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1560665441, now seen corresponding path program 1 times [2023-08-31 23:12:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594411172] [2023-08-31 23:12:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:25,638 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:12:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594411172] [2023-08-31 23:12:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594411172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115658280] [2023-08-31 23:12:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:25,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:25,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:12:25,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 620 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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:12:25,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:25,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:12:25,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:28,976 INFO L130 PetriNetUnfolder]: 20238/32842 cut-off events. [2023-08-31 23:12:28,976 INFO L131 PetriNetUnfolder]: For 96416/97725 co-relation queries the response was YES. [2023-08-31 23:12:29,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134158 conditions, 32842 events. 20238/32842 cut-off events. For 96416/97725 co-relation queries the response was YES. Maximal size of possible extension queue 1925. Compared 274840 event pairs, 2752 based on Foata normal form. 534/32471 useless extension candidates. Maximal degree in co-relation 134133. Up to 12406 conditions per place. [2023-08-31 23:12:29,223 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 126 selfloop transitions, 7 changer transitions 76/229 dead transitions. [2023-08-31 23:12:29,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 229 transitions, 2373 flow [2023-08-31 23:12:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 954 transitions. [2023-08-31 23:12:29,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2023-08-31 23:12:29,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 954 transitions. [2023-08-31 23:12:29,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 954 transitions. [2023-08-31 23:12:29,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:29,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 954 transitions. [2023-08-31 23:12:29,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.28571428571428) internal successors, (954), 7 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:12:29,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:29,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:12:29,230 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 620 flow. Second operand 7 states and 954 transitions. [2023-08-31 23:12:29,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 229 transitions, 2373 flow [2023-08-31 23:12:36,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 229 transitions, 1939 flow, removed 162 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:36,165 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 597 flow [2023-08-31 23:12:36,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=597, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2023-08-31 23:12:36,165 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-31 23:12:36,165 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 597 flow [2023-08-31 23:12:36,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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:12:36,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:36,166 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, 1, 1, 1] [2023-08-31 23:12:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:12:36,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:36,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1132648589, now seen corresponding path program 2 times [2023-08-31 23:12:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775054618] [2023-08-31 23:12:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:36,352 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:12:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:36,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775054618] [2023-08-31 23:12:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775054618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:36,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:36,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120621725] [2023-08-31 23:12:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:36,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:36,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:36,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:36,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 282 [2023-08-31 23:12:36,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 597 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:12:36,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:36,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 282 [2023-08-31 23:12:36,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:38,875 INFO L130 PetriNetUnfolder]: 16795/27130 cut-off events. [2023-08-31 23:12:38,875 INFO L131 PetriNetUnfolder]: For 56240/57684 co-relation queries the response was YES. [2023-08-31 23:12:39,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103185 conditions, 27130 events. 16795/27130 cut-off events. For 56240/57684 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 222127 event pairs, 1409 based on Foata normal form. 644/27115 useless extension candidates. Maximal degree in co-relation 103156. Up to 5902 conditions per place. [2023-08-31 23:12:39,038 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 98 selfloop transitions, 28 changer transitions 54/199 dead transitions. [2023-08-31 23:12:39,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 199 transitions, 1623 flow [2023-08-31 23:12:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:12:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:12:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1461 transitions. [2023-08-31 23:12:39,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709864603481625 [2023-08-31 23:12:39,041 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1461 transitions. [2023-08-31 23:12:39,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1461 transitions. [2023-08-31 23:12:39,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:39,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1461 transitions. [2023-08-31 23:12:39,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 132.8181818181818) internal successors, (1461), 11 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states 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:12:39,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 282.0) internal successors, (3384), 12 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states 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:12:39,046 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 282.0) internal successors, (3384), 12 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states 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:12:39,046 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 597 flow. Second operand 11 states and 1461 transitions. [2023-08-31 23:12:39,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 199 transitions, 1623 flow [2023-08-31 23:12:42,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 199 transitions, 1608 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:42,986 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 606 flow [2023-08-31 23:12:42,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=606, PETRI_PLACES=96, PETRI_TRANSITIONS=73} [2023-08-31 23:12:42,986 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2023-08-31 23:12:42,986 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 606 flow [2023-08-31 23:12:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:12:42,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:42,987 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:12:42,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:42,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 856968399, now seen corresponding path program 1 times [2023-08-31 23:12:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923420128] [2023-08-31 23:12:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:43,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:12:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:43,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:12:43,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:12:43,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:12:43,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:12:43,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:12:43,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:12:43,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:12:43,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:12:43,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:12:43,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:12:43,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:12:43,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:12:43,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:12:43,105 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:43,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:12:43,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:12:43,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:12:43 BasicIcfg [2023-08-31 23:12:43,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:12:43,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:12:43,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:12:43,202 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:12:43,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:53" (3/4) ... [2023-08-31 23:12:43,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:12:43,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:12:43,205 INFO L158 Benchmark]: Toolchain (without parser) took 51028.13ms. Allocated memory was 67.1MB in the beginning and 5.9GB in the end (delta: 5.9GB). Free memory was 43.4MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2023-08-31 23:12:43,205 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:43,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.58ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 34.2MB in the end (delta: 8.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-08-31 23:12:43,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.39ms. Allocated memory is still 67.1MB. Free memory was 34.2MB in the beginning and 31.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:43,206 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 67.1MB. Free memory was 31.8MB in the beginning and 45.7MB in the end (delta: -13.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2023-08-31 23:12:43,206 INFO L158 Benchmark]: RCFGBuilder took 645.00ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 56.1MB in the end (delta: -10.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:43,207 INFO L158 Benchmark]: TraceAbstraction took 49861.57ms. Allocated memory was 83.9MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 55.7MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2023-08-31 23:12:43,207 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 5.9GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:43,208 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 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.58ms. Allocated memory is still 67.1MB. Free memory was 43.2MB in the beginning and 34.2MB in the end (delta: 8.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.39ms. Allocated memory is still 67.1MB. Free memory was 34.2MB in the beginning and 31.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 67.1MB. Free memory was 31.8MB in the beginning and 45.7MB in the end (delta: -13.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 645.00ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 56.1MB in the end (delta: -10.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49861.57ms. Allocated memory was 83.9MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 55.7MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 5.9GB. Free memory is still 2.8GB. 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.3s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 11113 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4836, independent: 4573, independent conditional: 0, independent unconditional: 4573, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1935, independent: 1879, independent conditional: 0, independent unconditional: 1879, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4836, independent: 2694, independent conditional: 0, independent unconditional: 2694, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 1935, unknown conditional: 0, unknown unconditional: 1935] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 224, Positive conditional cache size: 0, Positive unconditional cache size: 224, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t353, ((void *)0), P0, ((void *)0))=-3, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=-2, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=-1, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t356; [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t356, ((void *)0), P3, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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 9 procedures, 183 locations, 16 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: 49.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 855 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2987 IncrementalHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 50 mSDtfsCounter, 2987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=13, InterpolantAutomatonStates: 80, 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.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772 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:12:43,251 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/mix014_power.oepc_pso.oepc_rmo.oepc.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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --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:12:45,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:12:45,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:12:45,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:12:45,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:12:45,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:12:45,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:12:45,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:12:45,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:12:45,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:12:45,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:12:45,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:12:45,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:12:45,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:12:45,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:12:45,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:12:45,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:12:45,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:12:45,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:12:45,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:12:45,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:12:45,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:12:45,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:12:45,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:12:45,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:12:45,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:12:45,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:12:45,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:12:45,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:12:45,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:12:45,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:12:45,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:12:45,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:12:45,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:12:45,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:12:45,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:12:45,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:12:45,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:12:45,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:12:45,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:12:45,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:12:45,548 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:12:45,578 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:12:45,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:12:45,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:12:45,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:12:45,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:12:45,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:12:45,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:12:45,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:12:45,580 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:12:45,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:12:45,581 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:12:45,582 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:12:45,583 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:12:45,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:12:45,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:12:45,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:12:45,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:45,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:12:45,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:12:45,584 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:12:45,585 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:12:45,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:12:45,585 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:12:45,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:12:45,585 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:12:45,586 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:12:45,586 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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 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:12:45,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:12:45,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:12:45,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:12:45,858 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:12:45,858 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:12:45,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:12:46,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:12:47,139 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:12:47,139 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:12:47,147 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3ce2bd3/e1ad3cbce1f54f6e8201cb317e4df0a6/FLAGcf37691ae [2023-08-31 23:12:47,166 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3ce2bd3/e1ad3cbce1f54f6e8201cb317e4df0a6 [2023-08-31 23:12:47,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:12:47,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:12:47,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:47,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:12:47,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:12:47,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d9c0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47, skipping insertion in model container [2023-08-31 23:12:47,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:12:47,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:12:47,307 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:12:47,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:47,472 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:12:47,480 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:12:47,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:47,528 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:47,530 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:47,534 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:12:47,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47 WrapperNode [2023-08-31 23:12:47,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:47,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:47,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:12:47,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:12:47,540 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:12:47" (1/1) ... [2023-08-31 23:12:47,563 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:12:47" (1/1) ... [2023-08-31 23:12:47,592 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-31 23:12:47,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:47,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:12:47,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:12:47,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:12:47,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:12:47,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:12:47,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:12:47,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:12:47,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (1/1) ... [2023-08-31 23:12:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:47,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:12:47,666 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:12:47,699 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:12:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:12:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:12:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:12:47,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:12:47,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:12:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:12:47,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:12:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:12:47,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:12:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:12:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:12:47,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:12:47,711 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:12:47,871 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:12:47,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:12:48,221 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:12:48,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:12:48,365 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:12:48,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:48 BoogieIcfgContainer [2023-08-31 23:12:48,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:12:48,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:12:48,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:12:48,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:12:48,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:12:47" (1/3) ... [2023-08-31 23:12:48,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597b2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:48, skipping insertion in model container [2023-08-31 23:12:48,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:47" (2/3) ... [2023-08-31 23:12:48,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597b2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:48, skipping insertion in model container [2023-08-31 23:12:48,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:48" (3/3) ... [2023-08-31 23:12:48,379 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:12:48,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:12:48,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:12:48,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:12:48,479 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:12:48,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:12:48,577 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:12:48,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:48,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:12:48,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:12:48,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-31 23:12:48,591 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:12:48,608 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:12:48,614 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:12:48,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-31 23:12:48,641 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:12:48,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:12:48,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-31 23:12:54,597 INFO L134 LiptonReduction]: Checked pairs total: 10985 [2023-08-31 23:12:54,597 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:12:54,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:12:54,614 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;@40ffbd66, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:12:54,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:12:54,615 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:12:54,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:54,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:54,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:12:54,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:54,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-31 23:12:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652463476] [2023-08-31 23:12:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:54,631 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:12:54,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:54,633 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:12:54,634 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:12:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:54,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:12:54,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:54,693 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:12:54,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:54,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652463476] [2023-08-31 23:12:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652463476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:12:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130506223] [2023-08-31 23:12:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:12:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:12:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:12:54,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 282 [2023-08-31 23:12:54,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:12:54,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:54,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 282 [2023-08-31 23:12:54,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:55,818 INFO L130 PetriNetUnfolder]: 7479/10182 cut-off events. [2023-08-31 23:12:55,818 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:12:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20490 conditions, 10182 events. 7479/10182 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 54037 event pairs, 7479 based on Foata normal form. 0/8769 useless extension candidates. Maximal degree in co-relation 20478. Up to 10091 conditions per place. [2023-08-31 23:12:55,868 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:12:55,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-31 23:12:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:12:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:12:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:12:55,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2023-08-31 23:12:55,879 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:12:55,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:12:55,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:55,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:12:55,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:12:55,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:12:55,887 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:12:55,889 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:12:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-31 23:12:55,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:55,893 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:12:55,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-31 23:12:55,897 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:12:55,898 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:12:55,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:12:55,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:55,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:12:55,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:56,109 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:12:56,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:56,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 606322, now seen corresponding path program 1 times [2023-08-31 23:12:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:56,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719733458] [2023-08-31 23:12:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:56,111 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:12:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:56,113 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:12:56,115 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:12:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:56,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:56,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:56,205 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:12:56,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:56,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719733458] [2023-08-31 23:12:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719733458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:12:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886235080] [2023-08-31 23:12:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:56,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:56,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:56,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-31 23:12:56,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:12:56,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:56,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-31 23:12:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:56,945 INFO L130 PetriNetUnfolder]: 5879/8509 cut-off events. [2023-08-31 23:12:56,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16650 conditions, 8509 events. 5879/8509 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 52815 event pairs, 1079 based on Foata normal form. 0/7850 useless extension candidates. Maximal degree in co-relation 16647. Up to 6367 conditions per place. [2023-08-31 23:12:56,980 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-31 23:12:56,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-31 23:12:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-31 23:12:56,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2023-08-31 23:12:56,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-31 23:12:56,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-31 23:12:56,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:56,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-31 23:12:56,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:12:56,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:56,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:12:56,987 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 438 transitions. [2023-08-31 23:12:56,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-31 23:12:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:56,989 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:12:56,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:12:56,989 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:12:56,989 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:12:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:12:56,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:56,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:57,003 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:12:57,200 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:12:57,201 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:57,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1580082339, now seen corresponding path program 1 times [2023-08-31 23:12:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360227643] [2023-08-31 23:12:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:57,202 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:12:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:57,203 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:12:57,205 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:12:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:57,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:57,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:57,319 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:12:57,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:57,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360227643] [2023-08-31 23:12:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360227643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680163776] [2023-08-31 23:12:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:57,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:57,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:12:57,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:12:57,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:57,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:12:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:57,769 INFO L130 PetriNetUnfolder]: 3939/5654 cut-off events. [2023-08-31 23:12:57,770 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-31 23:12:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11803 conditions, 5654 events. 3939/5654 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 31561 event pairs, 655 based on Foata normal form. 320/5712 useless extension candidates. Maximal degree in co-relation 11799. Up to 3025 conditions per place. [2023-08-31 23:12:57,790 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 51 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2023-08-31 23:12:57,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 264 flow [2023-08-31 23:12:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:12:57,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2023-08-31 23:12:57,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:12:57,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:12:57,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:57,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:12:57,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:12:57,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:57,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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:12:57,796 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:12:57,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 264 flow [2023-08-31 23:12:57,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:57,797 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2023-08-31 23:12:57,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-31 23:12:57,797 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-31 23:12:57,798 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2023-08-31 23:12:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:12:57,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:57,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:57,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:58,027 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:12:58,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:58,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 178954888, now seen corresponding path program 1 times [2023-08-31 23:12:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829874414] [2023-08-31 23:12:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:58,029 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:12:58,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:58,045 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:12:58,060 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:12:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:58,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:58,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:58,185 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:12:58,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:58,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829874414] [2023-08-31 23:12:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829874414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:58,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:58,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709999404] [2023-08-31 23:12:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:58,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:12:58,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:12:58,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:58,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:12:58,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:58,555 INFO L130 PetriNetUnfolder]: 2022/3089 cut-off events. [2023-08-31 23:12:58,555 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-31 23:12:58,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7837 conditions, 3089 events. 2022/3089 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16675 event pairs, 328 based on Foata normal form. 212/3201 useless extension candidates. Maximal degree in co-relation 7831. Up to 1044 conditions per place. [2023-08-31 23:12:58,566 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 64 selfloop transitions, 10 changer transitions 1/80 dead transitions. [2023-08-31 23:12:58,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 381 flow [2023-08-31 23:12:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-31 23:12:58,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49432624113475176 [2023-08-31 23:12:58,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-31 23:12:58,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-31 23:12:58,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:58,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-31 23:12:58,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:12:58,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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:12:58,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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:12:58,573 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 697 transitions. [2023-08-31 23:12:58,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 381 flow [2023-08-31 23:12:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 370 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:58,576 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2023-08-31 23:12:58,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-31 23:12:58,576 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-31 23:12:58,576 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2023-08-31 23:12:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:12:58,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:58,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:58,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:58,784 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:12:58,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:58,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1744264285, now seen corresponding path program 1 times [2023-08-31 23:12:58,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:58,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255315807] [2023-08-31 23:12:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:58,785 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:12:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:58,786 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:12:58,788 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:12:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:58,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:12:58,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:58,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:58,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:58,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255315807] [2023-08-31 23:12:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255315807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330460214] [2023-08-31 23:12:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:58,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:58,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:12:58,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:12:58,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:58,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:12:58,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:59,261 INFO L130 PetriNetUnfolder]: 1176/1856 cut-off events. [2023-08-31 23:12:59,262 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-31 23:12:59,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 1856 events. 1176/1856 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9403 event pairs, 326 based on Foata normal form. 77/1896 useless extension candidates. Maximal degree in co-relation 5345. Up to 630 conditions per place. [2023-08-31 23:12:59,269 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 75 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2023-08-31 23:12:59,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 504 flow [2023-08-31 23:12:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-31 23:12:59,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940898345153664 [2023-08-31 23:12:59,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-31 23:12:59,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-31 23:12:59,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:59,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-31 23:12:59,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 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:12:59,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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:12:59,276 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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:12:59,276 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 836 transitions. [2023-08-31 23:12:59,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 504 flow [2023-08-31 23:12:59,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 474 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:59,286 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2023-08-31 23:12:59,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-31 23:12:59,287 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:12:59,287 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2023-08-31 23:12:59,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:12:59,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:59,287 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, 1, 1] [2023-08-31 23:12:59,297 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:12:59,495 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:12:59,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:59,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1530844975, now seen corresponding path program 1 times [2023-08-31 23:12:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392222732] [2023-08-31 23:12:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:59,496 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:12:59,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:59,497 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:12:59,499 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:12:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:59,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:12:59,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:59,641 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:12:59,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:59,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392222732] [2023-08-31 23:12:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392222732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:59,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261662888] [2023-08-31 23:12:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:59,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:59,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:12:59,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:12:59,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:59,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:12:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:59,997 INFO L130 PetriNetUnfolder]: 1011/1576 cut-off events. [2023-08-31 23:12:59,997 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-31 23:13:00,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 1576 events. 1011/1576 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7799 event pairs, 326 based on Foata normal form. 14/1566 useless extension candidates. Maximal degree in co-relation 4609. Up to 630 conditions per place. [2023-08-31 23:13:00,005 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 58 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2023-08-31 23:13:00,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 462 flow [2023-08-31 23:13:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-31 23:13:00,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797365754812563 [2023-08-31 23:13:00,007 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-31 23:13:00,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-31 23:13:00,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:00,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-31 23:13:00,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:13:00,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:13:00,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:13:00,012 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 947 transitions. [2023-08-31 23:13:00,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 462 flow [2023-08-31 23:13:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 416 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-31 23:13:00,032 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2023-08-31 23:13:00,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-31 23:13:00,033 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-31 23:13:00,033 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2023-08-31 23:13:00,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:13:00,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:00,034 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:00,043 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 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:13:00,241 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:13:00,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:00,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 878627051, now seen corresponding path program 1 times [2023-08-31 23:13:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362354663] [2023-08-31 23:13:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:00,243 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:13:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:00,244 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:13:00,246 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:13:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:00,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:13:00,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:00,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:13:00,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:00,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362354663] [2023-08-31 23:13:00,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362354663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:00,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:13:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161842917] [2023-08-31 23:13:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:00,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:13:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:13:00,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:13:00,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 282 [2023-08-31 23:13:00,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:13:00,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:00,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 282 [2023-08-31 23:13:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:01,044 INFO L130 PetriNetUnfolder]: 1159/1892 cut-off events. [2023-08-31 23:13:01,044 INFO L131 PetriNetUnfolder]: For 2135/2135 co-relation queries the response was YES. [2023-08-31 23:13:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5492 conditions, 1892 events. 1159/1892 cut-off events. For 2135/2135 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10500 event pairs, 145 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 5483. Up to 773 conditions per place. [2023-08-31 23:13:01,054 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 99 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2023-08-31 23:13:01,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 814 flow [2023-08-31 23:13:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-08-31 23:13:01,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2023-08-31 23:13:01,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-08-31 23:13:01,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-08-31 23:13:01,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:01,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-08-31 23:13:01,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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:13:01,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:13:01,081 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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:13:01,081 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 7 states and 945 transitions. [2023-08-31 23:13:01,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 814 flow [2023-08-31 23:13:01,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 548 flow, removed 34 selfloop flow, removed 11 redundant places. [2023-08-31 23:13:01,090 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 148 flow [2023-08-31 23:13:01,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-31 23:13:01,091 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:13:01,091 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 148 flow [2023-08-31 23:13:01,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:13:01,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:01,092 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:01,117 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:13:01,300 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:13:01,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:01,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -946857827, now seen corresponding path program 2 times [2023-08-31 23:13:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714788161] [2023-08-31 23:13:01,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:13:01,301 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:13:01,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:01,317 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:13:01,318 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:13:01,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:13:01,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:13:01,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:13:01,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:01,441 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:13:01,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:01,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714788161] [2023-08-31 23:13:01,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714788161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:01,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:01,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136983917] [2023-08-31 23:13:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:01,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:01,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 282 [2023-08-31 23:13:01,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:13:01,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:01,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 282 [2023-08-31 23:13:01,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:01,709 INFO L130 PetriNetUnfolder]: 2066/3248 cut-off events. [2023-08-31 23:13:01,709 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2023-08-31 23:13:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8084 conditions, 3248 events. 2066/3248 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18946 event pairs, 858 based on Foata normal form. 1/3193 useless extension candidates. Maximal degree in co-relation 8078. Up to 1775 conditions per place. [2023-08-31 23:13:01,723 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 73 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-31 23:13:01,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 419 flow [2023-08-31 23:13:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:13:01,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-31 23:13:01,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:13:01,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:13:01,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:01,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:13:01,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:13:01,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:13:01,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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:13:01,727 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 148 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:13:01,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 419 flow [2023-08-31 23:13:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 411 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:01,732 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 154 flow [2023-08-31 23:13:01,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-08-31 23:13:01,733 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:13:01,733 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 154 flow [2023-08-31 23:13:01,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:13:01,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:01,733 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:01,755 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:13:01,941 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:13:01,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:01,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash -921053614, now seen corresponding path program 1 times [2023-08-31 23:13:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:01,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796027241] [2023-08-31 23:13:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:01,942 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:13:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:01,958 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:13:01,959 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:13:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:02,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:13:02,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:02,586 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:13:02,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:02,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:02,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796027241] [2023-08-31 23:13:02,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796027241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660394801] [2023-08-31 23:13:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:02,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:02,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-31 23:13:02,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:13:02,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:02,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-31 23:13:02,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:03,267 INFO L130 PetriNetUnfolder]: 1816/2877 cut-off events. [2023-08-31 23:13:03,267 INFO L131 PetriNetUnfolder]: For 972/972 co-relation queries the response was YES. [2023-08-31 23:13:03,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 2877 events. 1816/2877 cut-off events. For 972/972 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16727 event pairs, 143 based on Foata normal form. 4/2874 useless extension candidates. Maximal degree in co-relation 7381. Up to 2389 conditions per place. [2023-08-31 23:13:03,275 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 46 selfloop transitions, 4 changer transitions 17/72 dead transitions. [2023-08-31 23:13:03,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 386 flow [2023-08-31 23:13:03,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:13:03,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4190307328605201 [2023-08-31 23:13:03,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:13:03,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:13:03,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:03,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:13:03,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:13:03,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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:13:03,281 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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:13:03,281 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 154 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:13:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 386 flow [2023-08-31 23:13:03,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:13:03,284 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 144 flow [2023-08-31 23:13:03,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-31 23:13:03,285 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-31 23:13:03,285 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 144 flow [2023-08-31 23:13:03,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:13:03,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:03,286 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:03,312 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:13:03,512 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:13:03,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:03,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -122695889, now seen corresponding path program 3 times [2023-08-31 23:13:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866859332] [2023-08-31 23:13:03,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:13:03,514 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:13:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:03,515 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:13:03,517 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:13:03,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:13:03,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:13:03,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:13:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:03,752 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:13:03,752 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:13:03,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:13:03,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:13:03,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:13:03,768 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:13:03,964 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:13:03,964 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:03,968 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:13:03,968 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:13:04,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:13:04 BasicIcfg [2023-08-31 23:13:04,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:13:04,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:13:04,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:13:04,025 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:13:04,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:48" (3/4) ... [2023-08-31 23:13:04,027 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:13:04,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:13:04,028 INFO L158 Benchmark]: Toolchain (without parser) took 16859.44ms. Allocated memory was 67.1MB in the beginning and 998.2MB in the end (delta: 931.1MB). Free memory was 43.7MB in the beginning and 674.7MB in the end (delta: -631.0MB). Peak memory consumption was 301.5MB. Max. memory is 16.1GB. [2023-08-31 23:13:04,028 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:04,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.57ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 35.9MB in the end (delta: 7.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-08-31 23:13:04,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.51ms. Allocated memory is still 67.1MB. 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:13:04,028 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 67.1MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:04,029 INFO L158 Benchmark]: RCFGBuilder took 725.13ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.0MB in the beginning and 57.7MB in the end (delta: -26.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-08-31 23:13:04,029 INFO L158 Benchmark]: TraceAbstraction took 15656.32ms. Allocated memory was 81.8MB in the beginning and 998.2MB in the end (delta: 916.5MB). Free memory was 57.2MB in the beginning and 674.7MB in the end (delta: -617.5MB). Peak memory consumption was 298.9MB. Max. memory is 16.1GB. [2023-08-31 23:13:04,029 INFO L158 Benchmark]: Witness Printer took 2.06ms. Allocated memory is still 998.2MB. Free memory is still 674.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:04,030 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.57ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 35.9MB in the end (delta: 7.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.51ms. Allocated memory is still 67.1MB. 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 48.62ms. Allocated memory is still 67.1MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 725.13ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.0MB in the beginning and 57.7MB in the end (delta: -26.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15656.32ms. Allocated memory was 81.8MB in the beginning and 998.2MB in the end (delta: 916.5MB). Free memory was 57.2MB in the beginning and 674.7MB in the end (delta: -617.5MB). Peak memory consumption was 298.9MB. Max. memory is 16.1GB. * Witness Printer took 2.06ms. Allocated memory is still 998.2MB. Free memory is still 674.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: 6.0s, 153 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 10985 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5237, independent: 4979, independent conditional: 0, independent unconditional: 4979, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1968, independent: 1916, independent conditional: 0, independent unconditional: 1916, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5237, independent: 3063, independent conditional: 0, independent unconditional: 3063, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 1968, unknown conditional: 0, unknown unconditional: 1968] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t353, ((void *)0), P0, ((void *)0))=0, t353={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=1, t353={11:0}, t354={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t355; [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=2, t353={11:0}, t354={15:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t356, ((void *)0), P3, ((void *)0))=3, t353={11:0}, t354={15:0}, t355={7:0}, t356={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={11:0}, t354={15:0}, t355={7:0}, t356={-2147483637:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={11:0}, t354={15:0}, t355={7:0}, t356={-2147483637:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1567 IncrementalHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 19 mSDtfsCounter, 1567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 151 ConstructedInterpolants, 17 QuantifiedInterpolants, 1898 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:13:04,069 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