./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:31:20,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:31:20,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:31:20,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:31:20,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:31:20,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:31:20,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:31:20,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:31:20,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:31:20,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:31:20,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:31:20,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:31:20,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:31:20,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:31:20,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:31:20,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:31:20,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:31:20,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:31:20,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:31:20,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:31:20,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:31:20,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:31:20,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:31:20,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:31:20,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:31:20,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:31:20,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:31:20,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:31:20,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:31:20,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:31:20,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:31:20,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:31:20,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:31:20,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:31:20,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:31:20,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:31:20,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:31:20,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:31:20,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:31:20,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:31:20,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:31:20,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:31:20,730 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:31:20,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:31:20,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:31:20,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:31:20,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:31:20,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:31:20,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:31:20,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:31:20,734 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:31:20,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:31:20,735 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:31:20,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:31:20,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:31:20,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:31:20,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:31:20,736 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:31:20,736 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:31:20,736 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:31:20,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:31:20,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:31:20,737 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:31:20,737 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:31:20,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:31:20,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:31:20,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:31:20,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:20,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:31:20,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:31:20,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:31:20,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:31:20,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:31:20,739 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:31:20,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:31:20,739 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:31:20,739 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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:31:21,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:31:21,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:31:21,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:31:21,055 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:31:21,055 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:31:21,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:31:22,243 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:31:22,495 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:31:22,498 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:31:22,511 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2239782e/f164f8224d2e495888dbf5cdd36a24c2/FLAG1f33e40a9 [2023-08-31 23:31:22,524 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2239782e/f164f8224d2e495888dbf5cdd36a24c2 [2023-08-31 23:31:22,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:31:22,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:31:22,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:22,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:31:22,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:31:22,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:22,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25893752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22, skipping insertion in model container [2023-08-31 23:31:22,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:22,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:31:22,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:31:22,696 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2023-08-31 23:31:22,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:22,873 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:31:22,885 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2023-08-31 23:31:22,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:22,987 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:22,987 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:22,993 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:31:22,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22 WrapperNode [2023-08-31 23:31:22,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:22,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:22,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:31:22,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:31:23,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,068 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-31 23:31:23,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:23,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:31:23,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:31:23,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:31:23,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,132 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:31:23,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:31:23,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:31:23,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:31:23,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (1/1) ... [2023-08-31 23:31:23,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:23,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:31:23,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:31:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:31:23,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:31:23,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:31:23,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:31:23,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:31:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:31:23,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:31:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:31:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:31:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:31:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:31:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:31:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:31:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:31:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:31:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:31:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:31:23,224 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:31:23,413 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:31:23,415 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:31:23,821 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:31:24,237 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:31:24,238 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:31:24,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:24 BoogieIcfgContainer [2023-08-31 23:31:24,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:31:24,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:31:24,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:31:24,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:31:24,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:31:22" (1/3) ... [2023-08-31 23:31:24,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce2b505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:24, skipping insertion in model container [2023-08-31 23:31:24,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:22" (2/3) ... [2023-08-31 23:31:24,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce2b505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:24, skipping insertion in model container [2023-08-31 23:31:24,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:24" (3/3) ... [2023-08-31 23:31:24,247 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:31:24,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:31:24,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-08-31 23:31:24,262 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:31:24,384 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:31:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 341 flow [2023-08-31 23:31:24,516 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:31:24,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:24,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 2/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:31:24,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 341 flow [2023-08-31 23:31:24,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 160 transitions, 329 flow [2023-08-31 23:31:24,534 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:31:24,551 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 160 transitions, 329 flow [2023-08-31 23:31:24,555 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 160 transitions, 329 flow [2023-08-31 23:31:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 329 flow [2023-08-31 23:31:24,613 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:31:24,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:24,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 2/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:31:24,618 INFO L119 LiptonReduction]: Number of co-enabled transitions 5008 [2023-08-31 23:31:35,009 INFO L134 LiptonReduction]: Checked pairs total: 21120 [2023-08-31 23:31:35,010 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-31 23:31:35,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:31:35,033 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;@a6ea884, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:31:35,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-08-31 23:31:35,035 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:31:35,035 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:35,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:35,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:31:35,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:35,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 927, now seen corresponding path program 1 times [2023-08-31 23:31:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469546740] [2023-08-31 23:31:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469546740] [2023-08-31 23:31:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469546740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:31:35,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181792007] [2023-08-31 23:31:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:35,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:31:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:31:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:31:35,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:31:35,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:35,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:35,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:31:35,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:36,600 INFO L130 PetriNetUnfolder]: 5032/7324 cut-off events. [2023-08-31 23:31:36,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:36,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14624 conditions, 7324 events. 5032/7324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 45495 event pairs, 5032 based on Foata normal form. 135/4045 useless extension candidates. Maximal degree in co-relation 14613. Up to 7254 conditions per place. [2023-08-31 23:31:36,645 INFO L137 encePairwiseOnDemand]: 289/310 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-31 23:31:36,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 165 flow [2023-08-31 23:31:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:31:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:31:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2023-08-31 23:31:36,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2023-08-31 23:31:36,662 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2023-08-31 23:31:36,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2023-08-31 23:31:36,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:36,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2023-08-31 23:31:36,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:36,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 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-31 23:31:36,675 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 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-31 23:31:36,676 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 312 transitions. [2023-08-31 23:31:36,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 165 flow [2023-08-31 23:31:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:36,682 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-31 23:31:36,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:31:36,687 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:31:36,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-31 23:31:36,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:36,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:36,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:31:36,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:36,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 913815, now seen corresponding path program 1 times [2023-08-31 23:31:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:36,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151026455] [2023-08-31 23:31:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151026455] [2023-08-31 23:31:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151026455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775542448] [2023-08-31 23:31:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:36,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:37,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 310 [2023-08-31 23:31:37,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:37,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 310 [2023-08-31 23:31:37,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:37,630 INFO L130 PetriNetUnfolder]: 2257/3371 cut-off events. [2023-08-31 23:31:37,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:37,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 3371 events. 2257/3371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 19049 event pairs, 2257 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 6719. Up to 3314 conditions per place. [2023-08-31 23:31:37,649 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-31 23:31:37,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 138 flow [2023-08-31 23:31:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:31:37,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443010752688172 [2023-08-31 23:31:37,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:31:37,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:31:37,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:37,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:31:37,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,657 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:31:37,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 138 flow [2023-08-31 23:31:37,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:31:37,659 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-31 23:31:37,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-31 23:31:37,660 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-08-31 23:31:37,660 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-31 23:31:37,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:37,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:31:37,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:37,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 913814, now seen corresponding path program 1 times [2023-08-31 23:31:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332128688] [2023-08-31 23:31:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:37,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-31 23:31:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332128688] [2023-08-31 23:31:37,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332128688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:37,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:37,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66078037] [2023-08-31 23:31:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:37,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:37,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 310 [2023-08-31 23:31:37,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:37,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:37,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 310 [2023-08-31 23:31:37,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:38,268 INFO L130 PetriNetUnfolder]: 1981/3093 cut-off events. [2023-08-31 23:31:38,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:38,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 3093 events. 1981/3093 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 17684 event pairs, 1227 based on Foata normal form. 0/2507 useless extension candidates. Maximal degree in co-relation 6146. Up to 1807 conditions per place. [2023-08-31 23:31:38,283 INFO L137 encePairwiseOnDemand]: 296/310 looper letters, 33 selfloop transitions, 8 changer transitions 1/44 dead transitions. [2023-08-31 23:31:38,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 180 flow [2023-08-31 23:31:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-31 23:31:38,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2023-08-31 23:31:38,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-31 23:31:38,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-31 23:31:38,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:38,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-31 23:31:38,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,290 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 411 transitions. [2023-08-31 23:31:38,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 180 flow [2023-08-31 23:31:38,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:38,291 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 135 flow [2023-08-31 23:31:38,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-31 23:31:38,292 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:31:38,292 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 135 flow [2023-08-31 23:31:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:38,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:38,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:31:38,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:38,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1242008487, now seen corresponding path program 1 times [2023-08-31 23:31:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:38,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802593994] [2023-08-31 23:31:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:38,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802593994] [2023-08-31 23:31:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802593994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:38,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34393719] [2023-08-31 23:31:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:38,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:38,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 310 [2023-08-31 23:31:38,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:38,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 310 [2023-08-31 23:31:38,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:38,837 INFO L130 PetriNetUnfolder]: 1654/2758 cut-off events. [2023-08-31 23:31:38,837 INFO L131 PetriNetUnfolder]: For 662/695 co-relation queries the response was YES. [2023-08-31 23:31:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 2758 events. 1654/2758 cut-off events. For 662/695 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 17192 event pairs, 598 based on Foata normal form. 0/2445 useless extension candidates. Maximal degree in co-relation 6905. Up to 1678 conditions per place. [2023-08-31 23:31:38,853 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-31 23:31:38,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 337 flow [2023-08-31 23:31:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-31 23:31:38,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612903225806452 [2023-08-31 23:31:38,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-31 23:31:38,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-31 23:31:38,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:38,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-31 23:31:38,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,859 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 135 flow. Second operand 3 states and 429 transitions. [2023-08-31 23:31:38,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 337 flow [2023-08-31 23:31:38,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:38,867 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2023-08-31 23:31:38,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-31 23:31:38,868 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:31:38,869 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2023-08-31 23:31:38,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:38,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:38,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:38,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:31:38,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:38,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1242008782, now seen corresponding path program 1 times [2023-08-31 23:31:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854390740] [2023-08-31 23:31:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:39,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854390740] [2023-08-31 23:31:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854390740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181028695] [2023-08-31 23:31:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:39,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:39,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:39,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:31:39,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:39,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:31:39,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:39,723 INFO L130 PetriNetUnfolder]: 1622/2699 cut-off events. [2023-08-31 23:31:39,723 INFO L131 PetriNetUnfolder]: For 586/619 co-relation queries the response was YES. [2023-08-31 23:31:39,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 2699 events. 1622/2699 cut-off events. For 586/619 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16778 event pairs, 590 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 6802. Up to 1663 conditions per place. [2023-08-31 23:31:39,738 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 54 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-31 23:31:39,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 320 flow [2023-08-31 23:31:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-31 23:31:39,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2023-08-31 23:31:39,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-31 23:31:39,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-31 23:31:39,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:39,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-31 23:31:39,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,746 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 430 transitions. [2023-08-31 23:31:39,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 320 flow [2023-08-31 23:31:39,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:39,748 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 137 flow [2023-08-31 23:31:39,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-31 23:31:39,749 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-08-31 23:31:39,749 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 137 flow [2023-08-31 23:31:39,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:39,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:39,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:31:39,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:39,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -152434939, now seen corresponding path program 1 times [2023-08-31 23:31:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225800820] [2023-08-31 23:31:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225800820] [2023-08-31 23:31:39,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225800820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:39,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044477935] [2023-08-31 23:31:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:39,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:39,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 310 [2023-08-31 23:31:39,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:39,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:39,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 310 [2023-08-31 23:31:39,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:40,357 INFO L130 PetriNetUnfolder]: 1829/2996 cut-off events. [2023-08-31 23:31:40,358 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2023-08-31 23:31:40,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 2996 events. 1829/2996 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18466 event pairs, 395 based on Foata normal form. 0/2671 useless extension candidates. Maximal degree in co-relation 7840. Up to 1274 conditions per place. [2023-08-31 23:31:40,371 INFO L137 encePairwiseOnDemand]: 301/310 looper letters, 47 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-08-31 23:31:40,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 319 flow [2023-08-31 23:31:40,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-31 23:31:40,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43629032258064515 [2023-08-31 23:31:40,374 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-31 23:31:40,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-31 23:31:40,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:40,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-31 23:31:40,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:40,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:40,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:40,379 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 137 flow. Second operand 4 states and 541 transitions. [2023-08-31 23:31:40,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 319 flow [2023-08-31 23:31:40,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:40,381 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 169 flow [2023-08-31 23:31:40,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-08-31 23:31:40,382 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-08-31 23:31:40,382 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 169 flow [2023-08-31 23:31:40,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:40,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:40,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:40,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:31:40,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:40,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -152434644, now seen corresponding path program 1 times [2023-08-31 23:31:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392893371] [2023-08-31 23:31:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392893371] [2023-08-31 23:31:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392893371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:40,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641501262] [2023-08-31 23:31:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:40,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:40,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:40,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 310 [2023-08-31 23:31:40,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:40,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:40,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 310 [2023-08-31 23:31:40,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:41,070 INFO L130 PetriNetUnfolder]: 1702/2902 cut-off events. [2023-08-31 23:31:41,070 INFO L131 PetriNetUnfolder]: For 1441/1512 co-relation queries the response was YES. [2023-08-31 23:31:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7819 conditions, 2902 events. 1702/2902 cut-off events. For 1441/1512 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 19004 event pairs, 396 based on Foata normal form. 42/2675 useless extension candidates. Maximal degree in co-relation 7812. Up to 1950 conditions per place. [2023-08-31 23:31:41,083 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 62 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-31 23:31:41,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 419 flow [2023-08-31 23:31:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:31:41,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45376344086021503 [2023-08-31 23:31:41,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:31:41,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:31:41,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:41,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:31:41,087 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-31 23:31:41,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,089 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 169 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:31:41,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 419 flow [2023-08-31 23:31:41,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:41,093 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 165 flow [2023-08-31 23:31:41,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:31:41,093 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:31:41,094 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 165 flow [2023-08-31 23:31:41,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:41,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:41,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:31:41,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:41,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 578148942, now seen corresponding path program 1 times [2023-08-31 23:31:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100240903] [2023-08-31 23:31:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100240903] [2023-08-31 23:31:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100240903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:31:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670215511] [2023-08-31 23:31:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:41,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:31:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:31:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:31:41,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 310 [2023-08-31 23:31:41,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:41,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 310 [2023-08-31 23:31:41,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:41,730 INFO L130 PetriNetUnfolder]: 1725/2796 cut-off events. [2023-08-31 23:31:41,730 INFO L131 PetriNetUnfolder]: For 1040/1040 co-relation queries the response was YES. [2023-08-31 23:31:41,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8119 conditions, 2796 events. 1725/2796 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 16371 event pairs, 770 based on Foata normal form. 30/2453 useless extension candidates. Maximal degree in co-relation 8111. Up to 1812 conditions per place. [2023-08-31 23:31:41,743 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 59 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-31 23:31:41,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 371 flow [2023-08-31 23:31:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-31 23:31:41,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42983870967741933 [2023-08-31 23:31:41,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-31 23:31:41,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-31 23:31:41,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:41,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-31 23:31:41,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,751 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 165 flow. Second operand 4 states and 533 transitions. [2023-08-31 23:31:41,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 371 flow [2023-08-31 23:31:41,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:41,753 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 160 flow [2023-08-31 23:31:41,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-31 23:31:41,756 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-08-31 23:31:41,756 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 160 flow [2023-08-31 23:31:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:41,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:41,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:41,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:31:41,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:41,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -984701788, now seen corresponding path program 1 times [2023-08-31 23:31:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232304398] [2023-08-31 23:31:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232304398] [2023-08-31 23:31:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232304398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986010991] [2023-08-31 23:31:42,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:42,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:42,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:31:42,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:42,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:42,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:31:42,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:42,493 INFO L130 PetriNetUnfolder]: 1572/2631 cut-off events. [2023-08-31 23:31:42,493 INFO L131 PetriNetUnfolder]: For 1125/1129 co-relation queries the response was YES. [2023-08-31 23:31:42,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 2631 events. 1572/2631 cut-off events. For 1125/1129 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16087 event pairs, 240 based on Foata normal form. 4/2310 useless extension candidates. Maximal degree in co-relation 7316. Up to 2052 conditions per place. [2023-08-31 23:31:42,505 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 62 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-08-31 23:31:42,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 406 flow [2023-08-31 23:31:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:31:42,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443548387096774 [2023-08-31 23:31:42,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:31:42,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:31:42,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:42,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:31:42,510 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-31 23:31:42,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:42,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:42,512 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 160 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:31:42,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 406 flow [2023-08-31 23:31:42,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:42,515 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 196 flow [2023-08-31 23:31:42,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-31 23:31:42,515 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2023-08-31 23:31:42,516 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 196 flow [2023-08-31 23:31:42,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:42,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:42,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:31:42,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:42,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash -430464791, now seen corresponding path program 1 times [2023-08-31 23:31:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024015747] [2023-08-31 23:31:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024015747] [2023-08-31 23:31:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024015747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067982690] [2023-08-31 23:31:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:42,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:42,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 310 [2023-08-31 23:31:42,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:42,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:42,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 310 [2023-08-31 23:31:42,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:43,337 INFO L130 PetriNetUnfolder]: 1582/2548 cut-off events. [2023-08-31 23:31:43,337 INFO L131 PetriNetUnfolder]: For 1141/1141 co-relation queries the response was YES. [2023-08-31 23:31:43,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 2548 events. 1582/2548 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 14568 event pairs, 607 based on Foata normal form. 15/2271 useless extension candidates. Maximal degree in co-relation 7627. Up to 979 conditions per place. [2023-08-31 23:31:43,348 INFO L137 encePairwiseOnDemand]: 299/310 looper letters, 47 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2023-08-31 23:31:43,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 395 flow [2023-08-31 23:31:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-31 23:31:43,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41451612903225804 [2023-08-31 23:31:43,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-31 23:31:43,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-31 23:31:43,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:43,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-31 23:31:43,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:43,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:43,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:43,355 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 196 flow. Second operand 4 states and 514 transitions. [2023-08-31 23:31:43,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 395 flow [2023-08-31 23:31:43,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:43,359 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 279 flow [2023-08-31 23:31:43,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-31 23:31:43,360 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2023-08-31 23:31:43,360 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 279 flow [2023-08-31 23:31:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:43,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:43,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:31:43,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:43,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 67311763, now seen corresponding path program 1 times [2023-08-31 23:31:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891146799] [2023-08-31 23:31:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891146799] [2023-08-31 23:31:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891146799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894597307] [2023-08-31 23:31:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:43,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:31:43,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:43,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:43,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:31:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:44,106 INFO L130 PetriNetUnfolder]: 2506/4135 cut-off events. [2023-08-31 23:31:44,106 INFO L131 PetriNetUnfolder]: For 4630/4828 co-relation queries the response was YES. [2023-08-31 23:31:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 4135 events. 2506/4135 cut-off events. For 4630/4828 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 27390 event pairs, 613 based on Foata normal form. 94/3822 useless extension candidates. Maximal degree in co-relation 12496. Up to 1444 conditions per place. [2023-08-31 23:31:44,126 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 92 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2023-08-31 23:31:44,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 100 transitions, 730 flow [2023-08-31 23:31:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-08-31 23:31:44,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-31 23:31:44,129 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-08-31 23:31:44,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-08-31 23:31:44,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:44,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-08-31 23:31:44,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,133 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 279 flow. Second operand 4 states and 558 transitions. [2023-08-31 23:31:44,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 100 transitions, 730 flow [2023-08-31 23:31:44,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:44,141 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 294 flow [2023-08-31 23:31:44,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-31 23:31:44,141 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -12 predicate places. [2023-08-31 23:31:44,142 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 294 flow [2023-08-31 23:31:44,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:44,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:44,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:31:44,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:44,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -459506924, now seen corresponding path program 1 times [2023-08-31 23:31:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595726811] [2023-08-31 23:31:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595726811] [2023-08-31 23:31:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595726811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:31:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897658330] [2023-08-31 23:31:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:31:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:31:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:31:44,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 310 [2023-08-31 23:31:44,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 294 flow. Second operand has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:44,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 310 [2023-08-31 23:31:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:45,498 INFO L130 PetriNetUnfolder]: 2671/4450 cut-off events. [2023-08-31 23:31:45,499 INFO L131 PetriNetUnfolder]: For 4355/4471 co-relation queries the response was YES. [2023-08-31 23:31:45,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14484 conditions, 4450 events. 2671/4450 cut-off events. For 4355/4471 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 29848 event pairs, 925 based on Foata normal form. 18/4192 useless extension candidates. Maximal degree in co-relation 14471. Up to 2371 conditions per place. [2023-08-31 23:31:45,519 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 104 selfloop transitions, 22 changer transitions 0/132 dead transitions. [2023-08-31 23:31:45,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1016 flow [2023-08-31 23:31:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:31:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:31:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1082 transitions. [2023-08-31 23:31:45,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878136200716846 [2023-08-31 23:31:45,523 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1082 transitions. [2023-08-31 23:31:45,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1082 transitions. [2023-08-31 23:31:45,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:45,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1082 transitions. [2023-08-31 23:31:45,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:45,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:45,530 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:45,530 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 294 flow. Second operand 9 states and 1082 transitions. [2023-08-31 23:31:45,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1016 flow [2023-08-31 23:31:45,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 132 transitions, 982 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:45,546 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 498 flow [2023-08-31 23:31:45,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2023-08-31 23:31:45,546 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-08-31 23:31:45,547 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 498 flow [2023-08-31 23:31:45,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:45,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:45,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:45,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:31:45,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:45,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -459506978, now seen corresponding path program 1 times [2023-08-31 23:31:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109724588] [2023-08-31 23:31:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109724588] [2023-08-31 23:31:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109724588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:31:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819024092] [2023-08-31 23:31:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:45,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:31:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:31:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:31:45,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 310 [2023-08-31 23:31:45,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 498 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:45,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:45,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 310 [2023-08-31 23:31:45,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:46,362 INFO L130 PetriNetUnfolder]: 2557/4182 cut-off events. [2023-08-31 23:31:46,362 INFO L131 PetriNetUnfolder]: For 5191/5207 co-relation queries the response was YES. [2023-08-31 23:31:46,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14293 conditions, 4182 events. 2557/4182 cut-off events. For 5191/5207 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 26994 event pairs, 946 based on Foata normal form. 87/4137 useless extension candidates. Maximal degree in co-relation 14279. Up to 2119 conditions per place. [2023-08-31 23:31:46,378 INFO L137 encePairwiseOnDemand]: 298/310 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2023-08-31 23:31:46,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 829 flow [2023-08-31 23:31:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-08-31 23:31:46,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3989247311827957 [2023-08-31 23:31:46,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-08-31 23:31:46,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-08-31 23:31:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:46,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-08-31 23:31:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:46,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:46,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:46,385 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 498 flow. Second operand 6 states and 742 transitions. [2023-08-31 23:31:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 829 flow [2023-08-31 23:31:46,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:46,407 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 632 flow [2023-08-31 23:31:46,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2023-08-31 23:31:46,408 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 1 predicate places. [2023-08-31 23:31:46,408 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 632 flow [2023-08-31 23:31:46,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:46,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:46,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:46,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:31:46,409 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:46,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2052524723, now seen corresponding path program 1 times [2023-08-31 23:31:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:46,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419725648] [2023-08-31 23:31:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419725648] [2023-08-31 23:31:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419725648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630704633] [2023-08-31 23:31:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:46,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:46,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:31:46,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:46,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:46,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:31:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:47,672 INFO L130 PetriNetUnfolder]: 4893/7970 cut-off events. [2023-08-31 23:31:47,672 INFO L131 PetriNetUnfolder]: For 23995/24296 co-relation queries the response was YES. [2023-08-31 23:31:47,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29570 conditions, 7970 events. 4893/7970 cut-off events. For 23995/24296 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 56268 event pairs, 675 based on Foata normal form. 160/7761 useless extension candidates. Maximal degree in co-relation 29554. Up to 3352 conditions per place. [2023-08-31 23:31:47,710 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 144 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2023-08-31 23:31:47,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 154 transitions, 1674 flow [2023-08-31 23:31:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:31:47,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467741935483871 [2023-08-31 23:31:47,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:31:47,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:31:47,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:47,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:31:47,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:47,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:47,722 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:47,722 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 632 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:31:47,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 154 transitions, 1674 flow [2023-08-31 23:31:47,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 154 transitions, 1602 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:47,861 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 631 flow [2023-08-31 23:31:47,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-31 23:31:47,862 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-31 23:31:47,862 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 631 flow [2023-08-31 23:31:47,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:47,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:47,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:47,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:31:47,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:47,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:47,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1359811365, now seen corresponding path program 1 times [2023-08-31 23:31:47,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:47,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940725261] [2023-08-31 23:31:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940725261] [2023-08-31 23:31:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940725261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:47,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992235852] [2023-08-31 23:31:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:47,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 310 [2023-08-31 23:31:47,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 631 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-31 23:31:47,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:47,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 310 [2023-08-31 23:31:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:48,743 INFO L130 PetriNetUnfolder]: 4106/6611 cut-off events. [2023-08-31 23:31:48,743 INFO L131 PetriNetUnfolder]: For 11540/11580 co-relation queries the response was YES. [2023-08-31 23:31:48,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24641 conditions, 6611 events. 4106/6611 cut-off events. For 11540/11580 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 44172 event pairs, 2106 based on Foata normal form. 109/6505 useless extension candidates. Maximal degree in co-relation 24622. Up to 4796 conditions per place. [2023-08-31 23:31:48,770 INFO L137 encePairwiseOnDemand]: 298/310 looper letters, 39 selfloop transitions, 19 changer transitions 31/91 dead transitions. [2023-08-31 23:31:48,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 921 flow [2023-08-31 23:31:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-31 23:31:48,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2023-08-31 23:31:48,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-31 23:31:48,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-31 23:31:48,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:48,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-31 23:31:48,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:48,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:48,776 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:48,776 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 631 flow. Second operand 4 states and 515 transitions. [2023-08-31 23:31:48,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 921 flow [2023-08-31 23:31:48,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 897 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:48,895 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 465 flow [2023-08-31 23:31:48,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-31 23:31:48,896 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-08-31 23:31:48,896 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 465 flow [2023-08-31 23:31:48,896 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-31 23:31:48,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:48,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:48,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:31:48,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:48,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -584100174, now seen corresponding path program 1 times [2023-08-31 23:31:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765788080] [2023-08-31 23:31:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765788080] [2023-08-31 23:31:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765788080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:49,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:49,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:31:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101578815] [2023-08-31 23:31:49,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:49,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:31:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:31:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:31:49,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 310 [2023-08-31 23:31:49,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 465 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:49,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:49,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 310 [2023-08-31 23:31:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:50,019 INFO L130 PetriNetUnfolder]: 1434/2470 cut-off events. [2023-08-31 23:31:50,019 INFO L131 PetriNetUnfolder]: For 5369/5458 co-relation queries the response was YES. [2023-08-31 23:31:50,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 2470 events. 1434/2470 cut-off events. For 5369/5458 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15074 event pairs, 553 based on Foata normal form. 203/2629 useless extension candidates. Maximal degree in co-relation 8253. Up to 1397 conditions per place. [2023-08-31 23:31:50,025 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 21 selfloop transitions, 4 changer transitions 37/65 dead transitions. [2023-08-31 23:31:50,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 554 flow [2023-08-31 23:31:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:31:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:31:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-31 23:31:50,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37649769585253456 [2023-08-31 23:31:50,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-31 23:31:50,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-31 23:31:50,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:50,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-31 23:31:50,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:50,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:50,034 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:50,034 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 465 flow. Second operand 7 states and 817 transitions. [2023-08-31 23:31:50,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 554 flow [2023-08-31 23:31:50,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 504 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-31 23:31:50,057 INFO L231 Difference]: Finished difference. Result has 64 places, 23 transitions, 120 flow [2023-08-31 23:31:50,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=23} [2023-08-31 23:31:50,058 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2023-08-31 23:31:50,058 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 23 transitions, 120 flow [2023-08-31 23:31:50,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:50,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:50,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:31:50,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:50,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash -794870639, now seen corresponding path program 1 times [2023-08-31 23:31:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507241671] [2023-08-31 23:31:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507241671] [2023-08-31 23:31:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507241671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:31:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206457500] [2023-08-31 23:31:51,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:51,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:31:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:51,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:31:51,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:31:51,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 310 [2023-08-31 23:31:51,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 23 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 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-31 23:31:51,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:51,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 310 [2023-08-31 23:31:51,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:51,380 INFO L130 PetriNetUnfolder]: 398/696 cut-off events. [2023-08-31 23:31:51,381 INFO L131 PetriNetUnfolder]: For 760/762 co-relation queries the response was YES. [2023-08-31 23:31:51,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 696 events. 398/696 cut-off events. For 760/762 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3025 event pairs, 216 based on Foata normal form. 8/700 useless extension candidates. Maximal degree in co-relation 1944. Up to 496 conditions per place. [2023-08-31 23:31:51,384 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2023-08-31 23:31:51,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 43 transitions, 283 flow [2023-08-31 23:31:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-31 23:31:51,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36935483870967745 [2023-08-31 23:31:51,386 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-31 23:31:51,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-31 23:31:51,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:51,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-31 23:31:51,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:51,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:51,391 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:51,391 INFO L175 Difference]: Start difference. First operand has 64 places, 23 transitions, 120 flow. Second operand 6 states and 687 transitions. [2023-08-31 23:31:51,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 43 transitions, 283 flow [2023-08-31 23:31:51,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 228 flow, removed 8 selfloop flow, removed 14 redundant places. [2023-08-31 23:31:51,394 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 150 flow [2023-08-31 23:31:51,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-08-31 23:31:51,395 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2023-08-31 23:31:51,395 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 150 flow [2023-08-31 23:31:51,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 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-31 23:31:51,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:51,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:51,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:31:51,396 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:51,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash 793928559, now seen corresponding path program 2 times [2023-08-31 23:31:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032119672] [2023-08-31 23:31:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032119672] [2023-08-31 23:31:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032119672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:31:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117616966] [2023-08-31 23:31:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:52,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:31:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:31:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:31:52,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 310 [2023-08-31 23:31:52,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:52,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:52,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 310 [2023-08-31 23:31:52,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:52,937 INFO L130 PetriNetUnfolder]: 451/790 cut-off events. [2023-08-31 23:31:52,937 INFO L131 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2023-08-31 23:31:52,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 790 events. 451/790 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3631 event pairs, 138 based on Foata normal form. 8/798 useless extension candidates. Maximal degree in co-relation 2024. Up to 397 conditions per place. [2023-08-31 23:31:52,940 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 32 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2023-08-31 23:31:52,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 310 flow [2023-08-31 23:31:52,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:31:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:31:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-08-31 23:31:52,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37004608294930874 [2023-08-31 23:31:52,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-08-31 23:31:52,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-08-31 23:31:52,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:52,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-08-31 23:31:52,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:52,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:52,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:52,948 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 150 flow. Second operand 7 states and 803 transitions. [2023-08-31 23:31:52,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 310 flow [2023-08-31 23:31:52,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:52,950 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 234 flow [2023-08-31 23:31:52,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-08-31 23:31:52,951 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2023-08-31 23:31:52,951 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 234 flow [2023-08-31 23:31:52,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:52,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:52,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:52,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:31:52,951 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:52,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash 734632453, now seen corresponding path program 3 times [2023-08-31 23:31:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051518855] [2023-08-31 23:31:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:53,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051518855] [2023-08-31 23:31:53,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051518855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:53,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:31:53,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073414474] [2023-08-31 23:31:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:53,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:31:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:53,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:31:53,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:31:54,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 310 [2023-08-31 23:31:54,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 36 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 109.55555555555556) internal successors, (986), 9 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:54,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 310 [2023-08-31 23:31:54,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:54,514 INFO L130 PetriNetUnfolder]: 443/790 cut-off events. [2023-08-31 23:31:54,515 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2023-08-31 23:31:54,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 790 events. 443/790 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3632 event pairs, 122 based on Foata normal form. 4/794 useless extension candidates. Maximal degree in co-relation 2197. Up to 426 conditions per place. [2023-08-31 23:31:54,517 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 30 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2023-08-31 23:31:54,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 363 flow [2023-08-31 23:31:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:31:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:31:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2023-08-31 23:31:54,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36370967741935484 [2023-08-31 23:31:54,530 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 902 transitions. [2023-08-31 23:31:54,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions. [2023-08-31 23:31:54,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:54,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions. [2023-08-31 23:31:54,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,536 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,536 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 234 flow. Second operand 8 states and 902 transitions. [2023-08-31 23:31:54,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 363 flow [2023-08-31 23:31:54,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 48 transitions, 346 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:54,538 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 271 flow [2023-08-31 23:31:54,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-08-31 23:31:54,539 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-08-31 23:31:54,539 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 271 flow [2023-08-31 23:31:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.55555555555556) internal successors, (986), 9 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:54,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:54,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:31:54,540 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:54,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1439226491, now seen corresponding path program 1 times [2023-08-31 23:31:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864138677] [2023-08-31 23:31:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864138677] [2023-08-31 23:31:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864138677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876649608] [2023-08-31 23:31:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:54,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:54,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:54,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:54,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:31:54,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:54,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:31:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:54,935 INFO L130 PetriNetUnfolder]: 333/669 cut-off events. [2023-08-31 23:31:54,935 INFO L131 PetriNetUnfolder]: For 749/755 co-relation queries the response was YES. [2023-08-31 23:31:54,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 669 events. 333/669 cut-off events. For 749/755 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3583 event pairs, 83 based on Foata normal form. 66/729 useless extension candidates. Maximal degree in co-relation 1789. Up to 476 conditions per place. [2023-08-31 23:31:54,938 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 53 selfloop transitions, 7 changer transitions 4/69 dead transitions. [2023-08-31 23:31:54,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 566 flow [2023-08-31 23:31:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:31:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:31:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-31 23:31:54,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4135483870967742 [2023-08-31 23:31:54,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-31 23:31:54,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-31 23:31:54,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:54,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-31 23:31:54,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,945 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 271 flow. Second operand 5 states and 641 transitions. [2023-08-31 23:31:54,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 566 flow [2023-08-31 23:31:54,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 517 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-31 23:31:54,947 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 290 flow [2023-08-31 23:31:54,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-08-31 23:31:54,948 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2023-08-31 23:31:54,948 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 290 flow [2023-08-31 23:31:54,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:54,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:54,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:31:54,949 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:54,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -877927598, now seen corresponding path program 1 times [2023-08-31 23:31:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502051320] [2023-08-31 23:31:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502051320] [2023-08-31 23:31:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502051320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:31:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514803811] [2023-08-31 23:31:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:55,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:31:55,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 290 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-31 23:31:55,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:55,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:31:55,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:55,331 INFO L130 PetriNetUnfolder]: 255/569 cut-off events. [2023-08-31 23:31:55,331 INFO L131 PetriNetUnfolder]: For 919/945 co-relation queries the response was YES. [2023-08-31 23:31:55,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 569 events. 255/569 cut-off events. For 919/945 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3201 event pairs, 13 based on Foata normal form. 66/628 useless extension candidates. Maximal degree in co-relation 2091. Up to 282 conditions per place. [2023-08-31 23:31:55,334 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 59 selfloop transitions, 13 changer transitions 7/84 dead transitions. [2023-08-31 23:31:55,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 688 flow [2023-08-31 23:31:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:31:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:31:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions. [2023-08-31 23:31:55,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4110599078341014 [2023-08-31 23:31:55,338 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 892 transitions. [2023-08-31 23:31:55,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions. [2023-08-31 23:31:55,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:55,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions. [2023-08-31 23:31:55,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,343 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,343 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 290 flow. Second operand 7 states and 892 transitions. [2023-08-31 23:31:55,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 688 flow [2023-08-31 23:31:55,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 680 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:55,347 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 370 flow [2023-08-31 23:31:55,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2023-08-31 23:31:55,348 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-08-31 23:31:55,348 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 370 flow [2023-08-31 23:31:55,348 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-31 23:31:55,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:55,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:31:55,349 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:55,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1813070578, now seen corresponding path program 1 times [2023-08-31 23:31:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748201552] [2023-08-31 23:31:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748201552] [2023-08-31 23:31:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748201552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:31:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123044983] [2023-08-31 23:31:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:55,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:31:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:31:55,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:31:55,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:31:55,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:55,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:31:55,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:55,763 INFO L130 PetriNetUnfolder]: 220/508 cut-off events. [2023-08-31 23:31:55,763 INFO L131 PetriNetUnfolder]: For 1555/1581 co-relation queries the response was YES. [2023-08-31 23:31:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 508 events. 220/508 cut-off events. For 1555/1581 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2896 event pairs, 7 based on Foata normal form. 37/538 useless extension candidates. Maximal degree in co-relation 2206. Up to 254 conditions per place. [2023-08-31 23:31:55,766 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 56 selfloop transitions, 17 changer transitions 6/84 dead transitions. [2023-08-31 23:31:55,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 742 flow [2023-08-31 23:31:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:31:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:31:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1130 transitions. [2023-08-31 23:31:55,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2023-08-31 23:31:55,771 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1130 transitions. [2023-08-31 23:31:55,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1130 transitions. [2023-08-31 23:31:55,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:55,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1130 transitions. [2023-08-31 23:31:55,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.55555555555556) internal successors, (1130), 9 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,778 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,778 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 370 flow. Second operand 9 states and 1130 transitions. [2023-08-31 23:31:55,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 742 flow [2023-08-31 23:31:55,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 680 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-31 23:31:55,789 INFO L231 Difference]: Finished difference. Result has 82 places, 50 transitions, 377 flow [2023-08-31 23:31:55,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=82, PETRI_TRANSITIONS=50} [2023-08-31 23:31:55,791 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2023-08-31 23:31:55,791 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 50 transitions, 377 flow [2023-08-31 23:31:55,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:55,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:55,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:31:55,792 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:31:55,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1174027053, now seen corresponding path program 1 times [2023-08-31 23:31:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268717162] [2023-08-31 23:31:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:31:55,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:31:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:31:56,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:31:56,021 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:31:56,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-08-31 23:31:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-08-31 23:31:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-08-31 23:31:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-08-31 23:31:56,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-08-31 23:31:56,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-08-31 23:31:56,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-08-31 23:31:56,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-08-31 23:31:56,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-08-31 23:31:56,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-08-31 23:31:56,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-08-31 23:31:56,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-08-31 23:31:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-08-31 23:31:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-08-31 23:31:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-08-31 23:31:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-08-31 23:31:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-08-31 23:31:56,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-08-31 23:31:56,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-08-31 23:31:56,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-08-31 23:31:56,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-08-31 23:31:56,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-08-31 23:31:56,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-08-31 23:31:56,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-08-31 23:31:56,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-08-31 23:31:56,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-08-31 23:31:56,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-08-31 23:31:56,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-08-31 23:31:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 23:31:56,035 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:56,041 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:31:56,041 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:31:56,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:31:56 BasicIcfg [2023-08-31 23:31:56,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:31:56,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:31:56,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:31:56,141 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:31:56,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:24" (3/4) ... [2023-08-31 23:31:56,144 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:31:56,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:31:56,144 INFO L158 Benchmark]: Toolchain (without parser) took 33617.08ms. Allocated memory was 71.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 38.8MB in the beginning and 756.1MB in the end (delta: -717.3MB). Peak memory consumption was 617.7MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,144 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:31:56,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.11ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 32.7MB in the end (delta: 5.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.41ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,145 INFO L158 Benchmark]: Boogie Preprocessor took 74.18ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 49.3MB in the end (delta: -19.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,145 INFO L158 Benchmark]: RCFGBuilder took 1095.30ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 49.3MB in the beginning and 42.5MB in the end (delta: 6.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,146 INFO L158 Benchmark]: TraceAbstraction took 31898.73ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 42.0MB in the beginning and 756.1MB in the end (delta: -714.1MB). Peak memory consumption was 608.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:56,146 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 1.4GB. Free memory is still 756.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:31:56,147 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.11ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 32.7MB in the end (delta: 5.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.41ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.18ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 49.3MB in the end (delta: -19.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.30ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 49.3MB in the beginning and 42.5MB in the end (delta: 6.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31898.73ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 42.0MB in the beginning and 756.1MB in the end (delta: -714.1MB). Peak memory consumption was 608.1MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 1.4GB. Free memory is still 756.1MB. 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: 10.5s, 168 PlacesBefore, 71 PlacesAfterwards, 160 TransitionsBefore, 62 TransitionsAfterwards, 5008 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 21120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8286, independent: 7826, independent conditional: 0, independent unconditional: 7826, dependent: 460, dependent conditional: 0, dependent unconditional: 460, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2373, independent: 2299, independent conditional: 0, independent unconditional: 2299, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8286, independent: 5527, independent conditional: 0, independent unconditional: 5527, dependent: 386, dependent conditional: 0, dependent unconditional: 386, unknown: 2373, unknown conditional: 0, unknown unconditional: 2373] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 403, Positive conditional cache size: 0, Positive unconditional cache size: 403, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=0, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=1, t1937={7:0}, t1938={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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=6, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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=6, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=2, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L812] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, main$tmp_guard1=0, t1937={7:0}, t1938={5:0}, t1939={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 209 locations, 61 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: 31.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2167 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1649 mSDsluCounter, 510 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 446 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4603 IncrementalHoareTripleChecker+Invalid, 4907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 64 mSDtfsCounter, 4603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=13, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 2646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:31:56,185 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/safe007_power.oepc-thin001_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:31:58,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:31:58,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:31:58,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:31:58,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:31:58,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:31:58,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:31:58,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:31:58,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:31:58,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:31:58,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:31:58,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:31:58,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:31:58,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:31:58,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:31:58,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:31:58,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:31:58,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:31:58,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:31:58,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:31:58,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:31:58,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:31:58,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:31:58,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:31:58,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:31:58,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:31:58,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:31:58,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:31:58,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:31:58,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:31:58,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:31:58,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:31:58,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:31:58,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:31:58,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:31:58,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:31:58,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:31:58,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:31:58,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:31:58,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:31:58,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:31:58,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:31:58,213 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:31:58,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:31:58,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:31:58,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:31:58,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:31:58,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:31:58,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:31:58,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:31:58,217 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:31:58,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:31:58,218 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:31:58,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:31:58,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:31:58,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:31:58,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:31:58,219 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:31:58,220 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:31:58,220 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:31:58,220 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:31:58,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:31:58,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:31:58,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:31:58,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:58,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:31:58,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:31:58,221 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:31:58,221 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:31:58,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:31:58,222 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:31:58,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:31:58,222 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:31:58,222 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:31:58,222 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 -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:31:58,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:31:58,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:31:58,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:31:58,548 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:31:58,552 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:31:58,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:31:59,620 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:31:59,878 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:31:59,879 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:31:59,894 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09096c1b3/520113938b054f28a16ef3a333171cee/FLAGdcca7caa5 [2023-08-31 23:31:59,905 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09096c1b3/520113938b054f28a16ef3a333171cee [2023-08-31 23:31:59,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:31:59,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:31:59,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:59,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:31:59,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:31:59,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:59" (1/1) ... [2023-08-31 23:31:59,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e864913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:59, skipping insertion in model container [2023-08-31 23:31:59,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:59" (1/1) ... [2023-08-31 23:31:59,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:31:59,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:32:00,131 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2023-08-31 23:32:00,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:32:00,381 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:32:00,393 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2023-08-31 23:32:00,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:32:00,494 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:32:00,494 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:32:00,500 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:32:00,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00 WrapperNode [2023-08-31 23:32:00,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:32:00,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:32:00,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:32:00,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:32:00,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,563 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2023-08-31 23:32:00,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:32:00,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:32:00,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:32:00,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:32:00,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,607 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:32:00,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:32:00,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:32:00,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:32:00,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (1/1) ... [2023-08-31 23:32:00,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:32:00,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:32:00,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:32:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:32:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:32:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:32:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:32:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:32:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:32:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:32:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:32:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:32:00,705 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:32:00,881 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:32:00,882 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:32:01,326 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:32:01,911 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:32:01,911 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:32:01,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:01 BoogieIcfgContainer [2023-08-31 23:32:01,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:32:01,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:32:01,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:32:01,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:32:01,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:31:59" (1/3) ... [2023-08-31 23:32:01,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b30847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:32:01, skipping insertion in model container [2023-08-31 23:32:01,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:00" (2/3) ... [2023-08-31 23:32:01,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b30847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:32:01, skipping insertion in model container [2023-08-31 23:32:01,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:01" (3/3) ... [2023-08-31 23:32:01,921 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-08-31 23:32:01,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:32:01,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-08-31 23:32:01,937 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:32:02,048 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:32:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 343 flow [2023-08-31 23:32:02,131 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2023-08-31 23:32:02,131 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:02,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:32:02,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 164 transitions, 343 flow [2023-08-31 23:32:02,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 331 flow [2023-08-31 23:32:02,152 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:32:02,160 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 331 flow [2023-08-31 23:32:02,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 331 flow [2023-08-31 23:32:02,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 331 flow [2023-08-31 23:32:02,205 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2023-08-31 23:32:02,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:02,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:32:02,209 INFO L119 LiptonReduction]: Number of co-enabled transitions 5008 [2023-08-31 23:32:17,321 INFO L134 LiptonReduction]: Checked pairs total: 20709 [2023-08-31 23:32:17,322 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-31 23:32:17,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:32:17,339 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;@3547d984, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:32:17,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-08-31 23:32:17,341 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:32:17,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:17,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:17,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:32:17,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:17,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash 928, now seen corresponding path program 1 times [2023-08-31 23:32:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598807209] [2023-08-31 23:32:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:17,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:17,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:32:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:17,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:32:17,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:17,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:17,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598807209] [2023-08-31 23:32:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598807209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:32:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529110662] [2023-08-31 23:32:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:17,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:32:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:32:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:32:17,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 310 [2023-08-31 23:32:17,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:17,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:17,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 310 [2023-08-31 23:32:17,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:18,795 INFO L130 PetriNetUnfolder]: 5032/7319 cut-off events. [2023-08-31 23:32:18,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14619 conditions, 7319 events. 5032/7319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 45347 event pairs, 5032 based on Foata normal form. 135/4040 useless extension candidates. Maximal degree in co-relation 14608. Up to 7254 conditions per place. [2023-08-31 23:32:18,847 INFO L137 encePairwiseOnDemand]: 289/310 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-31 23:32:18,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 165 flow [2023-08-31 23:32:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:32:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:32:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-31 23:32:18,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064516129032258 [2023-08-31 23:32:18,864 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-31 23:32:18,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-31 23:32:18,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:18,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-31 23:32:18,876 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-31 23:32:18,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 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-31 23:32:18,883 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 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-31 23:32:18,885 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 314 transitions. [2023-08-31 23:32:18,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 165 flow [2023-08-31 23:32:18,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:32:18,894 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-31 23:32:18,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:32:18,899 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:32:18,899 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-31 23:32:18,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:18,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:18,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:32:18,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:19,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:19,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 916761, now seen corresponding path program 1 times [2023-08-31 23:32:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424816600] [2023-08-31 23:32:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:19,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:19,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:19,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:32:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:19,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:19,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:19,293 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 23:32:19,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 23:32:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:19,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:19,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424816600] [2023-08-31 23:32:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424816600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:32:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30746445] [2023-08-31 23:32:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:19,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:32:19,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 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-31 23:32:19,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:19,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:32:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:20,346 INFO L130 PetriNetUnfolder]: 3241/4759 cut-off events. [2023-08-31 23:32:20,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:20,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9526 conditions, 4759 events. 3241/4759 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 27451 event pairs, 2121 based on Foata normal form. 120/3062 useless extension candidates. Maximal degree in co-relation 9523. Up to 2776 conditions per place. [2023-08-31 23:32:20,371 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-31 23:32:20,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 200 flow [2023-08-31 23:32:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:32:20,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2023-08-31 23:32:20,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:32:20,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:32:20,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:20,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:32:20,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:20,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:20,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:20,379 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:32:20,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 200 flow [2023-08-31 23:32:20,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:32:20,381 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 98 flow [2023-08-31 23:32:20,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-31 23:32:20,382 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2023-08-31 23:32:20,382 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 98 flow [2023-08-31 23:32:20,382 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-31 23:32:20,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:20,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:32:20,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:20,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:20,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash 916762, now seen corresponding path program 1 times [2023-08-31 23:32:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312936124] [2023-08-31 23:32:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:20,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:20,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:32:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:20,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:20,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:32:20,738 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-31 23:32:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:20,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:20,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312936124] [2023-08-31 23:32:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312936124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:32:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180007772] [2023-08-31 23:32:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:20,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:20,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:32:20,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:20,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:20,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:32:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:21,212 INFO L130 PetriNetUnfolder]: 1229/1885 cut-off events. [2023-08-31 23:32:21,212 INFO L131 PetriNetUnfolder]: For 105/129 co-relation queries the response was YES. [2023-08-31 23:32:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 1885 events. 1229/1885 cut-off events. For 105/129 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 9711 event pairs, 1229 based on Foata normal form. 0/1599 useless extension candidates. Maximal degree in co-relation 4027. Up to 1848 conditions per place. [2023-08-31 23:32:21,227 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 27 selfloop transitions, 1 changer transitions 1/33 dead transitions. [2023-08-31 23:32:21,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 144 flow [2023-08-31 23:32:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:32:21,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44731182795698926 [2023-08-31 23:32:21,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:32:21,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:32:21,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:21,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:32:21,232 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-31 23:32:21,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,234 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 98 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:32:21,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 144 flow [2023-08-31 23:32:21,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:21,237 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 82 flow [2023-08-31 23:32:21,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-31 23:32:21,239 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:32:21,241 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 82 flow [2023-08-31 23:32:21,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:21,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:21,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:21,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:21,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -887671296, now seen corresponding path program 1 times [2023-08-31 23:32:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429797738] [2023-08-31 23:32:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:21,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:32:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:21,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:21,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:21,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:21,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:21,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429797738] [2023-08-31 23:32:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429797738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:21,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:32:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814025520] [2023-08-31 23:32:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:21,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:21,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:32:21,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:21,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:32:21,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:21,948 INFO L130 PetriNetUnfolder]: 588/989 cut-off events. [2023-08-31 23:32:21,948 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2023-08-31 23:32:21,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 989 events. 588/989 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4884 event pairs, 191 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2106. Up to 921 conditions per place. [2023-08-31 23:32:21,953 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-31 23:32:21,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 194 flow [2023-08-31 23:32:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-31 23:32:21,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2023-08-31 23:32:21,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-31 23:32:21,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-31 23:32:21,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:21,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-31 23:32:21,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,961 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 82 flow. Second operand 3 states and 414 transitions. [2023-08-31 23:32:21,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 194 flow [2023-08-31 23:32:21,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:32:21,964 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2023-08-31 23:32:21,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-31 23:32:21,965 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-08-31 23:32:21,966 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2023-08-31 23:32:21,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:21,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:21,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:21,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:22,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:22,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:22,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2033365833, now seen corresponding path program 1 times [2023-08-31 23:32:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045906720] [2023-08-31 23:32:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:22,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:22,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:32:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:22,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:32:22,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:22,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:22,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045906720] [2023-08-31 23:32:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045906720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923656807] [2023-08-31 23:32:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:22,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:32:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:32:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:32:22,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:32:22,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:22,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:22,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:32:22,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:22,587 INFO L130 PetriNetUnfolder]: 161/334 cut-off events. [2023-08-31 23:32:22,587 INFO L131 PetriNetUnfolder]: For 60/62 co-relation queries the response was YES. [2023-08-31 23:32:22,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 334 events. 161/334 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1298 event pairs, 43 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 832. Up to 202 conditions per place. [2023-08-31 23:32:22,588 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-08-31 23:32:22,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 261 flow [2023-08-31 23:32:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:32:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:32:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-31 23:32:22,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2023-08-31 23:32:22,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-31 23:32:22,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-31 23:32:22,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:22,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-31 23:32:22,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:22,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:22,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:22,597 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 548 transitions. [2023-08-31 23:32:22,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 261 flow [2023-08-31 23:32:22,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:32:22,599 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2023-08-31 23:32:22,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-31 23:32:22,599 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-08-31 23:32:22,600 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2023-08-31 23:32:22,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:22,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:22,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:22,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:22,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:22,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:22,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1109804226, now seen corresponding path program 1 times [2023-08-31 23:32:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256734511] [2023-08-31 23:32:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:22,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:22,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:22,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:32:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:22,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:22,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:23,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:23,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256734511] [2023-08-31 23:32:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256734511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:32:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196882563] [2023-08-31 23:32:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:23,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:32:23,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:23,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:32:23,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:23,271 INFO L130 PetriNetUnfolder]: 82/172 cut-off events. [2023-08-31 23:32:23,271 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-31 23:32:23,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 172 events. 82/172 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 504 event pairs, 24 based on Foata normal form. 7/172 useless extension candidates. Maximal degree in co-relation 497. Up to 70 conditions per place. [2023-08-31 23:32:23,272 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 37 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2023-08-31 23:32:23,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 263 flow [2023-08-31 23:32:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:32:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:32:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-31 23:32:23,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4316129032258065 [2023-08-31 23:32:23,277 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-31 23:32:23,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-31 23:32:23,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:23,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-31 23:32:23,279 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-31 23:32:23,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,283 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,283 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 669 transitions. [2023-08-31 23:32:23,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 263 flow [2023-08-31 23:32:23,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:32:23,287 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-31 23:32:23,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-31 23:32:23,289 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:32:23,289 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-31 23:32:23,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:23,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:23,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:23,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:23,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:23,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1908138245, now seen corresponding path program 1 times [2023-08-31 23:32:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754412033] [2023-08-31 23:32:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:23,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:23,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:23,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:23,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:32:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:23,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:32:23,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:23,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:23,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754412033] [2023-08-31 23:32:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754412033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:23,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287799329] [2023-08-31 23:32:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:23,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:32:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:32:23,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:32:23,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 310 [2023-08-31 23:32:23,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:23,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 310 [2023-08-31 23:32:23,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:23,959 INFO L130 PetriNetUnfolder]: 94/211 cut-off events. [2023-08-31 23:32:23,959 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2023-08-31 23:32:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 211 events. 94/211 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 807 event pairs, 13 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 588. Up to 139 conditions per place. [2023-08-31 23:32:23,961 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-31 23:32:23,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-08-31 23:32:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:32:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:32:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-31 23:32:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2023-08-31 23:32:23,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-31 23:32:23,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-31 23:32:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:23,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-31 23:32:23,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,968 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 525 transitions. [2023-08-31 23:32:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-08-31 23:32:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:32:23,970 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-08-31 23:32:23,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-31 23:32:23,971 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:32:23,971 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-08-31 23:32:23,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:23,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:23,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:23,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:24,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:24,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1979677820, now seen corresponding path program 1 times [2023-08-31 23:32:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664360169] [2023-08-31 23:32:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:24,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:24,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:24,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:24,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:32:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:24,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:24,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:24,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:24,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664360169] [2023-08-31 23:32:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664360169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:24,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427290120] [2023-08-31 23:32:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:24,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:24,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:32:24,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:24,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:24,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:32:24,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:24,671 INFO L130 PetriNetUnfolder]: 94/210 cut-off events. [2023-08-31 23:32:24,672 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-31 23:32:24,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 210 events. 94/210 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 792 event pairs, 13 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 569. Up to 141 conditions per place. [2023-08-31 23:32:24,673 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-31 23:32:24,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 245 flow [2023-08-31 23:32:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:32:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:32:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-31 23:32:24,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2023-08-31 23:32:24,676 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-31 23:32:24,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-31 23:32:24,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:24,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-31 23:32:24,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:24,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:24,680 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:24,680 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 532 transitions. [2023-08-31 23:32:24,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 245 flow [2023-08-31 23:32:24,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:24,682 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-08-31 23:32:24,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:32:24,683 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:32:24,683 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-08-31 23:32:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:24,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:24,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:24,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:24,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:24,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:24,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1552673733, now seen corresponding path program 1 times [2023-08-31 23:32:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343336006] [2023-08-31 23:32:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:24,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:24,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:24,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:32:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:25,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:25,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:25,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:25,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343336006] [2023-08-31 23:32:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343336006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899949040] [2023-08-31 23:32:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:25,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:25,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:32:25,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:25,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:32:25,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:25,335 INFO L130 PetriNetUnfolder]: 141/297 cut-off events. [2023-08-31 23:32:25,335 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2023-08-31 23:32:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 297 events. 141/297 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1256 event pairs, 12 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 839. Up to 110 conditions per place. [2023-08-31 23:32:25,337 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-31 23:32:25,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 433 flow [2023-08-31 23:32:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:32:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:32:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-31 23:32:25,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2023-08-31 23:32:25,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-31 23:32:25,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-31 23:32:25,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:25,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-31 23:32:25,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,344 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,344 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 675 transitions. [2023-08-31 23:32:25,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 433 flow [2023-08-31 23:32:25,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:25,346 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 125 flow [2023-08-31 23:32:25,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-31 23:32:25,347 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-08-31 23:32:25,347 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 125 flow [2023-08-31 23:32:25,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:25,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:25,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:25,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:25,557 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:25,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash -896111119, now seen corresponding path program 2 times [2023-08-31 23:32:25,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116505397] [2023-08-31 23:32:25,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:32:25,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:25,559 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:25,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:32:25,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:32:25,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:32:25,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:25,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:32:25,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:25,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116505397] [2023-08-31 23:32:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116505397] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:25,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:25,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970952442] [2023-08-31 23:32:25,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:25,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:25,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:25,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:25,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:25,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:32:25,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:25,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:32:25,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:25,970 INFO L130 PetriNetUnfolder]: 187/403 cut-off events. [2023-08-31 23:32:25,970 INFO L131 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2023-08-31 23:32:25,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 403 events. 187/403 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1761 event pairs, 18 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 1246. Up to 150 conditions per place. [2023-08-31 23:32:25,972 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 70 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2023-08-31 23:32:25,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 462 flow [2023-08-31 23:32:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:32:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:32:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-31 23:32:25,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295698924731183 [2023-08-31 23:32:25,974 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-31 23:32:25,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-31 23:32:25,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:25,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-31 23:32:25,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,979 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,979 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 125 flow. Second operand 6 states and 799 transitions. [2023-08-31 23:32:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 462 flow [2023-08-31 23:32:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 452 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:32:25,982 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 159 flow [2023-08-31 23:32:25,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-31 23:32:25,982 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2023-08-31 23:32:25,983 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 159 flow [2023-08-31 23:32:25,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:32:25,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:25,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:25,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:26,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:26,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:32:26,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash 953730251, now seen corresponding path program 3 times [2023-08-31 23:32:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:26,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838869279] [2023-08-31 23:32:26,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:32:26,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:26,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:32:26,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:32:26,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:32:26,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:32:26,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:32:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:32:26,533 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:32:26,533 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:32:26,534 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-08-31 23:32:26,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-08-31 23:32:26,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-08-31 23:32:26,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-08-31 23:32:26,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-08-31 23:32:26,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-08-31 23:32:26,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-08-31 23:32:26,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-08-31 23:32:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-08-31 23:32:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-08-31 23:32:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-08-31 23:32:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-08-31 23:32:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-08-31 23:32:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-08-31 23:32:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-08-31 23:32:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-08-31 23:32:26,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:26,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:26,756 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:26,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:32:26,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:32:26,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:32:26 BasicIcfg [2023-08-31 23:32:26,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:32:26,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:32:26,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:32:26,841 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:32:26,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:01" (3/4) ... [2023-08-31 23:32:26,843 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:32:26,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:32:26,844 INFO L158 Benchmark]: Toolchain (without parser) took 26936.25ms. Allocated memory was 69.2MB in the beginning and 780.1MB in the end (delta: 710.9MB). Free memory was 44.7MB in the beginning and 625.2MB in the end (delta: -580.5MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,844 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 69.2MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:32:26,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.63ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.5MB in the beginning and 51.6MB in the end (delta: -7.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.21ms. Allocated memory is still 83.9MB. Free memory was 51.6MB in the beginning and 49.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,845 INFO L158 Benchmark]: Boogie Preprocessor took 52.98ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 46.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,845 INFO L158 Benchmark]: RCFGBuilder took 1295.98ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 60.9MB in the end (delta: -14.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,845 INFO L158 Benchmark]: TraceAbstraction took 24924.44ms. Allocated memory was 111.1MB in the beginning and 780.1MB in the end (delta: 669.0MB). Free memory was 60.2MB in the beginning and 625.2MB in the end (delta: -565.0MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2023-08-31 23:32:26,846 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 780.1MB. Free memory is still 625.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:32:26,847 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.11ms. Allocated memory is still 69.2MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.63ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.5MB in the beginning and 51.6MB in the end (delta: -7.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.21ms. Allocated memory is still 83.9MB. Free memory was 51.6MB in the beginning and 49.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.98ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 46.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1295.98ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 60.9MB in the end (delta: -14.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24924.44ms. Allocated memory was 111.1MB in the beginning and 780.1MB in the end (delta: 669.0MB). Free memory was 60.2MB in the beginning and 625.2MB in the end (delta: -565.0MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 780.1MB. Free memory is still 625.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2s, 169 PlacesBefore, 71 PlacesAfterwards, 161 TransitionsBefore, 62 TransitionsAfterwards, 5008 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 20709 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8431, independent: 7981, independent conditional: 0, independent unconditional: 7981, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2397, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8431, independent: 5657, independent conditional: 0, independent unconditional: 5657, dependent: 377, dependent conditional: 0, dependent unconditional: 377, unknown: 2397, unknown conditional: 0, unknown unconditional: 2397] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 440, Positive conditional cache size: 0, Positive unconditional cache size: 440, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=0, t1937={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=1, t1937={15:0}, t1938={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t1939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=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(&t1939, ((void *)0), P2, ((void *)0))=2, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, main$tmp_guard1=0, t1937={15:0}, t1938={5:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 210 locations, 61 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: 24.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 513 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 19 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=10, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 551 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1357 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:32:26,867 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