./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:33:25,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:33:25,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:33:25,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:33:25,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:33:25,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:33:25,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:33:25,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:33:25,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:33:25,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:33:25,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:33:25,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:33:25,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:33:25,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:33:25,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:33:25,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:33:25,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:33:25,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:33:25,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:33:25,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:33:25,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:33:25,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:33:25,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:33:25,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:33:25,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:33:25,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:33:25,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:33:25,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:33:25,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:33:25,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:33:25,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:33:25,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:33:25,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:33:25,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:33:25,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:33:25,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:33:25,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:33:25,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:33:25,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:33:25,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:33:25,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:33:25,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:33:25,824 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:33:25,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:33:25,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:33:25,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:33:25,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:33:25,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:33:25,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:33:25,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:33:25,828 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:33:25,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:33:25,829 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:33:25,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:33:25,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:33:25,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:33:25,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:33:25,830 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:33:25,830 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:33:25,830 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:33:25,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:33:25,831 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:33:25,831 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:33:25,831 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:33:25,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:33:25,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:33:25,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:33:25,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:25,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:33:25,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:33:25,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:33:25,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:33:25,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:33:25,833 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:33:25,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:33:25,834 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:33:25,834 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 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 -> AFTER [2023-08-29 20:33:26,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:33:26,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:33:26,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:33:26,182 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:33:26,182 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:33:26,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-29 20:33:27,413 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:33:27,612 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:33:27,613 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-29 20:33:27,635 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af9d19dc/85be36bd8ab84b758aca63a420e95022/FLAG12b968f7d [2023-08-29 20:33:27,649 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af9d19dc/85be36bd8ab84b758aca63a420e95022 [2023-08-29 20:33:27,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:33:27,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:33:27,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:27,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:33:27,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:33:27,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:27" (1/1) ... [2023-08-29 20:33:27,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:27, skipping insertion in model container [2023-08-29 20:33:27,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:27" (1/1) ... [2023-08-29 20:33:27,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:33:27,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:33:27,840 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/safe000_power.opt.i[951,964] [2023-08-29 20:33:28,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:28,029 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:33:28,039 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/safe000_power.opt.i[951,964] [2023-08-29 20:33:28,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:28,112 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:28,114 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:28,120 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:33:28,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28 WrapperNode [2023-08-29 20:33:28,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:28,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:28,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:33:28,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:33:28,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,200 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-29 20:33:28,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:28,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:33:28,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:33:28,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:33:28,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,259 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:33:28,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:33:28,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:33:28,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:33:28,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (1/1) ... [2023-08-29 20:33:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:33:28,301 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-29 20:33:28,324 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-29 20:33:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:33:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:33:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:33:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:33:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:33:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:33:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:33:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:33:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:33:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:33:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:33:28,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:33:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:33:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:33:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:33:28,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:33:28,347 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:33:28,471 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:33:28,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:33:29,064 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:33:29,691 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:33:29,691 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:33:29,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:29 BoogieIcfgContainer [2023-08-29 20:33:29,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:33:29,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:33:29,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:33:29,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:33:29,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:33:27" (1/3) ... [2023-08-29 20:33:29,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f95f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:29, skipping insertion in model container [2023-08-29 20:33:29,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:28" (2/3) ... [2023-08-29 20:33:29,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f95f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:29, skipping insertion in model container [2023-08-29 20:33:29,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:29" (3/3) ... [2023-08-29 20:33:29,704 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-29 20:33:29,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:33:29,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-29 20:33:29,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:33:29,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:33:29,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:33:29,976 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:33:29,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:29,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:33:29,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:33:30,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:30,013 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:33:30,029 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:30,031 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:30,100 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:33:30,101 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:30,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:33:30,106 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-29 20:33:41,788 INFO L134 LiptonReduction]: Checked pairs total: 31207 [2023-08-29 20:33:41,789 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-29 20:33:41,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:33:41,817 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;@6b463ef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:33:41,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-29 20:33:41,819 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:33:41,819 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:41,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:41,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:33:41,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:33:41,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1117, now seen corresponding path program 1 times [2023-08-29 20:33:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841891227] [2023-08-29 20:33:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:41,996 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-29 20:33:41,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841891227] [2023-08-29 20:33:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841891227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:33:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067676265] [2023-08-29 20:33:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:42,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:33:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:33:42,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:33:42,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-29 20:33:42,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:42,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:42,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-29 20:33:42,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:47,545 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-29 20:33:47,545 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:33:47,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3422. Compared 317079 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-29 20:33:47,874 INFO L137 encePairwiseOnDemand]: 294/315 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:33:47,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-29 20:33:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:33:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:33:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-29 20:33:47,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2023-08-29 20:33:47,893 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-29 20:33:47,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-29 20:33:47,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:47,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-29 20:33:47,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:47,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 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-29 20:33:47,903 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 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-29 20:33:47,904 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 314 transitions. [2023-08-29 20:33:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-29 20:33:47,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:47,921 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-29 20:33:47,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 20:33:47,926 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:33:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-29 20:33:47,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:47,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:47,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:33:47,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:33:47,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:33:47,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 34153930, now seen corresponding path program 1 times [2023-08-29 20:33:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:47,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066202366] [2023-08-29 20:33:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:48,250 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-29 20:33:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066202366] [2023-08-29 20:33:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066202366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383467550] [2023-08-29 20:33:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:48,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:48,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:48,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:48,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-29 20:33:48,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:48,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:48,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-29 20:33:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:52,365 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-29 20:33:52,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:52,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3098. Compared 303028 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-29 20:33:52,551 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-29 20:33:52,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-29 20:33:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-29 20:33:52,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2023-08-29 20:33:52,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-29 20:33:52,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-29 20:33:52,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:52,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-29 20:33:52,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,563 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-29 20:33:52,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-29 20:33:52,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:52,565 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-29 20:33:52,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 20:33:52,567 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-29 20:33:52,567 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-29 20:33:52,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:52,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:33:52,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:33:52,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:33:52,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772752, now seen corresponding path program 1 times [2023-08-29 20:33:52,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:52,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332342505] [2023-08-29 20:33:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:52,696 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-29 20:33:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:52,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332342505] [2023-08-29 20:33:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332342505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:52,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778307879] [2023-08-29 20:33:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:52,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:33:52,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:52,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:33:52,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:58,084 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-29 20:33:58,085 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-29 20:33:58,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4126. Compared 381706 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-29 20:33:58,536 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-29 20:33:58,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-29 20:33:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-29 20:33:58,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-29 20:33:58,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-29 20:33:58,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-29 20:33:58,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:58,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-29 20:33:58,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:58,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:58,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:58,549 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 450 transitions. [2023-08-29 20:33:58,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-29 20:33:58,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:58,553 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-29 20:33:58,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-29 20:33:58,554 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:33:58,557 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-29 20:33:58,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:58,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:58,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:33:58,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:33:58,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:33:58,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772754, now seen corresponding path program 1 times [2023-08-29 20:33:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389960208] [2023-08-29 20:33:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:58,758 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-29 20:33:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389960208] [2023-08-29 20:33:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389960208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859679408] [2023-08-29 20:33:58,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:58,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:58,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:33:58,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:58,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:58,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:33:58,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:01,468 INFO L130 PetriNetUnfolder]: 17391/24493 cut-off events. [2023-08-29 20:34:01,468 INFO L131 PetriNetUnfolder]: For 5061/5135 co-relation queries the response was YES. [2023-08-29 20:34:01,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56528 conditions, 24493 events. 17391/24493 cut-off events. For 5061/5135 co-relation queries the response was YES. Maximal size of possible extension queue 1782. Compared 164969 event pairs, 5107 based on Foata normal form. 24/16740 useless extension candidates. Maximal degree in co-relation 56523. Up to 13571 conditions per place. [2023-08-29 20:34:01,578 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 89 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2023-08-29 20:34:01,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 451 flow [2023-08-29 20:34:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2023-08-29 20:34:01,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2023-08-29 20:34:01,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2023-08-29 20:34:01,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2023-08-29 20:34:01,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:01,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2023-08-29 20:34:01,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:01,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:01,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:01,585 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 4 states and 575 transitions. [2023-08-29 20:34:01,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 451 flow [2023-08-29 20:34:01,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:01,609 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 185 flow [2023-08-29 20:34:01,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-29 20:34:01,610 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-29 20:34:01,610 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 185 flow [2023-08-29 20:34:01,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:01,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:01,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:34:01,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:34:01,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:01,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772755, now seen corresponding path program 1 times [2023-08-29 20:34:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:01,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458449727] [2023-08-29 20:34:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:01,737 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-29 20:34:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458449727] [2023-08-29 20:34:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458449727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001272114] [2023-08-29 20:34:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:01,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:01,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:01,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-29 20:34:01,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:01,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:01,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-29 20:34:01,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:02,543 INFO L130 PetriNetUnfolder]: 5199/7513 cut-off events. [2023-08-29 20:34:02,543 INFO L131 PetriNetUnfolder]: For 5247/5288 co-relation queries the response was YES. [2023-08-29 20:34:02,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20817 conditions, 7513 events. 5199/7513 cut-off events. For 5247/5288 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42772 event pairs, 4471 based on Foata normal form. 2609/8960 useless extension candidates. Maximal degree in co-relation 20810. Up to 7464 conditions per place. [2023-08-29 20:34:02,570 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-29 20:34:02,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 243 flow [2023-08-29 20:34:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-29 20:34:02,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2023-08-29 20:34:02,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-29 20:34:02,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-29 20:34:02,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:02,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-29 20:34:02,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,576 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 185 flow. Second operand 3 states and 413 transitions. [2023-08-29 20:34:02,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 243 flow [2023-08-29 20:34:02,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:02,579 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 158 flow [2023-08-29 20:34:02,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-29 20:34:02,580 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-29 20:34:02,580 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 158 flow [2023-08-29 20:34:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:02,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:02,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:34:02,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:02,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1089620560, now seen corresponding path program 1 times [2023-08-29 20:34:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558347927] [2023-08-29 20:34:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:02,789 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-29 20:34:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558347927] [2023-08-29 20:34:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558347927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206783234] [2023-08-29 20:34:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:02,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:02,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:34:02,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:02,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:02,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:34:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:03,695 INFO L130 PetriNetUnfolder]: 5159/7423 cut-off events. [2023-08-29 20:34:03,695 INFO L131 PetriNetUnfolder]: For 4422/4431 co-relation queries the response was YES. [2023-08-29 20:34:03,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20564 conditions, 7423 events. 5159/7423 cut-off events. For 4422/4431 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 42057 event pairs, 2953 based on Foata normal form. 0/6299 useless extension candidates. Maximal degree in co-relation 20557. Up to 6733 conditions per place. [2023-08-29 20:34:03,723 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 66 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-29 20:34:03,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 380 flow [2023-08-29 20:34:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:34:03,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-29 20:34:03,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:34:03,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:34:03,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:03,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:34:03,727 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-29 20:34:03,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:03,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:03,729 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 158 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:34:03,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 380 flow [2023-08-29 20:34:03,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:03,732 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 165 flow [2023-08-29 20:34:03,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-29 20:34:03,733 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-29 20:34:03,733 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 165 flow [2023-08-29 20:34:03,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:03,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:03,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:03,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:34:03,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:03,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1089620814, now seen corresponding path program 1 times [2023-08-29 20:34:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372436066] [2023-08-29 20:34:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:03,811 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-29 20:34:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:03,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372436066] [2023-08-29 20:34:03,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372436066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404911638] [2023-08-29 20:34:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:03,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:03,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:03,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:03,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-29 20:34:03,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:03,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:03,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-29 20:34:03,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:04,651 INFO L130 PetriNetUnfolder]: 5035/7525 cut-off events. [2023-08-29 20:34:04,651 INFO L131 PetriNetUnfolder]: For 4551/4587 co-relation queries the response was YES. [2023-08-29 20:34:04,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21018 conditions, 7525 events. 5035/7525 cut-off events. For 4551/4587 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 46127 event pairs, 1342 based on Foata normal form. 4/6535 useless extension candidates. Maximal degree in co-relation 21010. Up to 5610 conditions per place. [2023-08-29 20:34:04,673 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 66 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-29 20:34:04,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 404 flow [2023-08-29 20:34:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:34:04,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-29 20:34:04,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:34:04,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:34:04,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:04,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:34:04,676 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-29 20:34:04,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:04,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:04,677 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 165 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:34:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 404 flow [2023-08-29 20:34:04,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:04,680 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 174 flow [2023-08-29 20:34:04,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-29 20:34:04,681 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-29 20:34:04,681 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 174 flow [2023-08-29 20:34:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:04,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:04,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:04,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:34:04,682 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:04,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1109862484, now seen corresponding path program 1 times [2023-08-29 20:34:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574845431] [2023-08-29 20:34:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:04,877 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-29 20:34:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:04,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574845431] [2023-08-29 20:34:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574845431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674417921] [2023-08-29 20:34:04,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:04,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:04,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-29 20:34:04,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:04,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:04,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-29 20:34:04,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:05,804 INFO L130 PetriNetUnfolder]: 7192/10250 cut-off events. [2023-08-29 20:34:05,804 INFO L131 PetriNetUnfolder]: For 5444/5444 co-relation queries the response was YES. [2023-08-29 20:34:05,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29087 conditions, 10250 events. 7192/10250 cut-off events. For 5444/5444 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 54455 event pairs, 1822 based on Foata normal form. 20/9106 useless extension candidates. Maximal degree in co-relation 29078. Up to 9227 conditions per place. [2023-08-29 20:34:05,851 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 69 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-29 20:34:05,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 423 flow [2023-08-29 20:34:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:34:05,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455026455026455 [2023-08-29 20:34:05,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:34:05,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:34:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:05,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:34:05,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:05,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:05,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:05,856 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 174 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:34:05,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 423 flow [2023-08-29 20:34:05,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:05,860 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 187 flow [2023-08-29 20:34:05,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-29 20:34:05,861 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:34:05,861 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 187 flow [2023-08-29 20:34:05,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:05,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:05,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:34:05,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:05,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -538304897, now seen corresponding path program 1 times [2023-08-29 20:34:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374052231] [2023-08-29 20:34:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:06,040 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-29 20:34:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374052231] [2023-08-29 20:34:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374052231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:06,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082499225] [2023-08-29 20:34:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:06,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:06,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:06,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:06,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 315 [2023-08-29 20:34:06,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:06,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:06,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 315 [2023-08-29 20:34:06,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:07,106 INFO L130 PetriNetUnfolder]: 6385/9602 cut-off events. [2023-08-29 20:34:07,106 INFO L131 PetriNetUnfolder]: For 6122/6367 co-relation queries the response was YES. [2023-08-29 20:34:07,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26927 conditions, 9602 events. 6385/9602 cut-off events. For 6122/6367 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 60569 event pairs, 2121 based on Foata normal form. 585/9000 useless extension candidates. Maximal degree in co-relation 26917. Up to 4835 conditions per place. [2023-08-29 20:34:07,149 INFO L137 encePairwiseOnDemand]: 301/315 looper letters, 91 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2023-08-29 20:34:07,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 617 flow [2023-08-29 20:34:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-29 20:34:07,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-29 20:34:07,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-29 20:34:07,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-29 20:34:07,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:07,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-29 20:34:07,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:07,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:07,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:07,156 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 187 flow. Second operand 5 states and 693 transitions. [2023-08-29 20:34:07,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 617 flow [2023-08-29 20:34:07,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:07,161 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 302 flow [2023-08-29 20:34:07,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-29 20:34:07,162 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-29 20:34:07,162 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 302 flow [2023-08-29 20:34:07,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:07,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:07,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:07,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:34:07,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:07,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 581498804, now seen corresponding path program 1 times [2023-08-29 20:34:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993139926] [2023-08-29 20:34:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:07,390 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-29 20:34:07,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:07,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993139926] [2023-08-29 20:34:07,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993139926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:07,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:07,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540766129] [2023-08-29 20:34:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:07,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:07,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:07,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:34:07,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:07,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:07,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:34:07,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:08,559 INFO L130 PetriNetUnfolder]: 6324/9463 cut-off events. [2023-08-29 20:34:08,559 INFO L131 PetriNetUnfolder]: For 9257/9559 co-relation queries the response was YES. [2023-08-29 20:34:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33768 conditions, 9463 events. 6324/9463 cut-off events. For 9257/9559 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 59148 event pairs, 2440 based on Foata normal form. 96/8320 useless extension candidates. Maximal degree in co-relation 33756. Up to 7455 conditions per place. [2023-08-29 20:34:08,604 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 71 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2023-08-29 20:34:08,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 559 flow [2023-08-29 20:34:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-29 20:34:08,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-29 20:34:08,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-29 20:34:08,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-29 20:34:08,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:08,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-29 20:34:08,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:08,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:08,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:08,610 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 302 flow. Second operand 4 states and 540 transitions. [2023-08-29 20:34:08,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 559 flow [2023-08-29 20:34:08,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:08,619 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 302 flow [2023-08-29 20:34:08,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-29 20:34:08,620 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -18 predicate places. [2023-08-29 20:34:08,620 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 302 flow [2023-08-29 20:34:08,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:08,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:08,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:08,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:34:08,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:08,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 846633140, now seen corresponding path program 1 times [2023-08-29 20:34:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83922431] [2023-08-29 20:34:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:08,765 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-29 20:34:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:08,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83922431] [2023-08-29 20:34:08,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83922431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:08,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:08,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:08,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048604480] [2023-08-29 20:34:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:08,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 315 [2023-08-29 20:34:08,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:08,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:08,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 315 [2023-08-29 20:34:08,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:09,726 INFO L130 PetriNetUnfolder]: 5240/7963 cut-off events. [2023-08-29 20:34:09,726 INFO L131 PetriNetUnfolder]: For 8591/8706 co-relation queries the response was YES. [2023-08-29 20:34:09,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 7963 events. 5240/7963 cut-off events. For 8591/8706 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 48725 event pairs, 2324 based on Foata normal form. 132/7045 useless extension candidates. Maximal degree in co-relation 27761. Up to 5322 conditions per place. [2023-08-29 20:34:09,772 INFO L137 encePairwiseOnDemand]: 306/315 looper letters, 63 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-29 20:34:09,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 516 flow [2023-08-29 20:34:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-29 20:34:09,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2023-08-29 20:34:09,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-29 20:34:09,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-29 20:34:09,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:09,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-29 20:34:09,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:09,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:09,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:09,776 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 302 flow. Second operand 3 states and 395 transitions. [2023-08-29 20:34:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 516 flow [2023-08-29 20:34:09,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:09,784 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 323 flow [2023-08-29 20:34:09,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-29 20:34:09,785 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-08-29 20:34:09,785 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 323 flow [2023-08-29 20:34:09,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:09,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:09,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:34:09,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:09,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -868746358, now seen corresponding path program 1 times [2023-08-29 20:34:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208359516] [2023-08-29 20:34:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:10,086 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-29 20:34:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:10,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208359516] [2023-08-29 20:34:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208359516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:10,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609777668] [2023-08-29 20:34:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:10,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:10,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:10,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:34:10,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:10,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:10,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:34:10,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:10,986 INFO L130 PetriNetUnfolder]: 5224/8306 cut-off events. [2023-08-29 20:34:10,986 INFO L131 PetriNetUnfolder]: For 13638/13638 co-relation queries the response was YES. [2023-08-29 20:34:11,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30146 conditions, 8306 events. 5224/8306 cut-off events. For 13638/13638 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 53452 event pairs, 637 based on Foata normal form. 15/7367 useless extension candidates. Maximal degree in co-relation 30133. Up to 6473 conditions per place. [2023-08-29 20:34:11,031 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 85 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-29 20:34:11,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 729 flow [2023-08-29 20:34:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:34:11,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4402116402116402 [2023-08-29 20:34:11,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:34:11,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:34:11,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:11,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:34:11,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:11,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:11,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:11,036 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 323 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:34:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 729 flow [2023-08-29 20:34:11,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 683 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:11,052 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow [2023-08-29 20:34:11,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-29 20:34:11,052 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-08-29 20:34:11,053 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow [2023-08-29 20:34:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:11,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:11,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:11,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:34:11,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:11,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1425931802, now seen corresponding path program 1 times [2023-08-29 20:34:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686624142] [2023-08-29 20:34:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:11,253 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-29 20:34:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686624142] [2023-08-29 20:34:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686624142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021324874] [2023-08-29 20:34:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:11,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:11,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:34:11,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 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-29 20:34:11,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:11,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:34:11,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:12,800 INFO L130 PetriNetUnfolder]: 10160/14901 cut-off events. [2023-08-29 20:34:12,800 INFO L131 PetriNetUnfolder]: For 17311/17311 co-relation queries the response was YES. [2023-08-29 20:34:12,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53575 conditions, 14901 events. 10160/14901 cut-off events. For 17311/17311 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 90008 event pairs, 1632 based on Foata normal form. 90/13195 useless extension candidates. Maximal degree in co-relation 53562. Up to 8641 conditions per place. [2023-08-29 20:34:12,911 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 121 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-08-29 20:34:12,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 946 flow [2023-08-29 20:34:12,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-29 20:34:12,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373015873015873 [2023-08-29 20:34:12,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-29 20:34:12,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-29 20:34:12,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:12,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-29 20:34:12,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:12,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:12,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:12,917 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 4 states and 551 transitions. [2023-08-29 20:34:12,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 946 flow [2023-08-29 20:34:12,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:12,931 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 319 flow [2023-08-29 20:34:12,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-08-29 20:34:12,932 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -15 predicate places. [2023-08-29 20:34:12,932 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 319 flow [2023-08-29 20:34:12,932 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-29 20:34:12,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:12,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:34:12,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:12,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1865659524, now seen corresponding path program 1 times [2023-08-29 20:34:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832627695] [2023-08-29 20:34:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:13,716 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-29 20:34:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832627695] [2023-08-29 20:34:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832627695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856366637] [2023-08-29 20:34:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:13,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:14,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:34:14,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:14,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:14,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:34:14,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:15,914 INFO L130 PetriNetUnfolder]: 10061/15080 cut-off events. [2023-08-29 20:34:15,914 INFO L131 PetriNetUnfolder]: For 13728/13934 co-relation queries the response was YES. [2023-08-29 20:34:15,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54484 conditions, 15080 events. 10061/15080 cut-off events. For 13728/13934 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 100040 event pairs, 3937 based on Foata normal form. 19/13570 useless extension candidates. Maximal degree in co-relation 54470. Up to 9136 conditions per place. [2023-08-29 20:34:16,013 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 131 selfloop transitions, 23 changer transitions 0/158 dead transitions. [2023-08-29 20:34:16,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 1133 flow [2023-08-29 20:34:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:34:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:34:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2023-08-29 20:34:16,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37883597883597886 [2023-08-29 20:34:16,017 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2023-08-29 20:34:16,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2023-08-29 20:34:16,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:16,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2023-08-29 20:34:16,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:16,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:16,024 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:16,024 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 319 flow. Second operand 9 states and 1074 transitions. [2023-08-29 20:34:16,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 1133 flow [2023-08-29 20:34:16,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 158 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:16,043 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 522 flow [2023-08-29 20:34:16,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2023-08-29 20:34:16,044 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-29 20:34:16,044 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 522 flow [2023-08-29 20:34:16,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:16,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:16,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:34:16,045 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:16,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 475825609, now seen corresponding path program 1 times [2023-08-29 20:34:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301441079] [2023-08-29 20:34:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:16,382 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-29 20:34:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301441079] [2023-08-29 20:34:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301441079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:34:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128900109] [2023-08-29 20:34:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:34:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:34:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:34:16,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-29 20:34:16,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:16,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:16,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-29 20:34:16,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:18,460 INFO L130 PetriNetUnfolder]: 11328/17210 cut-off events. [2023-08-29 20:34:18,460 INFO L131 PetriNetUnfolder]: For 18453/18794 co-relation queries the response was YES. [2023-08-29 20:34:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62642 conditions, 17210 events. 11328/17210 cut-off events. For 18453/18794 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 117567 event pairs, 3456 based on Foata normal form. 425/16341 useless extension candidates. Maximal degree in co-relation 62625. Up to 7662 conditions per place. [2023-08-29 20:34:18,601 INFO L137 encePairwiseOnDemand]: 301/315 looper letters, 124 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2023-08-29 20:34:18,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1255 flow [2023-08-29 20:34:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:34:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:34:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-08-29 20:34:18,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3986394557823129 [2023-08-29 20:34:18,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-08-29 20:34:18,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-08-29 20:34:18,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:18,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-08-29 20:34:18,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,609 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,609 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 522 flow. Second operand 7 states and 879 transitions. [2023-08-29 20:34:18,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1255 flow [2023-08-29 20:34:18,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 152 transitions, 1234 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:18,743 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 779 flow [2023-08-29 20:34:18,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=779, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2023-08-29 20:34:18,743 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2023-08-29 20:34:18,744 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 779 flow [2023-08-29 20:34:18,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:18,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:18,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:34:18,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:18,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1131168354, now seen corresponding path program 1 times [2023-08-29 20:34:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036207461] [2023-08-29 20:34:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:18,971 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-29 20:34:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036207461] [2023-08-29 20:34:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036207461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:18,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:18,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054994949] [2023-08-29 20:34:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:18,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:18,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:18,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:34:18,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:18,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:34:18,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:22,340 INFO L130 PetriNetUnfolder]: 22415/33142 cut-off events. [2023-08-29 20:34:22,340 INFO L131 PetriNetUnfolder]: For 77461/77461 co-relation queries the response was YES. [2023-08-29 20:34:22,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133569 conditions, 33142 events. 22415/33142 cut-off events. For 77461/77461 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 226574 event pairs, 4958 based on Foata normal form. 192/31532 useless extension candidates. Maximal degree in co-relation 133548. Up to 19909 conditions per place. [2023-08-29 20:34:22,588 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 210 selfloop transitions, 4 changer transitions 1/215 dead transitions. [2023-08-29 20:34:22,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 215 transitions, 2339 flow [2023-08-29 20:34:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-29 20:34:22,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44206349206349205 [2023-08-29 20:34:22,590 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-29 20:34:22,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-29 20:34:22,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:22,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-29 20:34:22,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,595 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 779 flow. Second operand 4 states and 557 transitions. [2023-08-29 20:34:22,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 215 transitions, 2339 flow [2023-08-29 20:34:22,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 215 transitions, 2315 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-29 20:34:22,924 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 789 flow [2023-08-29 20:34:22,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2023-08-29 20:34:22,925 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-29 20:34:22,925 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 789 flow [2023-08-29 20:34:22,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:22,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:22,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:34:22,926 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:22,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1239144996, now seen corresponding path program 2 times [2023-08-29 20:34:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528117419] [2023-08-29 20:34:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:23,155 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-29 20:34:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528117419] [2023-08-29 20:34:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528117419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:23,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867432954] [2023-08-29 20:34:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:23,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:23,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:23,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-29 20:34:23,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:23,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-29 20:34:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:27,743 INFO L130 PetriNetUnfolder]: 28179/41814 cut-off events. [2023-08-29 20:34:27,743 INFO L131 PetriNetUnfolder]: For 89425/89425 co-relation queries the response was YES. [2023-08-29 20:34:27,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170362 conditions, 41814 events. 28179/41814 cut-off events. For 89425/89425 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 298199 event pairs, 8809 based on Foata normal form. 30/39378 useless extension candidates. Maximal degree in co-relation 170339. Up to 24501 conditions per place. [2023-08-29 20:34:28,061 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 140 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2023-08-29 20:34:28,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 143 transitions, 1528 flow [2023-08-29 20:34:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-29 20:34:28,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44656084656084655 [2023-08-29 20:34:28,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-29 20:34:28,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-29 20:34:28,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:28,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-29 20:34:28,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:28,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:28,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:28,065 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 789 flow. Second operand 3 states and 422 transitions. [2023-08-29 20:34:28,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 143 transitions, 1528 flow [2023-08-29 20:34:28,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 143 transitions, 1522 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:28,651 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 795 flow [2023-08-29 20:34:28,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2023-08-29 20:34:28,652 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2023-08-29 20:34:28,652 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 795 flow [2023-08-29 20:34:28,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:28,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:28,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:34:28,653 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:28,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1865696175, now seen corresponding path program 1 times [2023-08-29 20:34:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654488436] [2023-08-29 20:34:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:28,748 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-29 20:34:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654488436] [2023-08-29 20:34:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654488436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:28,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179531199] [2023-08-29 20:34:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:28,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:28,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-29 20:34:28,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 795 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:28,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:28,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-29 20:34:28,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:33,239 INFO L130 PetriNetUnfolder]: 24362/37562 cut-off events. [2023-08-29 20:34:33,240 INFO L131 PetriNetUnfolder]: For 89487/90149 co-relation queries the response was YES. [2023-08-29 20:34:33,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151312 conditions, 37562 events. 24362/37562 cut-off events. For 89487/90149 co-relation queries the response was YES. Maximal size of possible extension queue 2294. Compared 289504 event pairs, 10577 based on Foata normal form. 1671/36581 useless extension candidates. Maximal degree in co-relation 151288. Up to 26643 conditions per place. [2023-08-29 20:34:33,795 INFO L137 encePairwiseOnDemand]: 299/315 looper letters, 67 selfloop transitions, 24 changer transitions 32/127 dead transitions. [2023-08-29 20:34:33,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 1335 flow [2023-08-29 20:34:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-29 20:34:33,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103174603174603 [2023-08-29 20:34:33,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-29 20:34:33,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-29 20:34:33,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:33,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-29 20:34:33,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:33,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:33,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:33,801 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 795 flow. Second operand 4 states and 517 transitions. [2023-08-29 20:34:33,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 1335 flow [2023-08-29 20:34:34,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1330 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:34,628 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 837 flow [2023-08-29 20:34:34,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=837, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2023-08-29 20:34:34,628 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2023-08-29 20:34:34,628 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 837 flow [2023-08-29 20:34:34,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:34,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:34,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:34,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:34:34,629 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:34,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 204004246, now seen corresponding path program 2 times [2023-08-29 20:34:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743407136] [2023-08-29 20:34:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:35,181 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-29 20:34:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:35,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743407136] [2023-08-29 20:34:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743407136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:35,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269030152] [2023-08-29 20:34:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:35,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:35,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:34:35,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 837 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:35,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:35,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:34:35,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:38,449 INFO L130 PetriNetUnfolder]: 15826/24795 cut-off events. [2023-08-29 20:34:38,449 INFO L131 PetriNetUnfolder]: For 76994/77621 co-relation queries the response was YES. [2023-08-29 20:34:38,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108225 conditions, 24795 events. 15826/24795 cut-off events. For 76994/77621 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 183924 event pairs, 8611 based on Foata normal form. 645/24591 useless extension candidates. Maximal degree in co-relation 108199. Up to 11747 conditions per place. [2023-08-29 20:34:38,825 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 90 selfloop transitions, 7 changer transitions 59/160 dead transitions. [2023-08-29 20:34:38,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 160 transitions, 1534 flow [2023-08-29 20:34:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 942 transitions. [2023-08-29 20:34:38,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738095238095238 [2023-08-29 20:34:38,828 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 942 transitions. [2023-08-29 20:34:38,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 942 transitions. [2023-08-29 20:34:38,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:38,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 942 transitions. [2023-08-29 20:34:38,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:38,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:38,833 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:38,833 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 837 flow. Second operand 8 states and 942 transitions. [2023-08-29 20:34:38,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 160 transitions, 1534 flow [2023-08-29 20:34:39,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 160 transitions, 1466 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:39,067 INFO L231 Difference]: Finished difference. Result has 98 places, 76 transitions, 666 flow [2023-08-29 20:34:39,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=98, PETRI_TRANSITIONS=76} [2023-08-29 20:34:39,068 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2023-08-29 20:34:39,068 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 76 transitions, 666 flow [2023-08-29 20:34:39,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:39,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:39,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:34:39,069 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:39,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1666258254, now seen corresponding path program 1 times [2023-08-29 20:34:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460765897] [2023-08-29 20:34:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:39,291 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-29 20:34:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460765897] [2023-08-29 20:34:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460765897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:39,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056712732] [2023-08-29 20:34:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:39,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:34:39,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 76 transitions, 666 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:39,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:39,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:34:39,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:42,829 INFO L130 PetriNetUnfolder]: 19298/29607 cut-off events. [2023-08-29 20:34:42,829 INFO L131 PetriNetUnfolder]: For 76963/76963 co-relation queries the response was YES. [2023-08-29 20:34:42,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117649 conditions, 29607 events. 19298/29607 cut-off events. For 76963/76963 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 211333 event pairs, 5303 based on Foata normal form. 90/29177 useless extension candidates. Maximal degree in co-relation 117622. Up to 15184 conditions per place. [2023-08-29 20:34:43,006 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 107 selfloop transitions, 3 changer transitions 45/155 dead transitions. [2023-08-29 20:34:43,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 155 transitions, 1528 flow [2023-08-29 20:34:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-29 20:34:43,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42984126984126986 [2023-08-29 20:34:43,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-29 20:34:43,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-29 20:34:43,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:43,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-29 20:34:43,009 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-29 20:34:43,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:43,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:43,011 INFO L175 Difference]: Start difference. First operand has 98 places, 76 transitions, 666 flow. Second operand 5 states and 677 transitions. [2023-08-29 20:34:43,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 155 transitions, 1528 flow [2023-08-29 20:34:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 155 transitions, 1329 flow, removed 64 selfloop flow, removed 9 redundant places. [2023-08-29 20:34:43,280 INFO L231 Difference]: Finished difference. Result has 93 places, 74 transitions, 569 flow [2023-08-29 20:34:43,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=569, PETRI_PLACES=93, PETRI_TRANSITIONS=74} [2023-08-29 20:34:43,280 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2023-08-29 20:34:43,280 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 74 transitions, 569 flow [2023-08-29 20:34:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:43,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:43,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:34:43,281 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:43,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1730808728, now seen corresponding path program 2 times [2023-08-29 20:34:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905935177] [2023-08-29 20:34:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:44,414 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-29 20:34:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905935177] [2023-08-29 20:34:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905935177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:34:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299182821] [2023-08-29 20:34:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:44,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:34:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:34:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:34:44,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:34:44,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 569 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:44,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:44,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:34:44,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:47,244 INFO L130 PetriNetUnfolder]: 12635/19954 cut-off events. [2023-08-29 20:34:47,244 INFO L131 PetriNetUnfolder]: For 37030/37608 co-relation queries the response was YES. [2023-08-29 20:34:47,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72550 conditions, 19954 events. 12635/19954 cut-off events. For 37030/37608 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 147272 event pairs, 5970 based on Foata normal form. 104/19138 useless extension candidates. Maximal degree in co-relation 72525. Up to 19267 conditions per place. [2023-08-29 20:34:47,351 INFO L137 encePairwiseOnDemand]: 304/315 looper letters, 77 selfloop transitions, 15 changer transitions 16/112 dead transitions. [2023-08-29 20:34:47,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 112 transitions, 955 flow [2023-08-29 20:34:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 930 transitions. [2023-08-29 20:34:47,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2023-08-29 20:34:47,354 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 930 transitions. [2023-08-29 20:34:47,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 930 transitions. [2023-08-29 20:34:47,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:47,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 930 transitions. [2023-08-29 20:34:47,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.25) internal successors, (930), 8 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:47,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:47,358 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:47,358 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 569 flow. Second operand 8 states and 930 transitions. [2023-08-29 20:34:47,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 112 transitions, 955 flow [2023-08-29 20:34:47,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 112 transitions, 935 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:34:47,474 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 669 flow [2023-08-29 20:34:47,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2023-08-29 20:34:47,475 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 17 predicate places. [2023-08-29 20:34:47,475 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 669 flow [2023-08-29 20:34:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:47,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:47,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:34:47,475 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:47,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 60636385, now seen corresponding path program 1 times [2023-08-29 20:34:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158972078] [2023-08-29 20:34:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:47,696 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-29 20:34:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158972078] [2023-08-29 20:34:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158972078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:34:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417235619] [2023-08-29 20:34:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:47,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:34:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:34:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:34:47,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-29 20:34:47,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 669 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:47,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:47,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-29 20:34:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:49,622 INFO L130 PetriNetUnfolder]: 9664/15173 cut-off events. [2023-08-29 20:34:49,622 INFO L131 PetriNetUnfolder]: For 37636/38239 co-relation queries the response was YES. [2023-08-29 20:34:49,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56597 conditions, 15173 events. 9664/15173 cut-off events. For 37636/38239 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 105881 event pairs, 4937 based on Foata normal form. 222/14929 useless extension candidates. Maximal degree in co-relation 56570. Up to 11113 conditions per place. [2023-08-29 20:34:49,681 INFO L137 encePairwiseOnDemand]: 303/315 looper letters, 75 selfloop transitions, 7 changer transitions 21/107 dead transitions. [2023-08-29 20:34:49,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 998 flow [2023-08-29 20:34:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-29 20:34:49,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39301587301587304 [2023-08-29 20:34:49,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-29 20:34:49,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-29 20:34:49,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:49,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-29 20:34:49,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:49,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:49,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:49,685 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 669 flow. Second operand 5 states and 619 transitions. [2023-08-29 20:34:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 998 flow [2023-08-29 20:34:49,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 977 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:49,731 INFO L231 Difference]: Finished difference. Result has 99 places, 62 transitions, 470 flow [2023-08-29 20:34:49,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=99, PETRI_TRANSITIONS=62} [2023-08-29 20:34:49,732 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2023-08-29 20:34:49,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 62 transitions, 470 flow [2023-08-29 20:34:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:49,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:49,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:34:49,733 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:49,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1629313202, now seen corresponding path program 1 times [2023-08-29 20:34:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888345080] [2023-08-29 20:34:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:50,019 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-29 20:34:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888345080] [2023-08-29 20:34:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888345080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054593286] [2023-08-29 20:34:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:50,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 315 [2023-08-29 20:34:50,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 62 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:50,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:50,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 315 [2023-08-29 20:34:50,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:51,371 INFO L130 PetriNetUnfolder]: 4948/8469 cut-off events. [2023-08-29 20:34:51,372 INFO L131 PetriNetUnfolder]: For 24173/24381 co-relation queries the response was YES. [2023-08-29 20:34:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31084 conditions, 8469 events. 4948/8469 cut-off events. For 24173/24381 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 62002 event pairs, 838 based on Foata normal form. 752/9098 useless extension candidates. Maximal degree in co-relation 31055. Up to 6066 conditions per place. [2023-08-29 20:34:51,402 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 74 selfloop transitions, 4 changer transitions 35/117 dead transitions. [2023-08-29 20:34:51,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 1035 flow [2023-08-29 20:34:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-29 20:34:51,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42158730158730157 [2023-08-29 20:34:51,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-29 20:34:51,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-29 20:34:51,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:51,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-29 20:34:51,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:51,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:51,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:51,408 INFO L175 Difference]: Start difference. First operand has 99 places, 62 transitions, 470 flow. Second operand 5 states and 664 transitions. [2023-08-29 20:34:51,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 1035 flow [2023-08-29 20:34:51,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 117 transitions, 973 flow, removed 13 selfloop flow, removed 9 redundant places. [2023-08-29 20:34:51,431 INFO L231 Difference]: Finished difference. Result has 93 places, 64 transitions, 457 flow [2023-08-29 20:34:51,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=93, PETRI_TRANSITIONS=64} [2023-08-29 20:34:51,432 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2023-08-29 20:34:51,432 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 457 flow [2023-08-29 20:34:51,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:51,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:51,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:51,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:34:51,433 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:51,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash -445731318, now seen corresponding path program 1 times [2023-08-29 20:34:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970156628] [2023-08-29 20:34:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:51,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:53,070 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-29 20:34:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970156628] [2023-08-29 20:34:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970156628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882883962] [2023-08-29 20:34:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:53,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:53,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:34:53,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 108.77777777777777) internal successors, (979), 9 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:53,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:53,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:34:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:54,362 INFO L130 PetriNetUnfolder]: 3885/6713 cut-off events. [2023-08-29 20:34:54,362 INFO L131 PetriNetUnfolder]: For 18093/18250 co-relation queries the response was YES. [2023-08-29 20:34:54,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29120 conditions, 6713 events. 3885/6713 cut-off events. For 18093/18250 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 47692 event pairs, 1169 based on Foata normal form. 97/6690 useless extension candidates. Maximal degree in co-relation 29092. Up to 5086 conditions per place. [2023-08-29 20:34:54,394 INFO L137 encePairwiseOnDemand]: 304/315 looper letters, 65 selfloop transitions, 17 changer transitions 15/101 dead transitions. [2023-08-29 20:34:54,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 842 flow [2023-08-29 20:34:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 927 transitions. [2023-08-29 20:34:54,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2023-08-29 20:34:54,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 927 transitions. [2023-08-29 20:34:54,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 927 transitions. [2023-08-29 20:34:54,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:54,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 927 transitions. [2023-08-29 20:34:54,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:54,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:54,400 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:54,400 INFO L175 Difference]: Start difference. First operand has 93 places, 64 transitions, 457 flow. Second operand 8 states and 927 transitions. [2023-08-29 20:34:54,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 842 flow [2023-08-29 20:34:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 101 transitions, 825 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:54,457 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 511 flow [2023-08-29 20:34:54,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2023-08-29 20:34:54,458 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2023-08-29 20:34:54,458 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 511 flow [2023-08-29 20:34:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.77777777777777) internal successors, (979), 9 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:54,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:54,458 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-29 20:34:54,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:34:54,458 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:54,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1461929675, now seen corresponding path program 1 times [2023-08-29 20:34:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757061109] [2023-08-29 20:34:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:54,885 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-29 20:34:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757061109] [2023-08-29 20:34:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757061109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:54,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:34:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002259660] [2023-08-29 20:34:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:54,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:34:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:54,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:34:54,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:34:55,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:34:55,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 65 transitions, 511 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:55,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:55,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:34:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:56,333 INFO L130 PetriNetUnfolder]: 3580/6230 cut-off events. [2023-08-29 20:34:56,334 INFO L131 PetriNetUnfolder]: For 21208/21250 co-relation queries the response was YES. [2023-08-29 20:34:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27842 conditions, 6230 events. 3580/6230 cut-off events. For 21208/21250 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 43715 event pairs, 1034 based on Foata normal form. 122/6346 useless extension candidates. Maximal degree in co-relation 27813. Up to 5051 conditions per place. [2023-08-29 20:34:56,363 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 37 selfloop transitions, 6 changer transitions 66/111 dead transitions. [2023-08-29 20:34:56,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 111 transitions, 1028 flow [2023-08-29 20:34:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:34:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:34:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2023-08-29 20:34:56,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36261022927689596 [2023-08-29 20:34:56,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1028 transitions. [2023-08-29 20:34:56,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1028 transitions. [2023-08-29 20:34:56,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:56,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1028 transitions. [2023-08-29 20:34:56,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:56,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:56,369 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:56,369 INFO L175 Difference]: Start difference. First operand has 98 places, 65 transitions, 511 flow. Second operand 9 states and 1028 transitions. [2023-08-29 20:34:56,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 111 transitions, 1028 flow [2023-08-29 20:34:56,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 968 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-08-29 20:34:56,445 INFO L231 Difference]: Finished difference. Result has 90 places, 40 transitions, 310 flow [2023-08-29 20:34:56,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=90, PETRI_TRANSITIONS=40} [2023-08-29 20:34:56,446 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places. [2023-08-29 20:34:56,446 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 40 transitions, 310 flow [2023-08-29 20:34:56,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:56,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:56,446 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-29 20:34:56,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:34:56,447 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:56,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2080176668, now seen corresponding path program 1 times [2023-08-29 20:34:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63332263] [2023-08-29 20:34:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:58,168 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-29 20:34:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63332263] [2023-08-29 20:34:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63332263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:34:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310578506] [2023-08-29 20:34:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:58,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:34:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:34:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:34:58,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 315 [2023-08-29 20:34:58,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 40 transitions, 310 flow. Second operand has 11 states, 11 states have (on average 104.54545454545455) internal successors, (1150), 11 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:58,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:58,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 315 [2023-08-29 20:34:58,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:58,835 INFO L130 PetriNetUnfolder]: 440/773 cut-off events. [2023-08-29 20:34:58,836 INFO L131 PetriNetUnfolder]: For 3610/3614 co-relation queries the response was YES. [2023-08-29 20:34:58,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 773 events. 440/773 cut-off events. For 3610/3614 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3333 event pairs, 80 based on Foata normal form. 14/787 useless extension candidates. Maximal degree in co-relation 3725. Up to 469 conditions per place. [2023-08-29 20:34:58,841 INFO L137 encePairwiseOnDemand]: 306/315 looper letters, 39 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2023-08-29 20:34:58,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 59 transitions, 532 flow [2023-08-29 20:34:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:34:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:34:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2023-08-29 20:34:58,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34325396825396826 [2023-08-29 20:34:58,844 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2023-08-29 20:34:58,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2023-08-29 20:34:58,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:58,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2023-08-29 20:34:58,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:58,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:58,848 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:58,848 INFO L175 Difference]: Start difference. First operand has 90 places, 40 transitions, 310 flow. Second operand 8 states and 865 transitions. [2023-08-29 20:34:58,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 59 transitions, 532 flow [2023-08-29 20:34:58,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 442 flow, removed 18 selfloop flow, removed 22 redundant places. [2023-08-29 20:34:58,854 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 307 flow [2023-08-29 20:34:58,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-08-29 20:34:58,855 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -13 predicate places. [2023-08-29 20:34:58,855 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 307 flow [2023-08-29 20:34:58,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.54545454545455) internal successors, (1150), 11 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:58,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:58,856 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-29 20:34:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:34:58,856 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:58,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1754386111, now seen corresponding path program 1 times [2023-08-29 20:34:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233214881] [2023-08-29 20:34:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:59,164 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-29 20:34:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:34:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233214881] [2023-08-29 20:34:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233214881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:59,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:34:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181819456] [2023-08-29 20:34:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:59,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:34:59,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:59,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:34:59,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:59,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:59,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:34:59,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:59,342 INFO L130 PetriNetUnfolder]: 284/552 cut-off events. [2023-08-29 20:34:59,342 INFO L131 PetriNetUnfolder]: For 1604/1608 co-relation queries the response was YES. [2023-08-29 20:34:59,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 552 events. 284/552 cut-off events. For 1604/1608 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2494 event pairs, 22 based on Foata normal form. 74/626 useless extension candidates. Maximal degree in co-relation 2478. Up to 228 conditions per place. [2023-08-29 20:34:59,344 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 53 selfloop transitions, 7 changer transitions 22/84 dead transitions. [2023-08-29 20:34:59,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 774 flow [2023-08-29 20:34:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:34:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:34:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-29 20:34:59,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068783068783069 [2023-08-29 20:34:59,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-29 20:34:59,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-29 20:34:59,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:59,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-29 20:34:59,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:59,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:59,349 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:59,349 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 307 flow. Second operand 6 states and 769 transitions. [2023-08-29 20:34:59,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 774 flow [2023-08-29 20:34:59,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 714 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-08-29 20:34:59,352 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 315 flow [2023-08-29 20:34:59,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-29 20:34:59,353 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2023-08-29 20:34:59,353 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 315 flow [2023-08-29 20:34:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:59,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:59,353 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-29 20:34:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:34:59,353 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:34:59,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -243486213, now seen corresponding path program 1 times [2023-08-29 20:34:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:34:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008983879] [2023-08-29 20:34:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:34:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:01,565 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-29 20:35:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008983879] [2023-08-29 20:35:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008983879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:01,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:01,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:35:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729882636] [2023-08-29 20:35:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:35:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:35:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:35:01,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 315 [2023-08-29 20:35:01,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 315 flow. Second operand has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:01,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:01,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 315 [2023-08-29 20:35:01,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:02,116 INFO L130 PetriNetUnfolder]: 200/413 cut-off events. [2023-08-29 20:35:02,116 INFO L131 PetriNetUnfolder]: For 1215/1219 co-relation queries the response was YES. [2023-08-29 20:35:02,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 413 events. 200/413 cut-off events. For 1215/1219 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1659 event pairs, 34 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 2011. Up to 221 conditions per place. [2023-08-29 20:35:02,118 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 45 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2023-08-29 20:35:02,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 576 flow [2023-08-29 20:35:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:35:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:35:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2023-08-29 20:35:02,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34325396825396826 [2023-08-29 20:35:02,119 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2023-08-29 20:35:02,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2023-08-29 20:35:02,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:02,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2023-08-29 20:35:02,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,123 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,123 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 315 flow. Second operand 8 states and 865 transitions. [2023-08-29 20:35:02,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 576 flow [2023-08-29 20:35:02,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 509 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-29 20:35:02,128 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 342 flow [2023-08-29 20:35:02,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=342, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2023-08-29 20:35:02,128 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-29 20:35:02,129 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 342 flow [2023-08-29 20:35:02,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:02,129 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-29 20:35:02,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 20:35:02,129 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:02,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 830080289, now seen corresponding path program 1 times [2023-08-29 20:35:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:02,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544482580] [2023-08-29 20:35:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:02,436 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-29 20:35:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:35:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544482580] [2023-08-29 20:35:02,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544482580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:02,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:02,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:35:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685688254] [2023-08-29 20:35:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:02,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:35:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:35:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:35:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:35:02,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:35:02,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:02,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:35:02,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:02,567 INFO L130 PetriNetUnfolder]: 166/344 cut-off events. [2023-08-29 20:35:02,567 INFO L131 PetriNetUnfolder]: For 1116/1120 co-relation queries the response was YES. [2023-08-29 20:35:02,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 344 events. 166/344 cut-off events. For 1116/1120 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1363 event pairs, 16 based on Foata normal form. 26/370 useless extension candidates. Maximal degree in co-relation 1651. Up to 130 conditions per place. [2023-08-29 20:35:02,569 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 53 selfloop transitions, 10 changer transitions 11/76 dead transitions. [2023-08-29 20:35:02,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 76 transitions, 747 flow [2023-08-29 20:35:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:35:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:35:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-29 20:35:02,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3981859410430839 [2023-08-29 20:35:02,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-29 20:35:02,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-29 20:35:02,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:02,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-29 20:35:02,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,573 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,573 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 342 flow. Second operand 7 states and 878 transitions. [2023-08-29 20:35:02,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 76 transitions, 747 flow [2023-08-29 20:35:02,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 660 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-29 20:35:02,577 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 304 flow [2023-08-29 20:35:02,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-08-29 20:35:02,577 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-29 20:35:02,578 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 304 flow [2023-08-29 20:35:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:02,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:02,578 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-29 20:35:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 20:35:02,579 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:02,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2098302538, now seen corresponding path program 1 times [2023-08-29 20:35:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:35:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101396865] [2023-08-29 20:35:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:35:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:35:02,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:35:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:35:02,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:35:02,775 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:35:02,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-29 20:35:02,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-29 20:35:02,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-29 20:35:02,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-29 20:35:02,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-29 20:35:02,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-29 20:35:02,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-29 20:35:02,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-29 20:35:02,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-29 20:35:02,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-29 20:35:02,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-29 20:35:02,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-29 20:35:02,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-29 20:35:02,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-29 20:35:02,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-29 20:35:02,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-29 20:35:02,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-29 20:35:02,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-29 20:35:02,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-29 20:35:02,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-29 20:35:02,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 20:35:02,790 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 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-29 20:35:02,795 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:35:02,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:35:02,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:35:02 BasicIcfg [2023-08-29 20:35:02,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:35:02,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:35:02,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:35:02,859 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:35:02,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:29" (3/4) ... [2023-08-29 20:35:02,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:35:02,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:35:02,862 INFO L158 Benchmark]: Toolchain (without parser) took 95208.99ms. Allocated memory was 73.4MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 39.4MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:35:02,862 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:35:02,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.52ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 32.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-08-29 20:35:02,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.74ms. Allocated memory is still 73.4MB. Free memory was 32.3MB in the beginning and 29.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:35:02,863 INFO L158 Benchmark]: Boogie Preprocessor took 65.99ms. Allocated memory is still 73.4MB. Free memory was 29.5MB in the beginning and 50.9MB in the end (delta: -21.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:35:02,863 INFO L158 Benchmark]: RCFGBuilder took 1423.96ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 50.9MB in the beginning and 82.4MB in the end (delta: -31.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2023-08-29 20:35:02,863 INFO L158 Benchmark]: TraceAbstraction took 93160.68ms. Allocated memory was 115.3MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 82.3MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:35:02,864 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 9.3GB. Free memory is still 6.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:35:02,865 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.23ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.52ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 32.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.74ms. Allocated memory is still 73.4MB. Free memory was 32.3MB in the beginning and 29.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.99ms. Allocated memory is still 73.4MB. Free memory was 29.5MB in the beginning and 50.9MB in the end (delta: -21.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1423.96ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 50.9MB in the beginning and 82.4MB in the end (delta: -31.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 93160.68ms. Allocated memory was 115.3MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 82.3MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 9.3GB. Free memory is still 6.7GB. 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: 11.8s, 176 PlacesBefore, 80 PlacesAfterwards, 168 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 31207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8750, independent: 8192, independent conditional: 0, independent unconditional: 8192, dependent: 558, dependent conditional: 0, dependent unconditional: 558, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2782, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8750, independent: 5511, independent conditional: 0, independent unconditional: 5511, dependent: 457, dependent conditional: 0, dependent unconditional: 457, unknown: 2782, unknown conditional: 0, unknown unconditional: 2782] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 487, Positive conditional cache size: 0, Positive unconditional cache size: 487, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-2, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=-1, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 75 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: 92.9s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 67.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3068 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2408 mSDsluCounter, 1226 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7743 IncrementalHoareTripleChecker+Invalid, 8273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 101 mSDtfsCounter, 7743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=18, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 5510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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-29 20:35:02,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:35:05,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:35:05,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:35:05,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:35:05,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:35:05,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:35:05,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:35:05,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:35:05,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:35:05,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:35:05,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:35:05,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:35:05,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:35:05,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:35:05,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:35:05,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:35:05,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:35:05,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:35:05,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:35:05,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:35:05,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:35:05,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:35:05,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:35:05,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:35:05,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:35:05,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:35:05,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:35:05,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:35:05,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:35:05,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:35:05,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:35:05,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:35:05,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:35:05,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:35:05,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:35:05,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:35:05,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:35:05,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:35:05,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:35:05,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:35:05,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:35:05,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:35:05,533 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:35:05,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:35:05,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:35:05,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:35:05,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:35:05,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:35:05,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:35:05,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:35:05,537 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:35:05,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:35:05,538 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:35:05,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:35:05,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:35:05,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:35:05,540 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:35:05,540 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:35:05,540 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:35:05,540 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:35:05,540 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:35:05,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:35:05,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:35:05,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:35:05,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:35:05,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:35:05,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:35:05,542 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:35:05,542 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:35:05,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:35:05,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:35:05,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:35:05,543 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:35:05,543 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:35:05,543 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 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 -> AFTER [2023-08-29 20:35:05,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:35:05,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:35:05,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:35:05,863 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:35:05,863 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:35:05,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-29 20:35:07,087 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:35:07,419 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:35:07,420 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-29 20:35:07,436 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7423a0650/0aa7635ef36d4eaf9bd5903da63a93c4/FLAG3ff328a87 [2023-08-29 20:35:07,453 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7423a0650/0aa7635ef36d4eaf9bd5903da63a93c4 [2023-08-29 20:35:07,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:35:07,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:35:07,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:35:07,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:35:07,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:35:07,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:35:07" (1/1) ... [2023-08-29 20:35:07,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796bd56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:07, skipping insertion in model container [2023-08-29 20:35:07,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:35:07" (1/1) ... [2023-08-29 20:35:07,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:35:07,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:35:07,703 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/safe000_power.opt.i[951,964] [2023-08-29 20:35:07,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:35:07,894 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:35:07,953 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/safe000_power.opt.i[951,964] [2023-08-29 20:35:07,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:35:08,027 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:35:08,027 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:35:08,033 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:35:08,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08 WrapperNode [2023-08-29 20:35:08,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:35:08,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:35:08,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:35:08,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:35:08,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,092 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-08-29 20:35:08,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:35:08,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:35:08,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:35:08,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:35:08,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:35:08,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:35:08,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:35:08,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:35:08,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (1/1) ... [2023-08-29 20:35:08,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:35:08,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:35:08,186 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-29 20:35:08,211 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-29 20:35:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:35:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:35:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:35:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:35:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:35:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:35:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:35:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:35:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:35:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:35:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:35:08,229 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:35:08,460 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:35:08,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:35:08,985 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:35:09,582 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:35:09,583 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:35:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:09 BoogieIcfgContainer [2023-08-29 20:35:09,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:35:09,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:35:09,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:35:09,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:35:09,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:35:07" (1/3) ... [2023-08-29 20:35:09,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d730b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:35:09, skipping insertion in model container [2023-08-29 20:35:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:35:08" (2/3) ... [2023-08-29 20:35:09,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d730b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:35:09, skipping insertion in model container [2023-08-29 20:35:09,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:09" (3/3) ... [2023-08-29 20:35:09,592 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-29 20:35:09,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:35:09,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-29 20:35:09,608 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:35:09,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:35:09,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:35:09,883 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:35:09,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:09,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:35:09,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:35:09,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-29 20:35:09,901 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:35:09,912 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:35:09,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:35:09,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-29 20:35:09,979 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:35:09,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:09,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:35:09,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-29 20:35:30,277 INFO L134 LiptonReduction]: Checked pairs total: 30947 [2023-08-29 20:35:30,277 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-08-29 20:35:30,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:35:30,295 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;@40e553cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:35:30,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-29 20:35:30,296 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:35:30,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:30,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:30,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:35:30,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:30,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1123, now seen corresponding path program 1 times [2023-08-29 20:35:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532196980] [2023-08-29 20:35:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:30,312 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-29 20:35:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:30,319 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-29 20:35:30,324 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-29 20:35:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:30,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:35:30,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:30,444 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-29 20:35:30,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:30,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532196980] [2023-08-29 20:35:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532196980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:35:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713369649] [2023-08-29 20:35:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:35:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:30,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:35:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:35:30,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-29 20:35:30,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:30,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:30,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-29 20:35:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:35,935 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-29 20:35:35,935 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:35:35,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3439. Compared 317009 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-29 20:35:36,205 INFO L137 encePairwiseOnDemand]: 300/321 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:35:36,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-29 20:35:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:35:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:35:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2023-08-29 20:35:36,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49221183800623053 [2023-08-29 20:35:36,223 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2023-08-29 20:35:36,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2023-08-29 20:35:36,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:36,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2023-08-29 20:35:36,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:36,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:36,351 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:36,353 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 316 transitions. [2023-08-29 20:35:36,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-29 20:35:36,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:35:36,368 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-29 20:35:36,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 20:35:36,373 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:35:36,374 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-29 20:35:36,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:36,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:36,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:35:36,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:35:36,585 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-29 20:35:36,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:36,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 34424004, now seen corresponding path program 1 times [2023-08-29 20:35:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394062958] [2023-08-29 20:35:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:36,587 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-29 20:35:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:36,589 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-29 20:35:36,591 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-29 20:35:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:36,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:35:36,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:36,724 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-29 20:35:36,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:36,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394062958] [2023-08-29 20:35:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394062958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580661694] [2023-08-29 20:35:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:36,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:36,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:36,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-29 20:35:36,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:36,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:36,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-29 20:35:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:40,744 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-29 20:35:40,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:35:40,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3081. Compared 302963 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-29 20:35:40,941 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-29 20:35:40,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-29 20:35:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-29 20:35:40,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936656282450673 [2023-08-29 20:35:40,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-29 20:35:40,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-29 20:35:40,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:40,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-29 20:35:40,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:40,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:40,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:40,949 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 452 transitions. [2023-08-29 20:35:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-29 20:35:40,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:35:40,951 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-29 20:35:40,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 20:35:40,952 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-29 20:35:40,952 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-29 20:35:40,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:40,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:40,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:35:40,965 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-29 20:35:41,162 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-29 20:35:41,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:41,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145048, now seen corresponding path program 1 times [2023-08-29 20:35:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760606638] [2023-08-29 20:35:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:41,164 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-29 20:35:41,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:41,165 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-29 20:35:41,175 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-29 20:35:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:41,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:35:41,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:41,281 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-29 20:35:41,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:41,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760606638] [2023-08-29 20:35:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760606638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:35:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982582783] [2023-08-29 20:35:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:41,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-29 20:35:41,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:41,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:41,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-29 20:35:41,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:46,432 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-29 20:35:46,433 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-29 20:35:46,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4161. Compared 381975 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-29 20:35:46,708 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-29 20:35:46,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-29 20:35:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-29 20:35:46,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2023-08-29 20:35:46,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-29 20:35:46,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-29 20:35:46,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:46,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-29 20:35:46,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:46,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:46,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:46,720 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 453 transitions. [2023-08-29 20:35:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-29 20:35:46,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:46,724 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-29 20:35:46,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-29 20:35:46,725 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:35:46,725 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-29 20:35:46,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:46,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:46,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:35:46,741 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-29 20:35:46,935 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-29 20:35:46,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:46,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145050, now seen corresponding path program 1 times [2023-08-29 20:35:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75225574] [2023-08-29 20:35:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:46,937 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-29 20:35:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:46,938 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-29 20:35:46,942 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-29 20:35:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:47,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:35:47,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:47,111 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 20:35:47,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-29 20:35:47,152 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-29 20:35:47,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:47,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75225574] [2023-08-29 20:35:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75225574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768572822] [2023-08-29 20:35:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:47,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:47,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-29 20:35:47,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:47,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:47,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-29 20:35:47,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:50,227 INFO L130 PetriNetUnfolder]: 18173/25645 cut-off events. [2023-08-29 20:35:50,227 INFO L131 PetriNetUnfolder]: For 6146/6261 co-relation queries the response was YES. [2023-08-29 20:35:50,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 25645 events. 18173/25645 cut-off events. For 6146/6261 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 173052 event pairs, 10086 based on Foata normal form. 0/17231 useless extension candidates. Maximal degree in co-relation 58994. Up to 13595 conditions per place. [2023-08-29 20:35:50,347 INFO L137 encePairwiseOnDemand]: 310/321 looper letters, 68 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-29 20:35:50,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 347 flow [2023-08-29 20:35:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-29 20:35:50,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44963655244029077 [2023-08-29 20:35:50,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-29 20:35:50,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-29 20:35:50,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:50,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-29 20:35:50,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:50,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:50,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:50,354 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 3 states and 433 transitions. [2023-08-29 20:35:50,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 347 flow [2023-08-29 20:35:50,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:35:50,388 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 154 flow [2023-08-29 20:35:50,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 20:35:50,389 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:35:50,390 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 154 flow [2023-08-29 20:35:50,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:50,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:50,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:35:50,406 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-29 20:35:50,606 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-29 20:35:50,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:50,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145051, now seen corresponding path program 1 times [2023-08-29 20:35:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262364487] [2023-08-29 20:35:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:50,607 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-29 20:35:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:50,608 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-29 20:35:50,609 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-29 20:35:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:50,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:35:50,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:50,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:35:50,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:35:50,764 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-29 20:35:50,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:50,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262364487] [2023-08-29 20:35:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262364487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:50,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:35:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644276256] [2023-08-29 20:35:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:50,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:35:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:35:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:35:50,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-29 20:35:50,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:50,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:50,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-29 20:35:50,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:51,636 INFO L130 PetriNetUnfolder]: 5199/7521 cut-off events. [2023-08-29 20:35:51,636 INFO L131 PetriNetUnfolder]: For 2867/2902 co-relation queries the response was YES. [2023-08-29 20:35:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19250 conditions, 7521 events. 5199/7521 cut-off events. For 2867/2902 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42931 event pairs, 4639 based on Foata normal form. 1868/8235 useless extension candidates. Maximal degree in co-relation 19244. Up to 7464 conditions per place. [2023-08-29 20:35:51,673 INFO L137 encePairwiseOnDemand]: 311/321 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-29 20:35:51,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 214 flow [2023-08-29 20:35:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:35:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:35:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:35:51,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43198338525441327 [2023-08-29 20:35:51,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:35:51,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:35:51,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:51,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:35:51,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:51,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:51,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:51,686 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 154 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:35:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 214 flow [2023-08-29 20:35:51,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:51,691 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 132 flow [2023-08-29 20:35:51,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:35:51,693 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -30 predicate places. [2023-08-29 20:35:51,693 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 132 flow [2023-08-29 20:35:51,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:51,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:51,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:51,705 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-29 20:35:51,903 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-29 20:35:51,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:51,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1568269816, now seen corresponding path program 1 times [2023-08-29 20:35:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920718775] [2023-08-29 20:35:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:51,904 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-29 20:35:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:51,907 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-29 20:35:51,908 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-29 20:35:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:52,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:35:52,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:35:52,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:52,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920718775] [2023-08-29 20:35:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920718775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:35:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366195555] [2023-08-29 20:35:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:52,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:35:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:35:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:35:52,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:35:52,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:52,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:52,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:35:52,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:52,727 INFO L130 PetriNetUnfolder]: 1879/3031 cut-off events. [2023-08-29 20:35:52,727 INFO L131 PetriNetUnfolder]: For 1141/1144 co-relation queries the response was YES. [2023-08-29 20:35:52,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 3031 events. 1879/3031 cut-off events. For 1141/1144 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17105 event pairs, 680 based on Foata normal form. 94/2714 useless extension candidates. Maximal degree in co-relation 7588. Up to 2535 conditions per place. [2023-08-29 20:35:52,736 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 56 selfloop transitions, 4 changer transitions 29/91 dead transitions. [2023-08-29 20:35:52,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 466 flow [2023-08-29 20:35:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:35:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:35:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:35:52,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41682242990654206 [2023-08-29 20:35:52,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:35:52,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:35:52,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:52,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:35:52,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:52,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:52,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:52,754 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 132 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:35:52,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 466 flow [2023-08-29 20:35:52,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:35:52,757 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 171 flow [2023-08-29 20:35:52,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-29 20:35:52,759 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-29 20:35:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 171 flow [2023-08-29 20:35:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:52,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:52,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:35:52,769 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-29 20:35:52,969 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-29 20:35:52,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:52,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1325306276, now seen corresponding path program 1 times [2023-08-29 20:35:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087314512] [2023-08-29 20:35:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:52,971 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-29 20:35:52,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:52,972 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-29 20:35:52,976 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-29 20:35:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:53,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:35:53,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:53,129 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-29 20:35:53,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:53,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087314512] [2023-08-29 20:35:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087314512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:53,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:35:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35524950] [2023-08-29 20:35:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:53,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:35:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:35:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:35:53,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:35:53,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:53,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:35:53,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:53,522 INFO L130 PetriNetUnfolder]: 456/859 cut-off events. [2023-08-29 20:35:53,522 INFO L131 PetriNetUnfolder]: For 640/643 co-relation queries the response was YES. [2023-08-29 20:35:53,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 859 events. 456/859 cut-off events. For 640/643 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3968 event pairs, 137 based on Foata normal form. 51/842 useless extension candidates. Maximal degree in co-relation 2491. Up to 329 conditions per place. [2023-08-29 20:35:53,524 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 67 selfloop transitions, 7 changer transitions 26/102 dead transitions. [2023-08-29 20:35:53,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 589 flow [2023-08-29 20:35:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:35:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:35:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-29 20:35:53,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158878504672897 [2023-08-29 20:35:53,527 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-29 20:35:53,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-29 20:35:53,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:53,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-29 20:35:53,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,532 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,532 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 171 flow. Second operand 6 states and 801 transitions. [2023-08-29 20:35:53,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 589 flow [2023-08-29 20:35:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 581 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:35:53,536 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 223 flow [2023-08-29 20:35:53,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-29 20:35:53,537 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-29 20:35:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 223 flow [2023-08-29 20:35:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:53,537 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-29 20:35:53,545 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-29 20:35:53,741 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-29 20:35:53,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:53,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -768589693, now seen corresponding path program 1 times [2023-08-29 20:35:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543844567] [2023-08-29 20:35:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:53,742 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-29 20:35:53,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:53,743 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-29 20:35:53,746 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-29 20:35:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:53,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:35:53,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:53,931 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-29 20:35:53,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:53,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:53,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543844567] [2023-08-29 20:35:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543844567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:35:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153217322] [2023-08-29 20:35:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:35:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:35:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:35:53,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:35:53,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:53,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:53,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:35:53,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:54,295 INFO L130 PetriNetUnfolder]: 255/477 cut-off events. [2023-08-29 20:35:54,295 INFO L131 PetriNetUnfolder]: For 605/608 co-relation queries the response was YES. [2023-08-29 20:35:54,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 477 events. 255/477 cut-off events. For 605/608 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1919 event pairs, 95 based on Foata normal form. 12/481 useless extension candidates. Maximal degree in co-relation 1484. Up to 215 conditions per place. [2023-08-29 20:35:54,297 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 55 selfloop transitions, 10 changer transitions 13/80 dead transitions. [2023-08-29 20:35:54,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 495 flow [2023-08-29 20:35:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:35:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:35:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-29 20:35:54,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40186915887850466 [2023-08-29 20:35:54,300 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-29 20:35:54,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-29 20:35:54,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:54,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-29 20:35:54,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:54,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:54,306 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:54,306 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 223 flow. Second operand 7 states and 903 transitions. [2023-08-29 20:35:54,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 495 flow [2023-08-29 20:35:54,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 457 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-29 20:35:54,310 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 181 flow [2023-08-29 20:35:54,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:35:54,310 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-29 20:35:54,310 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 181 flow [2023-08-29 20:35:54,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:54,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:54,311 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-29 20:35:54,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:35:54,521 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-29 20:35:54,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:54,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -505335550, now seen corresponding path program 1 times [2023-08-29 20:35:54,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:54,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940240595] [2023-08-29 20:35:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:54,523 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-29 20:35:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:54,524 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-29 20:35:54,527 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-29 20:35:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:54,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 20:35:54,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 20:35:56,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:35:56,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:35:56,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-08-29 20:35:56,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:35:56,769 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-29 20:35:56,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:56,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940240595] [2023-08-29 20:35:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940240595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:35:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396812624] [2023-08-29 20:35:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:56,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:35:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:35:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:35:56,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 321 [2023-08-29 20:35:56,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:56,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:56,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 321 [2023-08-29 20:35:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:57,358 INFO L130 PetriNetUnfolder]: 296/574 cut-off events. [2023-08-29 20:35:57,358 INFO L131 PetriNetUnfolder]: For 655/667 co-relation queries the response was YES. [2023-08-29 20:35:57,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 574 events. 296/574 cut-off events. For 655/667 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2646 event pairs, 47 based on Foata normal form. 3/574 useless extension candidates. Maximal degree in co-relation 1804. Up to 229 conditions per place. [2023-08-29 20:35:57,360 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 76 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2023-08-29 20:35:57,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 617 flow [2023-08-29 20:35:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:35:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:35:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-29 20:35:57,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3965287049399199 [2023-08-29 20:35:57,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-29 20:35:57,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-29 20:35:57,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:57,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-29 20:35:57,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,370 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,370 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 181 flow. Second operand 7 states and 891 transitions. [2023-08-29 20:35:57,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 617 flow [2023-08-29 20:35:57,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 525 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-29 20:35:57,375 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-08-29 20:35:57,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-29 20:35:57,375 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-29 20:35:57,375 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-08-29 20:35:57,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:57,376 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-29 20:35:57,389 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-29 20:35:57,587 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-29 20:35:57,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:57,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -602864835, now seen corresponding path program 1 times [2023-08-29 20:35:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192613048] [2023-08-29 20:35:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:57,589 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-29 20:35:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:57,590 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-29 20:35:57,591 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-29 20:35:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:57,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:35:57,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:57,784 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-29 20:35:57,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:57,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:57,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192613048] [2023-08-29 20:35:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192613048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:57,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:57,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:35:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947155692] [2023-08-29 20:35:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:35:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:35:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:35:57,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:35:57,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:57,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:57,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:35:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:35:58,041 INFO L130 PetriNetUnfolder]: 692/1232 cut-off events. [2023-08-29 20:35:58,042 INFO L131 PetriNetUnfolder]: For 1607/1607 co-relation queries the response was YES. [2023-08-29 20:35:58,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1232 events. 692/1232 cut-off events. For 1607/1607 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6026 event pairs, 134 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 4250. Up to 592 conditions per place. [2023-08-29 20:35:58,046 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 94 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-29 20:35:58,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 660 flow [2023-08-29 20:35:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:35:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:35:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-29 20:35:58,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182242990654206 [2023-08-29 20:35:58,050 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-29 20:35:58,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-29 20:35:58,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:35:58,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-29 20:35:58,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:58,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:58,054 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:58,054 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 4 states and 537 transitions. [2023-08-29 20:35:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 660 flow [2023-08-29 20:35:58,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:35:58,061 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 236 flow [2023-08-29 20:35:58,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-29 20:35:58,061 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:35:58,062 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 236 flow [2023-08-29 20:35:58,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:35:58,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:35:58,062 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-29 20:35:58,073 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-29 20:35:58,272 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-29 20:35:58,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:35:58,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:35:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash 845313555, now seen corresponding path program 1 times [2023-08-29 20:35:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:35:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433134196] [2023-08-29 20:35:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:35:58,274 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-29 20:35:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:35:58,274 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:35:58,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:35:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:35:58,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:35:58,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:35:59,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 133 [2023-08-29 20:35:59,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-08-29 20:35:59,890 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-29 20:35:59,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:35:59,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:35:59,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433134196] [2023-08-29 20:35:59,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433134196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:35:59,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:35:59,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:35:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300398351] [2023-08-29 20:35:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:35:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:35:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:35:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:35:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:35:59,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:35:59,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 236 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-29 20:35:59,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:35:59,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:35:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:00,198 INFO L130 PetriNetUnfolder]: 540/1023 cut-off events. [2023-08-29 20:36:00,198 INFO L131 PetriNetUnfolder]: For 1372/1409 co-relation queries the response was YES. [2023-08-29 20:36:00,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 1023 events. 540/1023 cut-off events. For 1372/1409 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5461 event pairs, 123 based on Foata normal form. 7/1019 useless extension candidates. Maximal degree in co-relation 3708. Up to 753 conditions per place. [2023-08-29 20:36:00,202 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 59 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2023-08-29 20:36:00,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 483 flow [2023-08-29 20:36:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:36:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:36:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-29 20:36:00,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405607476635514 [2023-08-29 20:36:00,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-29 20:36:00,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-29 20:36:00,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:00,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-29 20:36:00,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,209 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 236 flow. Second operand 5 states and 651 transitions. [2023-08-29 20:36:00,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 483 flow [2023-08-29 20:36:00,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:00,215 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 258 flow [2023-08-29 20:36:00,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-29 20:36:00,216 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:36:00,216 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 258 flow [2023-08-29 20:36:00,216 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-29 20:36:00,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:00,217 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-29 20:36:00,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-08-29 20:36:00,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:36:00,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:00,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1704153217, now seen corresponding path program 2 times [2023-08-29 20:36:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:36:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364034384] [2023-08-29 20:36:00,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:36:00,428 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-29 20:36:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:36:00,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:36:00,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:36:00,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:36:00,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:36:00,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:36:00,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:36:00,612 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-29 20:36:00,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:36:00,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:36:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364034384] [2023-08-29 20:36:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364034384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:00,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:00,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:36:00,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985803010] [2023-08-29 20:36:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:00,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:36:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:36:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:36:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:36:00,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:36:00,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:00,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:36:00,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:00,975 INFO L130 PetriNetUnfolder]: 898/1634 cut-off events. [2023-08-29 20:36:00,975 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2023-08-29 20:36:00,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 1634 events. 898/1634 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8649 event pairs, 252 based on Foata normal form. 2/1636 useless extension candidates. Maximal degree in co-relation 6343. Up to 1030 conditions per place. [2023-08-29 20:36:00,981 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 83 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2023-08-29 20:36:00,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 658 flow [2023-08-29 20:36:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-29 20:36:00,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127725856697819 [2023-08-29 20:36:00,982 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-29 20:36:00,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-29 20:36:00,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:00,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-29 20:36:00,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,986 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 258 flow. Second operand 4 states and 530 transitions. [2023-08-29 20:36:00,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 658 flow [2023-08-29 20:36:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:00,994 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 258 flow [2023-08-29 20:36:00,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-29 20:36:00,995 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-29 20:36:00,995 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 258 flow [2023-08-29 20:36:00,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:00,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:00,996 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-29 20:36:01,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:36:01,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:36:01,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:01,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1521279165, now seen corresponding path program 3 times [2023-08-29 20:36:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:36:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540653990] [2023-08-29 20:36:01,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:36:01,208 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-29 20:36:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:36:01,209 INFO L229 MonitoredProcess]: Starting monitored process 14 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-29 20:36:01,209 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 (14)] Waiting until timeout for monitored process [2023-08-29 20:36:01,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:36:01,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:36:01,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:36:01,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:36:01,385 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-29 20:36:01,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:36:01,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:36:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540653990] [2023-08-29 20:36:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540653990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130750015] [2023-08-29 20:36:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:01,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:36:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:36:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:36:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:36:01,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-29 20:36:01,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:01,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-29 20:36:01,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:01,767 INFO L130 PetriNetUnfolder]: 1232/2331 cut-off events. [2023-08-29 20:36:01,767 INFO L131 PetriNetUnfolder]: For 4365/4365 co-relation queries the response was YES. [2023-08-29 20:36:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 2331 events. 1232/2331 cut-off events. For 4365/4365 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14290 event pairs, 269 based on Foata normal form. 2/2333 useless extension candidates. Maximal degree in co-relation 8975. Up to 973 conditions per place. [2023-08-29 20:36:01,776 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 128 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2023-08-29 20:36:01,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 133 transitions, 952 flow [2023-08-29 20:36:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:36:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:36:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-29 20:36:01,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4193146417445483 [2023-08-29 20:36:01,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-29 20:36:01,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-29 20:36:01,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:01,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-29 20:36:01,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,782 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,783 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 258 flow. Second operand 5 states and 673 transitions. [2023-08-29 20:36:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 133 transitions, 952 flow [2023-08-29 20:36:01,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 133 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:01,800 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 280 flow [2023-08-29 20:36:01,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-29 20:36:01,801 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -15 predicate places. [2023-08-29 20:36:01,801 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 280 flow [2023-08-29 20:36:01,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:01,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:01,801 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-29 20:36:01,812 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 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:36:02,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-29 20:36:02,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:02,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -225051505, now seen corresponding path program 4 times [2023-08-29 20:36:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:36:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345480181] [2023-08-29 20:36:02,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:36:02,013 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-29 20:36:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:36:02,014 INFO L229 MonitoredProcess]: Starting monitored process 15 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-29 20:36:02,015 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 (15)] Waiting until timeout for monitored process [2023-08-29 20:36:02,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:36:02,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:36:02,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:36:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:36:02,444 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:36:02,445 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:36:02,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-29 20:36:02,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-29 20:36:02,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-29 20:36:02,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-29 20:36:02,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-29 20:36:02,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-29 20:36:02,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-29 20:36:02,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-29 20:36:02,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-29 20:36:02,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-29 20:36:02,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-29 20:36:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-29 20:36:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-29 20:36:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-29 20:36:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-29 20:36:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-29 20:36:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-29 20:36:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-29 20:36:02,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-29 20:36:02,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-29 20:36:02,673 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:02,678 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:36:02,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:36:02,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:36:02 BasicIcfg [2023-08-29 20:36:02,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:36:02,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:36:02,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:36:02,789 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:36:02,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:35:09" (3/4) ... [2023-08-29 20:36:02,791 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:36:02,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:36:02,792 INFO L158 Benchmark]: Toolchain (without parser) took 55334.62ms. Allocated memory was 73.4MB in the beginning and 8.7GB in the end (delta: 8.7GB). Free memory was 49.3MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-29 20:36:02,792 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:36:02,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.83ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 42.6MB in the end (delta: 6.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-29 20:36:02,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 39.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:36:02,793 INFO L158 Benchmark]: Boogie Preprocessor took 36.74ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:36:02,793 INFO L158 Benchmark]: RCFGBuilder took 1454.43ms. Allocated memory was 73.4MB in the beginning and 111.1MB in the end (delta: 37.7MB). Free memory was 37.2MB in the beginning and 52.3MB in the end (delta: -15.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2023-08-29 20:36:02,793 INFO L158 Benchmark]: TraceAbstraction took 53202.18ms. Allocated memory was 111.1MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 52.0MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-29 20:36:02,794 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 8.7GB. Free memory is still 7.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:36:02,795 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 58.7MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.83ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 42.6MB in the end (delta: 6.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 39.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.74ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 37.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1454.43ms. Allocated memory was 73.4MB in the beginning and 111.1MB in the end (delta: 37.7MB). Free memory was 37.2MB in the beginning and 52.3MB in the end (delta: -15.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53202.18ms. Allocated memory was 111.1MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 52.0MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 8.7GB. Free memory is still 7.7GB. 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: 20.4s, 177 PlacesBefore, 80 PlacesAfterwards, 169 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 30947 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7532, independent: 6978, independent conditional: 0, independent unconditional: 6978, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2555, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7532, independent: 4506, independent conditional: 0, independent unconditional: 4506, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 2555, unknown conditional: 0, unknown unconditional: 2555] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=0, t1780={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=1, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=2, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 227 locations, 75 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: 52.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2027 IncrementalHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 30 mSDtfsCounter, 2027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 833 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1789 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-29 20:36:02,814 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