./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.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/mix019_tso.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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --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:13:42,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:42,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:42,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:42,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:42,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:42,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:42,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:42,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:42,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:42,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:42,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:42,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:42,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:42,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:42,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:42,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:42,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:42,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:42,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:42,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:42,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:42,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:42,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:42,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:42,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:42,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:42,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:42,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:42,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:42,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:42,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:42,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:42,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:42,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:42,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:42,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:42,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:42,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:42,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:42,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:42,245 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:13:42,272 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:42,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:42,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:42,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:42,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:42,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:42,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:42,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:42,275 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:42,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:42,276 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:42,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:42,277 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:42,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:42,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:42,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:42,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:42,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:42,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:13:42,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:13:42,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:42,280 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:42,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:42,280 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:42,280 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d 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:13:42,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:13:42,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:13:42,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:13:42,523 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:13:42,524 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:13:42,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-31 23:13:43,510 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:13:43,770 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:13:43,770 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-31 23:13:43,788 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c655c16/72dfeee079644601ac11d14589a9ceec/FLAG15d61617f [2023-08-31 23:13:43,800 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c655c16/72dfeee079644601ac11d14589a9ceec [2023-08-31 23:13:43,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:13:43,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:13:43,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:43,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:13:43,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:13:43,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:43" (1/1) ... [2023-08-31 23:13:43,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0a6866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:43, skipping insertion in model container [2023-08-31 23:13:43,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:43" (1/1) ... [2023-08-31 23:13:43,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:13:43,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:13:44,024 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/mix019_tso.oepc.i[949,962] [2023-08-31 23:13:44,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:44,222 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:13:44,235 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/mix019_tso.oepc.i[949,962] [2023-08-31 23:13:44,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:44,287 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:44,287 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:44,292 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:13:44,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44 WrapperNode [2023-08-31 23:13:44,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:44,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:44,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:13:44,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:13:44,299 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:13:44" (1/1) ... [2023-08-31 23:13:44,325 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:13:44" (1/1) ... [2023-08-31 23:13:44,354 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:13:44,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:44,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:13:44,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:13:44,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:13:44,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:13:44,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:13:44,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:13:44,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:13:44,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (1/1) ... [2023-08-31 23:13:44,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:44,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:13:44,432 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:13:44,435 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:13:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:13:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:13:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:13:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:13:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:13:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:13:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:13:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:13:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:13:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:13:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:13:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:13:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:13:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:13:44,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:13:44,461 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:13:44,568 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:13:44,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:13:44,851 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:13:44,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:13:44,924 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:13:44,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:44 BoogieIcfgContainer [2023-08-31 23:13:44,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:13:44,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:13:44,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:13:44,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:13:44,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:13:43" (1/3) ... [2023-08-31 23:13:44,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e892f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:44, skipping insertion in model container [2023-08-31 23:13:44,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:44" (2/3) ... [2023-08-31 23:13:44,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e892f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:44, skipping insertion in model container [2023-08-31 23:13:44,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:44" (3/3) ... [2023-08-31 23:13:44,932 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-08-31 23:13:44,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:13:44,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:13:44,945 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:13:45,002 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:13:45,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2023-08-31 23:13:45,084 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-31 23:13:45,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:45,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-31 23:13:45,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2023-08-31 23:13:45,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-08-31 23:13:45,097 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:13:45,111 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-31 23:13:45,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-31 23:13:45,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-08-31 23:13:45,148 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-31 23:13:45,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:45,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-31 23:13:45,150 INFO L119 LiptonReduction]: Number of co-enabled transitions 2220 [2023-08-31 23:13:48,139 INFO L134 LiptonReduction]: Checked pairs total: 6642 [2023-08-31 23:13:48,140 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-31 23:13:48,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:13:48,160 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;@b676d93, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:13:48,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:13:48,161 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:13:48,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:48,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:13:48,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:48,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash 519, now seen corresponding path program 1 times [2023-08-31 23:13:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988314147] [2023-08-31 23:13:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988314147] [2023-08-31 23:13:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988314147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:13:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027486872] [2023-08-31 23:13:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:48,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:13:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:13:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:13:48,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-31 23:13:48,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:48,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-31 23:13:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:48,521 INFO L130 PetriNetUnfolder]: 1461/2189 cut-off events. [2023-08-31 23:13:48,521 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-31 23:13:48,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 2189 events. 1461/2189 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10848 event pairs, 1461 based on Foata normal form. 80/1827 useless extension candidates. Maximal degree in co-relation 4383. Up to 2151 conditions per place. [2023-08-31 23:13:48,542 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 23:13:48,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 109 flow [2023-08-31 23:13:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:13:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:13:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2023-08-31 23:13:48,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5281385281385281 [2023-08-31 23:13:48,552 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 244 transitions. [2023-08-31 23:13:48,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 244 transitions. [2023-08-31 23:13:48,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:48,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 244 transitions. [2023-08-31 23:13:48,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,560 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,561 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 244 transitions. [2023-08-31 23:13:48,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 109 flow [2023-08-31 23:13:48,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:48,564 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-31 23:13:48,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 23:13:48,567 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-31 23:13:48,568 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-31 23:13:48,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:13:48,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:13:48,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:48,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 491873113, now seen corresponding path program 1 times [2023-08-31 23:13:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045405206] [2023-08-31 23:13:48,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045405206] [2023-08-31 23:13:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045405206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:13:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114037899] [2023-08-31 23:13:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:48,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-31 23:13:48,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:48,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-31 23:13:48,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:48,963 INFO L130 PetriNetUnfolder]: 1143/1841 cut-off events. [2023-08-31 23:13:48,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:48,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1841 events. 1143/1841 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10140 event pairs, 189 based on Foata normal form. 0/1628 useless extension candidates. Maximal degree in co-relation 3579. Up to 1363 conditions per place. [2023-08-31 23:13:48,971 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-31 23:13:48,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 164 flow [2023-08-31 23:13:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-31 23:13:48,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137085137085137 [2023-08-31 23:13:48,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-31 23:13:48,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-31 23:13:48,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:48,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-31 23:13:48,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,977 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 356 transitions. [2023-08-31 23:13:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 164 flow [2023-08-31 23:13:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:13:48,978 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2023-08-31 23:13:48,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-31 23:13:48,979 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-08-31 23:13:48,979 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2023-08-31 23:13:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:48,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:13:48,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:48,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1916449549, now seen corresponding path program 1 times [2023-08-31 23:13:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905008019] [2023-08-31 23:13:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:49,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905008019] [2023-08-31 23:13:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905008019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025113951] [2023-08-31 23:13:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:49,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:49,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 231 [2023-08-31 23:13:49,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 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:13:49,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:49,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 231 [2023-08-31 23:13:49,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:49,750 INFO L130 PetriNetUnfolder]: 1747/2557 cut-off events. [2023-08-31 23:13:49,750 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2023-08-31 23:13:49,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 2557 events. 1747/2557 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11404 event pairs, 395 based on Foata normal form. 0/2476 useless extension candidates. Maximal degree in co-relation 5324. Up to 1301 conditions per place. [2023-08-31 23:13:49,761 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 49 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-31 23:13:49,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 234 flow [2023-08-31 23:13:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-31 23:13:49,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640692640692641 [2023-08-31 23:13:49,763 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-31 23:13:49,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-31 23:13:49,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:49,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-31 23:13:49,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,767 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 5 states and 536 transitions. [2023-08-31 23:13:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 234 flow [2023-08-31 23:13:49,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:49,769 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 88 flow [2023-08-31 23:13:49,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:13:49,769 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-31 23:13:49,769 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 88 flow [2023-08-31 23:13:49,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 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:13:49,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:49,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:49,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:13:49,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:49,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1916449593, now seen corresponding path program 1 times [2023-08-31 23:13:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591649188] [2023-08-31 23:13:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591649188] [2023-08-31 23:13:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591649188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:50,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:50,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078958074] [2023-08-31 23:13:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:50,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 231 [2023-08-31 23:13:50,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:50,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 231 [2023-08-31 23:13:50,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:50,327 INFO L130 PetriNetUnfolder]: 871/1397 cut-off events. [2023-08-31 23:13:50,328 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2023-08-31 23:13:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1397 events. 871/1397 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6812 event pairs, 176 based on Foata normal form. 128/1525 useless extension candidates. Maximal degree in co-relation 3105. Up to 880 conditions per place. [2023-08-31 23:13:50,334 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 33 selfloop transitions, 4 changer transitions 2/42 dead transitions. [2023-08-31 23:13:50,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 190 flow [2023-08-31 23:13:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2023-08-31 23:13:50,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42712842712842713 [2023-08-31 23:13:50,336 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2023-08-31 23:13:50,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2023-08-31 23:13:50,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:50,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2023-08-31 23:13:50,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,340 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,340 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 88 flow. Second operand 6 states and 592 transitions. [2023-08-31 23:13:50,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 190 flow [2023-08-31 23:13:50,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:50,343 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 70 flow [2023-08-31 23:13:50,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2023-08-31 23:13:50,344 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-31 23:13:50,344 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 70 flow [2023-08-31 23:13:50,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:50,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:50,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:13:50,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:50,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1752995255, now seen corresponding path program 1 times [2023-08-31 23:13:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290573183] [2023-08-31 23:13:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:50,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290573183] [2023-08-31 23:13:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290573183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:50,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:50,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116624922] [2023-08-31 23:13:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:50,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:50,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-31 23:13:50,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:50,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-31 23:13:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:50,916 INFO L130 PetriNetUnfolder]: 882/1427 cut-off events. [2023-08-31 23:13:50,916 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2023-08-31 23:13:50,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1427 events. 882/1427 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7140 event pairs, 238 based on Foata normal form. 64/1482 useless extension candidates. Maximal degree in co-relation 3031. Up to 1065 conditions per place. [2023-08-31 23:13:50,921 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 36 selfloop transitions, 6 changer transitions 21/66 dead transitions. [2023-08-31 23:13:50,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 298 flow [2023-08-31 23:13:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2023-08-31 23:13:50,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49103277674706247 [2023-08-31 23:13:50,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 794 transitions. [2023-08-31 23:13:50,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 794 transitions. [2023-08-31 23:13:50,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:50,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 794 transitions. [2023-08-31 23:13:50,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,928 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,929 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 70 flow. Second operand 7 states and 794 transitions. [2023-08-31 23:13:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 298 flow [2023-08-31 23:13:50,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 279 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:50,931 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 110 flow [2023-08-31 23:13:50,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-31 23:13:50,932 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-31 23:13:50,932 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 110 flow [2023-08-31 23:13:50,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:50,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:50,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:13:50,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:50,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1540337918, now seen corresponding path program 1 times [2023-08-31 23:13:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876640555] [2023-08-31 23:13:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876640555] [2023-08-31 23:13:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876640555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874946023] [2023-08-31 23:13:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:51,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 231 [2023-08-31 23:13:51,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:51,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 231 [2023-08-31 23:13:51,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:51,673 INFO L130 PetriNetUnfolder]: 1701/2548 cut-off events. [2023-08-31 23:13:51,673 INFO L131 PetriNetUnfolder]: For 1970/1970 co-relation queries the response was YES. [2023-08-31 23:13:51,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 2548 events. 1701/2548 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11326 event pairs, 441 based on Foata normal form. 74/2622 useless extension candidates. Maximal degree in co-relation 6965. Up to 1920 conditions per place. [2023-08-31 23:13:51,684 INFO L137 encePairwiseOnDemand]: 222/231 looper letters, 47 selfloop transitions, 11 changer transitions 18/76 dead transitions. [2023-08-31 23:13:51,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 428 flow [2023-08-31 23:13:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 737 transitions. [2023-08-31 23:13:51,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2023-08-31 23:13:51,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 737 transitions. [2023-08-31 23:13:51,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 737 transitions. [2023-08-31 23:13:51,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:51,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 737 transitions. [2023-08-31 23:13:51,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,690 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 110 flow. Second operand 7 states and 737 transitions. [2023-08-31 23:13:51,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 428 flow [2023-08-31 23:13:51,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 424 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:13:51,696 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 195 flow [2023-08-31 23:13:51,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=195, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-31 23:13:51,697 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-31 23:13:51,697 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 195 flow [2023-08-31 23:13:51,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:51,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:51,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:13:51,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:51,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -505890498, now seen corresponding path program 1 times [2023-08-31 23:13:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688879982] [2023-08-31 23:13:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688879982] [2023-08-31 23:13:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688879982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:13:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19203290] [2023-08-31 23:13:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:52,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:13:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:52,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:13:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:13:52,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 231 [2023-08-31 23:13:52,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:52,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 231 [2023-08-31 23:13:52,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:52,396 INFO L130 PetriNetUnfolder]: 1082/1756 cut-off events. [2023-08-31 23:13:52,397 INFO L131 PetriNetUnfolder]: For 3727/3926 co-relation queries the response was YES. [2023-08-31 23:13:52,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 1756 events. 1082/1756 cut-off events. For 3727/3926 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8752 event pairs, 257 based on Foata normal form. 31/1748 useless extension candidates. Maximal degree in co-relation 5984. Up to 1336 conditions per place. [2023-08-31 23:13:52,408 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 48 selfloop transitions, 9 changer transitions 10/72 dead transitions. [2023-08-31 23:13:52,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 505 flow [2023-08-31 23:13:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions. [2023-08-31 23:13:52,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48268398268398266 [2023-08-31 23:13:52,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 669 transitions. [2023-08-31 23:13:52,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions. [2023-08-31 23:13:52,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:52,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions. [2023-08-31 23:13:52,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 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:13:52,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,413 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 195 flow. Second operand 6 states and 669 transitions. [2023-08-31 23:13:52,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 505 flow [2023-08-31 23:13:52,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 492 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:52,442 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 249 flow [2023-08-31 23:13:52,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 23:13:52,443 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-31 23:13:52,443 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 249 flow [2023-08-31 23:13:52,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:52,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:52,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:13:52,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:52,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash 51479892, now seen corresponding path program 2 times [2023-08-31 23:13:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139225598] [2023-08-31 23:13:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139225598] [2023-08-31 23:13:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139225598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:13:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638770403] [2023-08-31 23:13:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:52,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:13:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:52,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:13:52,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:13:52,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-31 23:13:52,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:52,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-31 23:13:52,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:53,102 INFO L130 PetriNetUnfolder]: 1058/1726 cut-off events. [2023-08-31 23:13:53,102 INFO L131 PetriNetUnfolder]: For 5141/5417 co-relation queries the response was YES. [2023-08-31 23:13:53,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 1726 events. 1058/1726 cut-off events. For 5141/5417 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8590 event pairs, 245 based on Foata normal form. 50/1737 useless extension candidates. Maximal degree in co-relation 6344. Up to 1320 conditions per place. [2023-08-31 23:13:53,112 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 49 selfloop transitions, 6 changer transitions 12/72 dead transitions. [2023-08-31 23:13:53,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 545 flow [2023-08-31 23:13:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 673 transitions. [2023-08-31 23:13:53,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855699855699856 [2023-08-31 23:13:53,114 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 673 transitions. [2023-08-31 23:13:53,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 673 transitions. [2023-08-31 23:13:53,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:53,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 673 transitions. [2023-08-31 23:13:53,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,119 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 249 flow. Second operand 6 states and 673 transitions. [2023-08-31 23:13:53,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 545 flow [2023-08-31 23:13:53,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 520 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:53,126 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 249 flow [2023-08-31 23:13:53,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-31 23:13:53,128 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-31 23:13:53,128 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 249 flow [2023-08-31 23:13:53,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:53,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:53,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:13:53,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:53,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1794093869, now seen corresponding path program 1 times [2023-08-31 23:13:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108462584] [2023-08-31 23:13:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108462584] [2023-08-31 23:13:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108462584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:53,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847693672] [2023-08-31 23:13:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:53,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:53,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:53,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:53,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 231 [2023-08-31 23:13:53,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:53,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 231 [2023-08-31 23:13:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:53,777 INFO L130 PetriNetUnfolder]: 1558/2571 cut-off events. [2023-08-31 23:13:53,777 INFO L131 PetriNetUnfolder]: For 6926/7003 co-relation queries the response was YES. [2023-08-31 23:13:53,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9296 conditions, 2571 events. 1558/2571 cut-off events. For 6926/7003 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14264 event pairs, 253 based on Foata normal form. 119/2685 useless extension candidates. Maximal degree in co-relation 9279. Up to 1092 conditions per place. [2023-08-31 23:13:53,789 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 57 selfloop transitions, 3 changer transitions 13/81 dead transitions. [2023-08-31 23:13:53,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 634 flow [2023-08-31 23:13:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-31 23:13:53,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831168831168831 [2023-08-31 23:13:53,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-31 23:13:53,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-31 23:13:53,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:53,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-31 23:13:53,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 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:13:53,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,794 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 249 flow. Second operand 5 states and 558 transitions. [2023-08-31 23:13:53,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 634 flow [2023-08-31 23:13:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 606 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-31 23:13:53,803 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 261 flow [2023-08-31 23:13:53,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-31 23:13:53,803 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-31 23:13:53,803 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 261 flow [2023-08-31 23:13:53,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:53,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:53,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:13:53,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:53,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 210202517, now seen corresponding path program 2 times [2023-08-31 23:13:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44895443] [2023-08-31 23:13:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44895443] [2023-08-31 23:13:53,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44895443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:53,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:53,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456672436] [2023-08-31 23:13:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:53,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:53,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-31 23:13:53,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:53,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-31 23:13:53,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:54,125 INFO L130 PetriNetUnfolder]: 705/1239 cut-off events. [2023-08-31 23:13:54,125 INFO L131 PetriNetUnfolder]: For 3315/3396 co-relation queries the response was YES. [2023-08-31 23:13:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4527 conditions, 1239 events. 705/1239 cut-off events. For 3315/3396 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6517 event pairs, 183 based on Foata normal form. 118/1337 useless extension candidates. Maximal degree in co-relation 4510. Up to 972 conditions per place. [2023-08-31 23:13:54,137 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 44 selfloop transitions, 4 changer transitions 1/61 dead transitions. [2023-08-31 23:13:54,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 463 flow [2023-08-31 23:13:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-31 23:13:54,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2023-08-31 23:13:54,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-31 23:13:54,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-31 23:13:54,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:54,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-31 23:13:54,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,141 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 261 flow. Second operand 3 states and 342 transitions. [2023-08-31 23:13:54,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 463 flow [2023-08-31 23:13:54,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 459 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:54,147 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 284 flow [2023-08-31 23:13:54,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-31 23:13:54,148 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-31 23:13:54,148 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 284 flow [2023-08-31 23:13:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:54,149 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:13:54,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:13:54,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:54,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -840564544, now seen corresponding path program 1 times [2023-08-31 23:13:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668550446] [2023-08-31 23:13:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668550446] [2023-08-31 23:13:54,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668550446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:54,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:54,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011279788] [2023-08-31 23:13:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:54,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-31 23:13:54,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:54,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-31 23:13:54,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:54,435 INFO L130 PetriNetUnfolder]: 316/635 cut-off events. [2023-08-31 23:13:54,436 INFO L131 PetriNetUnfolder]: For 1488/1531 co-relation queries the response was YES. [2023-08-31 23:13:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 635 events. 316/635 cut-off events. For 1488/1531 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3090 event pairs, 70 based on Foata normal form. 90/717 useless extension candidates. Maximal degree in co-relation 2466. Up to 191 conditions per place. [2023-08-31 23:13:54,439 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 54 selfloop transitions, 7 changer transitions 1/74 dead transitions. [2023-08-31 23:13:54,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 573 flow [2023-08-31 23:13:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:13:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:13:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-31 23:13:54,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2023-08-31 23:13:54,441 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-31 23:13:54,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-31 23:13:54,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:54,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-31 23:13:54,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,443 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 284 flow. Second operand 4 states and 456 transitions. [2023-08-31 23:13:54,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 573 flow [2023-08-31 23:13:54,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 562 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:54,446 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 314 flow [2023-08-31 23:13:54,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-31 23:13:54,447 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-31 23:13:54,447 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 314 flow [2023-08-31 23:13:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:54,448 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:13:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:13:54,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:54,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1261320887, now seen corresponding path program 1 times [2023-08-31 23:13:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71044259] [2023-08-31 23:13:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71044259] [2023-08-31 23:13:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71044259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:54,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325617638] [2023-08-31 23:13:54,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:54,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:54,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-31 23:13:54,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:54,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-31 23:13:54,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:54,749 INFO L130 PetriNetUnfolder]: 260/516 cut-off events. [2023-08-31 23:13:54,749 INFO L131 PetriNetUnfolder]: For 1464/1490 co-relation queries the response was YES. [2023-08-31 23:13:54,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 516 events. 260/516 cut-off events. For 1464/1490 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2468 event pairs, 62 based on Foata normal form. 42/550 useless extension candidates. Maximal degree in co-relation 2068. Up to 191 conditions per place. [2023-08-31 23:13:54,751 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 42 selfloop transitions, 10 changer transitions 10/73 dead transitions. [2023-08-31 23:13:54,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 583 flow [2023-08-31 23:13:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-31 23:13:54,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48398268398268396 [2023-08-31 23:13:54,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-31 23:13:54,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-31 23:13:54,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:54,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-31 23:13:54,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,756 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 314 flow. Second operand 5 states and 559 transitions. [2023-08-31 23:13:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 583 flow [2023-08-31 23:13:54,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 534 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-08-31 23:13:54,759 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 266 flow [2023-08-31 23:13:54,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-31 23:13:54,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2023-08-31 23:13:54,760 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 266 flow [2023-08-31 23:13:54,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:54,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:13:54,761 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:54,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 302995051, now seen corresponding path program 1 times [2023-08-31 23:13:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201092521] [2023-08-31 23:13:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201092521] [2023-08-31 23:13:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201092521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:13:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621100736] [2023-08-31 23:13:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:13:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:13:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:13:55,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 231 [2023-08-31 23:13:55,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 266 flow. Second operand has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:55,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 231 [2023-08-31 23:13:55,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:55,723 INFO L130 PetriNetUnfolder]: 567/1007 cut-off events. [2023-08-31 23:13:55,724 INFO L131 PetriNetUnfolder]: For 3146/3146 co-relation queries the response was YES. [2023-08-31 23:13:55,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 1007 events. 567/1007 cut-off events. For 3146/3146 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4724 event pairs, 59 based on Foata normal form. 1/1008 useless extension candidates. Maximal degree in co-relation 4271. Up to 571 conditions per place. [2023-08-31 23:13:55,726 INFO L137 encePairwiseOnDemand]: 223/231 looper letters, 42 selfloop transitions, 3 changer transitions 76/121 dead transitions. [2023-08-31 23:13:55,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 121 transitions, 983 flow [2023-08-31 23:13:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:13:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:13:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1282 transitions. [2023-08-31 23:13:55,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269064269064269 [2023-08-31 23:13:55,729 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1282 transitions. [2023-08-31 23:13:55,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1282 transitions. [2023-08-31 23:13:55,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:55,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1282 transitions. [2023-08-31 23:13:55,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.61538461538461) internal successors, (1282), 13 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,736 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,736 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 266 flow. Second operand 13 states and 1282 transitions. [2023-08-31 23:13:55,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 121 transitions, 983 flow [2023-08-31 23:13:55,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 121 transitions, 864 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:55,746 INFO L231 Difference]: Finished difference. Result has 71 places, 35 transitions, 192 flow [2023-08-31 23:13:55,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=192, PETRI_PLACES=71, PETRI_TRANSITIONS=35} [2023-08-31 23:13:55,747 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-31 23:13:55,747 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 35 transitions, 192 flow [2023-08-31 23:13:55,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:55,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:55,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:13:55,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:55,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 471621435, now seen corresponding path program 2 times [2023-08-31 23:13:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856080224] [2023-08-31 23:13:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856080224] [2023-08-31 23:13:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856080224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:13:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482254613] [2023-08-31 23:13:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:56,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:13:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:56,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:13:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:13:56,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-31 23:13:56,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 35 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:56,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:56,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-31 23:13:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:56,357 INFO L130 PetriNetUnfolder]: 174/348 cut-off events. [2023-08-31 23:13:56,357 INFO L131 PetriNetUnfolder]: For 571/573 co-relation queries the response was YES. [2023-08-31 23:13:56,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 348 events. 174/348 cut-off events. For 571/573 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1328 event pairs, 62 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 1301. Up to 217 conditions per place. [2023-08-31 23:13:56,358 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 33 selfloop transitions, 7 changer transitions 9/52 dead transitions. [2023-08-31 23:13:56,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 378 flow [2023-08-31 23:13:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-31 23:13:56,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47445887445887447 [2023-08-31 23:13:56,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-31 23:13:56,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-31 23:13:56,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:56,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-31 23:13:56,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 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:13:56,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:56,363 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:56,363 INFO L175 Difference]: Start difference. First operand has 71 places, 35 transitions, 192 flow. Second operand 5 states and 548 transitions. [2023-08-31 23:13:56,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 378 flow [2023-08-31 23:13:56,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 350 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-31 23:13:56,365 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 210 flow [2023-08-31 23:13:56,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-08-31 23:13:56,366 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-31 23:13:56,366 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 210 flow [2023-08-31 23:13:56,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:56,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:56,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:56,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:13:56,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:56,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -779748399, now seen corresponding path program 3 times [2023-08-31 23:13:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040499350] [2023-08-31 23:13:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:57,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040499350] [2023-08-31 23:13:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040499350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:57,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:13:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382950976] [2023-08-31 23:13:57,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:57,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:13:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:13:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:13:57,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 231 [2023-08-31 23:13:57,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 210 flow. Second operand has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:57,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 231 [2023-08-31 23:13:57,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:57,774 INFO L130 PetriNetUnfolder]: 222/435 cut-off events. [2023-08-31 23:13:57,774 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2023-08-31 23:13:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 435 events. 222/435 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1732 event pairs, 15 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1726. Up to 203 conditions per place. [2023-08-31 23:13:57,776 INFO L137 encePairwiseOnDemand]: 223/231 looper letters, 38 selfloop transitions, 8 changer transitions 37/83 dead transitions. [2023-08-31 23:13:57,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 613 flow [2023-08-31 23:13:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:13:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:13:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 788 transitions. [2023-08-31 23:13:57,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2023-08-31 23:13:57,778 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 788 transitions. [2023-08-31 23:13:57,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 788 transitions. [2023-08-31 23:13:57,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:57,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 788 transitions. [2023-08-31 23:13:57,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,782 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,782 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 210 flow. Second operand 8 states and 788 transitions. [2023-08-31 23:13:57,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 613 flow [2023-08-31 23:13:57,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 590 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:57,784 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 220 flow [2023-08-31 23:13:57,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2023-08-31 23:13:57,785 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-08-31 23:13:57,785 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 220 flow [2023-08-31 23:13:57,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:57,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:57,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:13:57,786 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:57,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1091666665, now seen corresponding path program 4 times [2023-08-31 23:13:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:57,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384244117] [2023-08-31 23:13:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:57,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:13:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:57,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:13:57,884 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:13:57,885 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:13:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:13:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:13:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:13:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:13:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:13:57,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:13:57,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:13:57,890 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:57,894 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:13:57,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:13:57,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:13:57 BasicIcfg [2023-08-31 23:13:57,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:13:57,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:13:57,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:13:57,955 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:13:57,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:44" (3/4) ... [2023-08-31 23:13:57,957 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:13:57,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:13:57,957 INFO L158 Benchmark]: Toolchain (without parser) took 14153.10ms. Allocated memory was 79.7MB in the beginning and 723.5MB in the end (delta: 643.8MB). Free memory was 55.9MB in the beginning and 370.4MB in the end (delta: -314.6MB). Peak memory consumption was 332.3MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,958 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:57,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.68ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 52.2MB in the end (delta: 3.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 79.7MB. Free memory was 52.2MB in the beginning and 49.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,958 INFO L158 Benchmark]: Boogie Preprocessor took 54.41ms. Allocated memory is still 79.7MB. Free memory was 49.3MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,958 INFO L158 Benchmark]: RCFGBuilder took 515.92ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 37.3MB in the end (delta: 10.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,959 INFO L158 Benchmark]: TraceAbstraction took 13026.85ms. Allocated memory was 79.7MB in the beginning and 723.5MB in the end (delta: 643.8MB). Free memory was 36.5MB in the beginning and 370.4MB in the end (delta: -333.9MB). Peak memory consumption was 309.3MB. Max. memory is 16.1GB. [2023-08-31 23:13:57,959 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 723.5MB. Free memory is still 370.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:57,960 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.17ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.68ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 52.2MB in the end (delta: 3.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 79.7MB. Free memory was 52.2MB in the beginning and 49.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.41ms. Allocated memory is still 79.7MB. Free memory was 49.3MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.92ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 37.3MB in the end (delta: 10.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13026.85ms. Allocated memory was 79.7MB in the beginning and 723.5MB in the end (delta: 643.8MB). Free memory was 36.5MB in the beginning and 370.4MB in the end (delta: -333.9MB). Peak memory consumption was 309.3MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 723.5MB. Free memory is still 370.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 125 PlacesBefore, 43 PlacesAfterwards, 117 TransitionsBefore, 34 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 6642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2868, independent: 2667, independent conditional: 0, independent unconditional: 2667, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1166, independent: 1136, independent conditional: 0, independent unconditional: 1136, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2868, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 1166, unknown conditional: 0, unknown unconditional: 1166] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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, 148 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 772 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2255 IncrementalHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 92 mSDtfsCounter, 2255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=11, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:13:57,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --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:13:59,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:59,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:59,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:59,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:59,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:59,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:59,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:59,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:59,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:59,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:59,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:59,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:59,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:59,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:59,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:59,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:59,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:59,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:59,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:59,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:59,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:59,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:59,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:59,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:59,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:59,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:59,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:59,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:59,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:59,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:59,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:59,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:59,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:59,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:59,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:59,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:59,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:59,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:59,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:59,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:59,725 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:13:59,758 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:59,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:59,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:59,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:59,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:59,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:59,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:59,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:59,760 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:59,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:59,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:59,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:59,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:59,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:13:59,763 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:59,763 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d 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:14:00,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:14:00,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:14:00,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:14:00,156 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:14:00,156 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:14:00,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-31 23:14:01,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:14:01,401 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:14:01,403 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-31 23:14:01,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94887aa39/e3a95afd5acc4371a11b939aa4a5ac64/FLAG6dd8cc733 [2023-08-31 23:14:01,428 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94887aa39/e3a95afd5acc4371a11b939aa4a5ac64 [2023-08-31 23:14:01,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:14:01,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:14:01,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:01,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:14:01,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:14:01,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0b6f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01, skipping insertion in model container [2023-08-31 23:14:01,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:14:01,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:14:01,604 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/mix019_tso.oepc.i[949,962] [2023-08-31 23:14:01,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:01,792 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:14:01,803 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/mix019_tso.oepc.i[949,962] [2023-08-31 23:14:01,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:01,850 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:01,850 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:01,855 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:14:01,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01 WrapperNode [2023-08-31 23:14:01,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:01,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:01,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:14:01,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:14:01,860 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:14:01" (1/1) ... [2023-08-31 23:14:01,872 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:14:01" (1/1) ... [2023-08-31 23:14:01,888 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-31 23:14:01,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:01,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:14:01,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:14:01,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:14:01,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:14:01,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:14:01,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:14:01,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:14:01,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (1/1) ... [2023-08-31 23:14:01,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:01,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:14:01,948 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:14:01,950 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:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:14:01,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:14:01,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:14:01,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:14:01,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:14:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:14:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:14:01,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:14:01,973 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:14:02,191 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:14:02,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:14:02,486 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:14:02,592 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:14:02,592 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:14:02,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:02 BoogieIcfgContainer [2023-08-31 23:14:02,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:14:02,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:14:02,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:14:02,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:14:02,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:14:01" (1/3) ... [2023-08-31 23:14:02,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:02, skipping insertion in model container [2023-08-31 23:14:02,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:01" (2/3) ... [2023-08-31 23:14:02,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:02, skipping insertion in model container [2023-08-31 23:14:02,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:02" (3/3) ... [2023-08-31 23:14:02,599 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-08-31 23:14:02,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:14:02,612 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:14:02,612 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:14:02,680 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:14:02,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-31 23:14:02,763 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-31 23:14:02,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:02,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-31 23:14:02,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-31 23:14:02,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-31 23:14:02,774 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:14:02,787 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-31 23:14:02,789 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-31 23:14:02,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-31 23:14:02,820 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-31 23:14:02,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:02,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-31 23:14:02,824 INFO L119 LiptonReduction]: Number of co-enabled transitions 2220 [2023-08-31 23:14:07,203 INFO L134 LiptonReduction]: Checked pairs total: 6597 [2023-08-31 23:14:07,203 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-31 23:14:07,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:07,217 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;@39938128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:07,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:14:07,219 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:14:07,219 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:07,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:07,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:07,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:07,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 523, now seen corresponding path program 1 times [2023-08-31 23:14:07,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81221644] [2023-08-31 23:14:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:07,232 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:14:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:07,267 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:14:07,298 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:14:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:07,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:14:07,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:07,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:07,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:07,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81221644] [2023-08-31 23:14:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81221644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:07,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:07,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768289623] [2023-08-31 23:14:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:07,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:07,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-31 23:14:07,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:07,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-31 23:14:07,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:07,734 INFO L130 PetriNetUnfolder]: 1461/2187 cut-off events. [2023-08-31 23:14:07,735 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-31 23:14:07,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4392 conditions, 2187 events. 1461/2187 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10776 event pairs, 1461 based on Foata normal form. 80/1827 useless extension candidates. Maximal degree in co-relation 4381. Up to 2151 conditions per place. [2023-08-31 23:14:07,750 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 23:14:07,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 109 flow [2023-08-31 23:14:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:14:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:14:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 246 transitions. [2023-08-31 23:14:07,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5278969957081545 [2023-08-31 23:14:07,763 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 246 transitions. [2023-08-31 23:14:07,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 246 transitions. [2023-08-31 23:14:07,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:07,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 246 transitions. [2023-08-31 23:14:07,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,787 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,788 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 246 transitions. [2023-08-31 23:14:07,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 109 flow [2023-08-31 23:14:07,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:07,795 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-31 23:14:07,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 23:14:07,799 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-31 23:14:07,799 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-31 23:14:07,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:07,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:07,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:14:07,813 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:14:08,007 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:14:08,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:08,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 493781725, now seen corresponding path program 1 times [2023-08-31 23:14:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114568269] [2023-08-31 23:14:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:08,009 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:14:08,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:08,010 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:14:08,012 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:14:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:08,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:08,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:08,084 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:14:08,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:08,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114568269] [2023-08-31 23:14:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114568269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127818672] [2023-08-31 23:14:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:08,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-31 23:14:08,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:08,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-31 23:14:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:08,271 INFO L130 PetriNetUnfolder]: 1143/1842 cut-off events. [2023-08-31 23:14:08,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:08,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1842 events. 1143/1842 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10228 event pairs, 189 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 3580. Up to 1363 conditions per place. [2023-08-31 23:14:08,277 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-31 23:14:08,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 164 flow [2023-08-31 23:14:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-31 23:14:08,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135908440629471 [2023-08-31 23:14:08,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-31 23:14:08,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-31 23:14:08,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:08,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-31 23:14:08,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,282 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 359 transitions. [2023-08-31 23:14:08,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 164 flow [2023-08-31 23:14:08,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:08,283 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2023-08-31 23:14:08,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-31 23:14:08,284 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-08-31 23:14:08,284 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2023-08-31 23:14:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:08,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:08,303 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:14:08,491 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:14:08,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:08,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1123827669, now seen corresponding path program 1 times [2023-08-31 23:14:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214243224] [2023-08-31 23:14:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:08,497 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:14:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:08,502 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:14:08,504 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:14:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:08,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:08,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:08,589 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:14:08,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:08,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214243224] [2023-08-31 23:14:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214243224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031322737] [2023-08-31 23:14:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:08,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:08,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-31 23:14:08,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:08,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-31 23:14:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:08,706 INFO L130 PetriNetUnfolder]: 450/766 cut-off events. [2023-08-31 23:14:08,706 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-31 23:14:08,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 766 events. 450/766 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3526 event pairs, 112 based on Foata normal form. 27/747 useless extension candidates. Maximal degree in co-relation 1608. Up to 633 conditions per place. [2023-08-31 23:14:08,709 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-08-31 23:14:08,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 156 flow [2023-08-31 23:14:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-31 23:14:08,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949928469241774 [2023-08-31 23:14:08,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-31 23:14:08,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-31 23:14:08,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:08,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-31 23:14:08,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,713 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 3 states and 346 transitions. [2023-08-31 23:14:08,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 156 flow [2023-08-31 23:14:08,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:08,715 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 80 flow [2023-08-31 23:14:08,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 23:14:08,715 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-31 23:14:08,715 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 80 flow [2023-08-31 23:14:08,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:08,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:08,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:08,727 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:14:08,927 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:14:08,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:08,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2052567407, now seen corresponding path program 1 times [2023-08-31 23:14:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462184506] [2023-08-31 23:14:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:08,929 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:14:08,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:08,933 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:14:08,965 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:14:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:09,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:09,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:09,035 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:14:09,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:09,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462184506] [2023-08-31 23:14:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462184506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543618944] [2023-08-31 23:14:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:09,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:09,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-31 23:14:09,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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:14:09,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:09,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-31 23:14:09,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:09,145 INFO L130 PetriNetUnfolder]: 180/358 cut-off events. [2023-08-31 23:14:09,145 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2023-08-31 23:14:09,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 358 events. 180/358 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1447 event pairs, 61 based on Foata normal form. 27/370 useless extension candidates. Maximal degree in co-relation 868. Up to 129 conditions per place. [2023-08-31 23:14:09,147 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 37 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2023-08-31 23:14:09,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 222 flow [2023-08-31 23:14:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2023-08-31 23:14:09,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946351931330472 [2023-08-31 23:14:09,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 461 transitions. [2023-08-31 23:14:09,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 461 transitions. [2023-08-31 23:14:09,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:09,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 461 transitions. [2023-08-31 23:14:09,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,152 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 80 flow. Second operand 4 states and 461 transitions. [2023-08-31 23:14:09,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 222 flow [2023-08-31 23:14:09,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:09,153 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 116 flow [2023-08-31 23:14:09,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-31 23:14:09,153 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2023-08-31 23:14:09,154 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 116 flow [2023-08-31 23:14:09,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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:14:09,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:09,154 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:14:09,163 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:14:09,361 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:14:09,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:09,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1787985814, now seen corresponding path program 1 times [2023-08-31 23:14:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222371449] [2023-08-31 23:14:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:09,362 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:14:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:09,363 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:14:09,366 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:14:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:09,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:14:09,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:09,474 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:14:09,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:09,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222371449] [2023-08-31 23:14:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222371449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139750132] [2023-08-31 23:14:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:09,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:09,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-31 23:14:09,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:09,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-31 23:14:09,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:09,613 INFO L130 PetriNetUnfolder]: 135/268 cut-off events. [2023-08-31 23:14:09,613 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-31 23:14:09,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 268 events. 135/268 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1040 event pairs, 56 based on Foata normal form. 9/271 useless extension candidates. Maximal degree in co-relation 713. Up to 108 conditions per place. [2023-08-31 23:14:09,615 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 34 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-08-31 23:14:09,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 246 flow [2023-08-31 23:14:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-08-31 23:14:09,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48497854077253216 [2023-08-31 23:14:09,616 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-08-31 23:14:09,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-08-31 23:14:09,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:09,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-08-31 23:14:09,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,620 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 116 flow. Second operand 5 states and 565 transitions. [2023-08-31 23:14:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 246 flow [2023-08-31 23:14:09,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:09,621 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 130 flow [2023-08-31 23:14:09,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-31 23:14:09,622 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-31 23:14:09,622 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 130 flow [2023-08-31 23:14:09,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:09,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:09,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:09,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-31 23:14:09,830 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:14:09,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:09,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash 540162562, now seen corresponding path program 1 times [2023-08-31 23:14:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796063226] [2023-08-31 23:14:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:09,831 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:14:09,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:09,832 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:14:09,834 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:14:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:09,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:09,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:10,016 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:14:10,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:10,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796063226] [2023-08-31 23:14:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796063226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:10,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:10,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003696821] [2023-08-31 23:14:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:10,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-31 23:14:10,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:10,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-31 23:14:10,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:10,171 INFO L130 PetriNetUnfolder]: 198/397 cut-off events. [2023-08-31 23:14:10,171 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2023-08-31 23:14:10,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 397 events. 198/397 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1788 event pairs, 18 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 1100. Up to 224 conditions per place. [2023-08-31 23:14:10,173 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 54 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-31 23:14:10,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 390 flow [2023-08-31 23:14:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-31 23:14:10,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798283261802575 [2023-08-31 23:14:10,175 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-31 23:14:10,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-31 23:14:10,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:10,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-31 23:14:10,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,178 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 130 flow. Second operand 5 states and 559 transitions. [2023-08-31 23:14:10,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 390 flow [2023-08-31 23:14:10,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 334 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:10,181 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 125 flow [2023-08-31 23:14:10,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:14:10,181 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-31 23:14:10,181 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 125 flow [2023-08-31 23:14:10,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:10,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:10,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-31 23:14:10,389 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:14:10,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:10,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 386956808, now seen corresponding path program 2 times [2023-08-31 23:14:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246988106] [2023-08-31 23:14:10,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:14:10,390 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:14:10,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:10,405 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:14:10,430 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:14:10,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:14:10,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:10,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:14:10,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:10,776 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:14:10,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:10,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246988106] [2023-08-31 23:14:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246988106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:10,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:14:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854776187] [2023-08-31 23:14:10,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:10,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:14:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:14:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:14:10,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-31 23:14:10,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 125 flow. Second operand has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:10,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:10,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-31 23:14:10,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:11,030 INFO L130 PetriNetUnfolder]: 300/618 cut-off events. [2023-08-31 23:14:11,030 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-08-31 23:14:11,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 618 events. 300/618 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3066 event pairs, 78 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1660. Up to 268 conditions per place. [2023-08-31 23:14:11,033 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 53 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-08-31 23:14:11,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 380 flow [2023-08-31 23:14:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2023-08-31 23:14:11,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47067238912732473 [2023-08-31 23:14:11,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2023-08-31 23:14:11,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2023-08-31 23:14:11,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:11,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2023-08-31 23:14:11,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,038 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,038 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 125 flow. Second operand 6 states and 658 transitions. [2023-08-31 23:14:11,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 380 flow [2023-08-31 23:14:11,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:11,041 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 178 flow [2023-08-31 23:14:11,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=124, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-31 23:14:11,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-31 23:14:11,042 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 178 flow [2023-08-31 23:14:11,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:11,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:11,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-31 23:14:11,250 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:14:11,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:11,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash 875351188, now seen corresponding path program 1 times [2023-08-31 23:14:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12377058] [2023-08-31 23:14:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:11,251 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:14:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:11,265 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:14:11,266 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:14:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:11,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:14:11,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:11,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:11,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12377058] [2023-08-31 23:14:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12377058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:11,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522522651] [2023-08-31 23:14:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:11,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:11,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 233 [2023-08-31 23:14:11,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:11,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 233 [2023-08-31 23:14:11,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:11,896 INFO L130 PetriNetUnfolder]: 267/561 cut-off events. [2023-08-31 23:14:11,897 INFO L131 PetriNetUnfolder]: For 635/635 co-relation queries the response was YES. [2023-08-31 23:14:11,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 561 events. 267/561 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2807 event pairs, 43 based on Foata normal form. 4/565 useless extension candidates. Maximal degree in co-relation 1775. Up to 445 conditions per place. [2023-08-31 23:14:11,899 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 27 selfloop transitions, 3 changer transitions 13/48 dead transitions. [2023-08-31 23:14:11,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 317 flow [2023-08-31 23:14:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-08-31 23:14:11,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41974248927038627 [2023-08-31 23:14:11,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-08-31 23:14:11,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-08-31 23:14:11,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:11,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-08-31 23:14:11,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,903 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 178 flow. Second operand 5 states and 489 transitions. [2023-08-31 23:14:11,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 317 flow [2023-08-31 23:14:11,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:11,906 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 146 flow [2023-08-31 23:14:11,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2023-08-31 23:14:11,906 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-08-31 23:14:11,906 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 146 flow [2023-08-31 23:14:11,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:11,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:11,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:11,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 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:12,114 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:14:12,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:12,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1931478178, now seen corresponding path program 3 times [2023-08-31 23:14:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791802139] [2023-08-31 23:14:12,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:14:12,119 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:14:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:12,120 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:14:12,122 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:14:12,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:14:12,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:12,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 23:14:12,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:12,510 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:14:12,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:12,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:12,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791802139] [2023-08-31 23:14:12,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791802139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:12,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:14:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261125120] [2023-08-31 23:14:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:12,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:14:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:14:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:14:12,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-31 23:14:12,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 146 flow. Second operand has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:12,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-31 23:14:12,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:12,749 INFO L130 PetriNetUnfolder]: 239/498 cut-off events. [2023-08-31 23:14:12,749 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2023-08-31 23:14:12,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 498 events. 239/498 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2267 event pairs, 75 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1543. Up to 189 conditions per place. [2023-08-31 23:14:12,753 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 39 selfloop transitions, 6 changer transitions 13/61 dead transitions. [2023-08-31 23:14:12,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 394 flow [2023-08-31 23:14:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 656 transitions. [2023-08-31 23:14:12,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46924177396280403 [2023-08-31 23:14:12,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 656 transitions. [2023-08-31 23:14:12,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 656 transitions. [2023-08-31 23:14:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:12,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 656 transitions. [2023-08-31 23:14:12,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,767 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,768 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 146 flow. Second operand 6 states and 656 transitions. [2023-08-31 23:14:12,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 394 flow [2023-08-31 23:14:12,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 377 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-31 23:14:12,771 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 158 flow [2023-08-31 23:14:12,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-31 23:14:12,772 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-08-31 23:14:12,773 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 158 flow [2023-08-31 23:14:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:12,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:12,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:12,782 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:14:12,982 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:14:12,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:12,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1619471856, now seen corresponding path program 4 times [2023-08-31 23:14:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204239232] [2023-08-31 23:14:12,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:14:12,983 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:14:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:12,984 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:14:12,986 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:14:13,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:14:13,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:13,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:13,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:13,235 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:14:13,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:13,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204239232] [2023-08-31 23:14:13,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204239232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:13,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20567022] [2023-08-31 23:14:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:13,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:13,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-31 23:14:13,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:13,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-31 23:14:13,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:13,411 INFO L130 PetriNetUnfolder]: 333/696 cut-off events. [2023-08-31 23:14:13,411 INFO L131 PetriNetUnfolder]: For 781/786 co-relation queries the response was YES. [2023-08-31 23:14:13,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 696 events. 333/696 cut-off events. For 781/786 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3496 event pairs, 161 based on Foata normal form. 6/697 useless extension candidates. Maximal degree in co-relation 2280. Up to 267 conditions per place. [2023-08-31 23:14:13,413 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 25 selfloop transitions, 1 changer transitions 31/60 dead transitions. [2023-08-31 23:14:13,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 407 flow [2023-08-31 23:14:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-31 23:14:13,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47467811158798284 [2023-08-31 23:14:13,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-31 23:14:13,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-31 23:14:13,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:13,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-31 23:14:13,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,418 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 158 flow. Second operand 5 states and 553 transitions. [2023-08-31 23:14:13,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 407 flow [2023-08-31 23:14:13,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 396 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:13,421 INFO L231 Difference]: Finished difference. Result has 54 places, 29 transitions, 133 flow [2023-08-31 23:14:13,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=5, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=29} [2023-08-31 23:14:13,421 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-31 23:14:13,421 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 29 transitions, 133 flow [2023-08-31 23:14:13,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:13,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:13,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:13,441 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:14:13,629 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:14:13,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:14:13,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1005028114, now seen corresponding path program 5 times [2023-08-31 23:14:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370802868] [2023-08-31 23:14:13,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:14:13,630 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:14:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:13,631 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:14:13,633 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:14:13,725 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:14:13,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:14:13,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:13,818 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:14:13,818 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:13,819 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:14:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:14:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:14:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:14:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:14:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:14:13,835 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:14:14,021 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:14:14,022 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:14,026 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:14,026 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:14,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:14 BasicIcfg [2023-08-31 23:14:14,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:14,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:14,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:14,071 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:14,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:02" (3/4) ... [2023-08-31 23:14:14,073 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:14,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:14,073 INFO L158 Benchmark]: Toolchain (without parser) took 12642.76ms. Allocated memory was 65.0MB in the beginning and 188.7MB in the end (delta: 123.7MB). Free memory was 40.6MB in the beginning and 107.8MB in the end (delta: -67.2MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,073 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.04ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 40.3MB in the beginning and 56.1MB in the end (delta: -15.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.29ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 53.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: Boogie Preprocessor took 36.49ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: RCFGBuilder took 668.25ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 56.5MB in the end (delta: -5.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: TraceAbstraction took 11475.41ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 56.0MB in the beginning and 108.9MB in the end (delta: -52.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2023-08-31 23:14:14,074 INFO L158 Benchmark]: Witness Printer took 2.09ms. Allocated memory is still 188.7MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:14,075 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.10ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.04ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 40.3MB in the beginning and 56.1MB in the end (delta: -15.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.29ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 53.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.49ms. Allocated memory is still 88.1MB. Free memory was 53.6MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.25ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 56.5MB in the end (delta: -5.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11475.41ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 56.0MB in the beginning and 108.9MB in the end (delta: -52.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Witness Printer took 2.09ms. Allocated memory is still 188.7MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 126 PlacesBefore, 43 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6597 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2814, independent: 2614, independent conditional: 0, independent unconditional: 2614, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1155, independent: 1125, independent conditional: 0, independent unconditional: 1125, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2814, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1155, unknown conditional: 0, unknown unconditional: 1155] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-1, t515={-6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=0, t515={-6:0}, t516={-10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=1, t515={-6:0}, t516={-10:0}, t517={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={-6:0}, t516={-10:0}, t517={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1257 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 31 mSDtfsCounter, 1257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=7, InterpolantAutomatonStates: 44, 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.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 153 ConstructedInterpolants, 15 QuantifiedInterpolants, 1630 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1317 ConjunctsInSsa, 88 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:14:14,098 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