./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:11:44,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:11:44,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:11:44,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:11:44,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:11:44,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:11:44,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:11:44,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:11:44,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:11:44,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:11:44,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:11:44,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:11:44,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:11:44,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:11:44,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:11:44,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:11:44,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:11:44,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:11:44,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:11:44,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:11:44,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:11:44,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:11:44,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:11:44,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:11:44,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:11:44,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:11:44,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:11:44,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:11:44,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:11:44,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:11:44,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:11:44,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:11:44,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:11:44,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:11:44,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:11:44,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:11:44,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:11:44,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:11:44,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:11:44,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:11:44,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:11:44,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:11:44,287 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:11:44,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:11:44,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:11:44,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:11:44,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:11:44,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:11:44,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:11:44,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:11:44,290 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:11:44,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:11:44,291 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:11:44,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:11:44,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:11:44,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:11:44,292 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:11:44,293 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:11:44,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:11:44,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:11:44,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:11:44,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:44,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:11:44,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:11:44,294 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:11:44,295 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:11:44,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:11:44,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:11:44,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:11:44,541 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:11:44,541 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:11:44,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-31 23:11:45,361 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:11:45,617 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:11:45,620 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-31 23:11:45,638 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc31d70a6/7f552c00c80444b3bd17c40d6ecacada/FLAGcda54d122 [2023-08-31 23:11:45,648 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc31d70a6/7f552c00c80444b3bd17c40d6ecacada [2023-08-31 23:11:45,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:11:45,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:11:45,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:45,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:11:45,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:11:45,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:45" (1/1) ... [2023-08-31 23:11:45,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55eee78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:45, skipping insertion in model container [2023-08-31 23:11:45,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:45" (1/1) ... [2023-08-31 23:11:45,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:11:45,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:11:45,826 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i[944,957] [2023-08-31 23:11:46,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:46,019 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:11:46,029 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i[944,957] [2023-08-31 23:11:46,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:46,120 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:46,120 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:46,125 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:11:46,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46 WrapperNode [2023-08-31 23:11:46,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:46,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:46,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:11:46,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:11:46,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,184 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-31 23:11:46,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:46,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:11:46,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:11:46,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:11:46,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:11:46,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:11:46,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:11:46,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:11:46,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (1/1) ... [2023-08-31 23:11:46,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:46,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:11:46,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:11:46,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:11:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:11:46,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:11:46,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:11:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:11:46,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:11:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:11:46,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:11:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:11:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:11:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:11:46,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:11:46,280 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:11:46,396 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:11:46,397 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:11:46,689 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:11:46,791 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:11:46,792 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:11:46,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:46 BoogieIcfgContainer [2023-08-31 23:11:46,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:11:46,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:11:46,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:11:46,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:11:46,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:11:45" (1/3) ... [2023-08-31 23:11:46,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187ae4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:46, skipping insertion in model container [2023-08-31 23:11:46,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:46" (2/3) ... [2023-08-31 23:11:46,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187ae4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:46, skipping insertion in model container [2023-08-31 23:11:46,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:46" (3/3) ... [2023-08-31 23:11:46,798 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-08-31 23:11:46,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:11:46,809 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:11:46,809 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:11:46,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:11:46,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:11:46,925 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:11:46,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:46,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:11:46,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:11:46,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-31 23:11:46,936 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:11:46,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:11:46,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:11:46,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-31 23:11:46,972 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:11:46,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:46,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:11:46,976 INFO L119 LiptonReduction]: Number of co-enabled transitions 3170 [2023-08-31 23:11:51,133 INFO L134 LiptonReduction]: Checked pairs total: 8642 [2023-08-31 23:11:51,133 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-31 23:11:51,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:11:51,147 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;@28d6758d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:11:51,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:11:51,148 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:11:51,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:51,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:51,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:11:51,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:51,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2023-08-31 23:11:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:51,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855071790] [2023-08-31 23:11:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855071790] [2023-08-31 23:11:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855071790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:11:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412863433] [2023-08-31 23:11:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:51,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:11:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:51,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:11:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:11:51,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 273 [2023-08-31 23:11:51,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:51,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:51,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 273 [2023-08-31 23:11:51,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:51,802 INFO L130 PetriNetUnfolder]: 4373/6062 cut-off events. [2023-08-31 23:11:51,803 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-31 23:11:51,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12148 conditions, 6062 events. 4373/6062 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 31887 event pairs, 4373 based on Foata normal form. 0/5335 useless extension candidates. Maximal degree in co-relation 12136. Up to 5983 conditions per place. [2023-08-31 23:11:51,833 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-31 23:11:51,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-31 23:11:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:11:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:11:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-31 23:11:51,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366300366300366 [2023-08-31 23:11:51,847 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-31 23:11:51,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-31 23:11:51,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:51,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-31 23:11:51,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:51,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:51,858 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:51,859 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 293 transitions. [2023-08-31 23:11:51,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-31 23:11:51,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:11:51,864 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-31 23:11:51,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-31 23:11:51,867 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-31 23:11:51,867 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-31 23:11:51,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:51,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:51,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:51,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:11:51,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:51,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2103627263, now seen corresponding path program 1 times [2023-08-31 23:11:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:51,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836908411] [2023-08-31 23:11:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836908411] [2023-08-31 23:11:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836908411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:11:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332734679] [2023-08-31 23:11:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:52,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:11:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:11:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:11:52,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-08-31 23:11:52,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:52,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-08-31 23:11:52,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:52,587 INFO L130 PetriNetUnfolder]: 3632/5249 cut-off events. [2023-08-31 23:11:52,587 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:52,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 5249 events. 3632/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29765 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10336. Up to 3973 conditions per place. [2023-08-31 23:11:52,604 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-31 23:11:52,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-31 23:11:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:11:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:11:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-31 23:11:52,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2023-08-31 23:11:52,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-31 23:11:52,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-31 23:11:52,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:52,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-31 23:11:52,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,610 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 423 transitions. [2023-08-31 23:11:52,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-31 23:11:52,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:11:52,611 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-31 23:11:52,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-31 23:11:52,612 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-31 23:11:52,612 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-31 23:11:52,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:52,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:52,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:11:52,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:52,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1343892436, now seen corresponding path program 1 times [2023-08-31 23:11:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115537999] [2023-08-31 23:11:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115537999] [2023-08-31 23:11:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115537999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:11:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061467694] [2023-08-31 23:11:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:52,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:11:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:11:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:11:52,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-08-31 23:11:52,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:52,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:52,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-08-31 23:11:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:54,036 INFO L130 PetriNetUnfolder]: 13933/18950 cut-off events. [2023-08-31 23:11:54,036 INFO L131 PetriNetUnfolder]: For 720/720 co-relation queries the response was YES. [2023-08-31 23:11:54,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38963 conditions, 18950 events. 13933/18950 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 98783 event pairs, 5133 based on Foata normal form. 0/18486 useless extension candidates. Maximal degree in co-relation 38959. Up to 12729 conditions per place. [2023-08-31 23:11:54,157 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2023-08-31 23:11:54,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 222 flow [2023-08-31 23:11:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:11:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:11:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-31 23:11:54,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2023-08-31 23:11:54,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-31 23:11:54,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-31 23:11:54,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:54,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-31 23:11:54,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:54,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:54,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:54,163 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 406 transitions. [2023-08-31 23:11:54,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 222 flow [2023-08-31 23:11:54,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:11:54,171 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 134 flow [2023-08-31 23:11:54,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-31 23:11:54,172 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-31 23:11:54,175 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 134 flow [2023-08-31 23:11:54,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:54,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:54,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:54,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:11:54,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:54,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1289008959, now seen corresponding path program 1 times [2023-08-31 23:11:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884958072] [2023-08-31 23:11:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884958072] [2023-08-31 23:11:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884958072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:54,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:11:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832044682] [2023-08-31 23:11:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:54,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:54,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-08-31 23:11:54,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:54,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:54,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-08-31 23:11:54,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:55,639 INFO L130 PetriNetUnfolder]: 13321/18122 cut-off events. [2023-08-31 23:11:55,639 INFO L131 PetriNetUnfolder]: For 8198/8198 co-relation queries the response was YES. [2023-08-31 23:11:55,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47489 conditions, 18122 events. 13321/18122 cut-off events. For 8198/8198 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 91274 event pairs, 3445 based on Foata normal form. 144/18266 useless extension candidates. Maximal degree in co-relation 47484. Up to 8717 conditions per place. [2023-08-31 23:11:55,727 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 56 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-08-31 23:11:55,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 362 flow [2023-08-31 23:11:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:11:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:11:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-31 23:11:55,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-08-31 23:11:55,730 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-31 23:11:55,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-31 23:11:55,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:55,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-31 23:11:55,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:55,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:55,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:55,734 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 134 flow. Second operand 4 states and 532 transitions. [2023-08-31 23:11:55,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 362 flow [2023-08-31 23:11:55,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:11:55,776 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 194 flow [2023-08-31 23:11:55,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-31 23:11:55,777 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-31 23:11:55,778 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 194 flow [2023-08-31 23:11:55,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:55,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:55,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:55,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:11:55,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:55,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1289006573, now seen corresponding path program 1 times [2023-08-31 23:11:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847199292] [2023-08-31 23:11:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847199292] [2023-08-31 23:11:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847199292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:56,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:56,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:11:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87540235] [2023-08-31 23:11:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:56,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:11:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:11:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:11:56,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-08-31 23:11:56,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:56,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:56,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-08-31 23:11:56,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:57,497 INFO L130 PetriNetUnfolder]: 9427/13819 cut-off events. [2023-08-31 23:11:57,498 INFO L131 PetriNetUnfolder]: For 11320/11860 co-relation queries the response was YES. [2023-08-31 23:11:57,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37014 conditions, 13819 events. 9427/13819 cut-off events. For 11320/11860 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 85647 event pairs, 1666 based on Foata normal form. 640/13924 useless extension candidates. Maximal degree in co-relation 37007. Up to 8189 conditions per place. [2023-08-31 23:11:57,551 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 48 selfloop transitions, 6 changer transitions 18/83 dead transitions. [2023-08-31 23:11:57,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 478 flow [2023-08-31 23:11:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:11:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:11:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-31 23:11:57,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44479330193615907 [2023-08-31 23:11:57,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-31 23:11:57,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-31 23:11:57,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:57,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-31 23:11:57,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:57,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:57,558 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:57,558 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 194 flow. Second operand 7 states and 850 transitions. [2023-08-31 23:11:57,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 478 flow [2023-08-31 23:11:57,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:11:57,596 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 204 flow [2023-08-31 23:11:57,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-31 23:11:57,597 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-31 23:11:57,597 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 204 flow [2023-08-31 23:11:57,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:57,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:57,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:57,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:11:57,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:57,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1378901133, now seen corresponding path program 1 times [2023-08-31 23:11:57,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387069081] [2023-08-31 23:11:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387069081] [2023-08-31 23:11:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387069081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:11:57,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763642600] [2023-08-31 23:11:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:57,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-08-31 23:11:57,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:57,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:57,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-08-31 23:11:57,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:58,686 INFO L130 PetriNetUnfolder]: 11173/15286 cut-off events. [2023-08-31 23:11:58,686 INFO L131 PetriNetUnfolder]: For 12493/12493 co-relation queries the response was YES. [2023-08-31 23:11:58,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44363 conditions, 15286 events. 11173/15286 cut-off events. For 12493/12493 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 77700 event pairs, 2825 based on Foata normal form. 32/15318 useless extension candidates. Maximal degree in co-relation 44353. Up to 9849 conditions per place. [2023-08-31 23:11:58,750 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 65 selfloop transitions, 20 changer transitions 0/85 dead transitions. [2023-08-31 23:11:58,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 554 flow [2023-08-31 23:11:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:11:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:11:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-31 23:11:58,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990842490842491 [2023-08-31 23:11:58,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-31 23:11:58,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-31 23:11:58,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:58,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-31 23:11:58,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:58,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:58,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:58,755 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 204 flow. Second operand 4 states and 545 transitions. [2023-08-31 23:11:58,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 554 flow [2023-08-31 23:11:58,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 522 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:11:58,807 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 360 flow [2023-08-31 23:11:58,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-08-31 23:11:58,808 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-31 23:11:58,808 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 360 flow [2023-08-31 23:11:58,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:58,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:58,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:11:58,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:58,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash 203793052, now seen corresponding path program 1 times [2023-08-31 23:11:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520580202] [2023-08-31 23:11:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:11:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520580202] [2023-08-31 23:11:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520580202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:11:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637886603] [2023-08-31 23:11:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:58,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-08-31 23:11:58,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:58,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:58,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-08-31 23:11:58,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:00,075 INFO L130 PetriNetUnfolder]: 10805/14790 cut-off events. [2023-08-31 23:12:00,075 INFO L131 PetriNetUnfolder]: For 28880/28880 co-relation queries the response was YES. [2023-08-31 23:12:00,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47993 conditions, 14790 events. 10805/14790 cut-off events. For 28880/28880 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 75464 event pairs, 2517 based on Foata normal form. 96/14886 useless extension candidates. Maximal degree in co-relation 47982. Up to 6781 conditions per place. [2023-08-31 23:12:00,155 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 80 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2023-08-31 23:12:00,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 722 flow [2023-08-31 23:12:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-31 23:12:00,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49542124542124544 [2023-08-31 23:12:00,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-31 23:12:00,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-31 23:12:00,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:00,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-31 23:12:00,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:00,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:00,160 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:00,160 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 360 flow. Second operand 4 states and 541 transitions. [2023-08-31 23:12:00,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 722 flow [2023-08-31 23:12:00,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 722 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:00,292 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 508 flow [2023-08-31 23:12:00,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-08-31 23:12:00,293 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-31 23:12:00,293 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 508 flow [2023-08-31 23:12:00,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:00,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:00,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:00,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:12:00,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:00,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 200106128, now seen corresponding path program 1 times [2023-08-31 23:12:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346560504] [2023-08-31 23:12:00,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346560504] [2023-08-31 23:12:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346560504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:12:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105551370] [2023-08-31 23:12:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:12:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:12:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:12:01,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 273 [2023-08-31 23:12:01,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:01,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:01,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 273 [2023-08-31 23:12:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:02,130 INFO L130 PetriNetUnfolder]: 6821/9900 cut-off events. [2023-08-31 23:12:02,130 INFO L131 PetriNetUnfolder]: For 27134/28667 co-relation queries the response was YES. [2023-08-31 23:12:02,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35109 conditions, 9900 events. 6821/9900 cut-off events. For 27134/28667 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 57591 event pairs, 648 based on Foata normal form. 819/10225 useless extension candidates. Maximal degree in co-relation 35095. Up to 4938 conditions per place. [2023-08-31 23:12:02,170 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 74 selfloop transitions, 14 changer transitions 21/125 dead transitions. [2023-08-31 23:12:02,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1126 flow [2023-08-31 23:12:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:12:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:12:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1019 transitions. [2023-08-31 23:12:02,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41473341473341474 [2023-08-31 23:12:02,173 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1019 transitions. [2023-08-31 23:12:02,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1019 transitions. [2023-08-31 23:12:02,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:02,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1019 transitions. [2023-08-31 23:12:02,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:02,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:02,178 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:02,178 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 508 flow. Second operand 9 states and 1019 transitions. [2023-08-31 23:12:02,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1126 flow [2023-08-31 23:12:02,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:02,264 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 562 flow [2023-08-31 23:12:02,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=562, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-31 23:12:02,264 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-31 23:12:02,264 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 562 flow [2023-08-31 23:12:02,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:02,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:02,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:12:02,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:02,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -275912350, now seen corresponding path program 1 times [2023-08-31 23:12:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563119806] [2023-08-31 23:12:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563119806] [2023-08-31 23:12:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563119806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878682263] [2023-08-31 23:12:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:02,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:02,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:02,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-08-31 23:12:02,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:02,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:02,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-08-31 23:12:02,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:03,026 INFO L130 PetriNetUnfolder]: 5135/7600 cut-off events. [2023-08-31 23:12:03,027 INFO L131 PetriNetUnfolder]: For 23073/24255 co-relation queries the response was YES. [2023-08-31 23:12:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27145 conditions, 7600 events. 5135/7600 cut-off events. For 23073/24255 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 45491 event pairs, 910 based on Foata normal form. 906/7987 useless extension candidates. Maximal degree in co-relation 27129. Up to 4835 conditions per place. [2023-08-31 23:12:03,062 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 121 selfloop transitions, 10 changer transitions 0/147 dead transitions. [2023-08-31 23:12:03,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 147 transitions, 1636 flow [2023-08-31 23:12:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-31 23:12:03,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48644688644688644 [2023-08-31 23:12:03,064 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-31 23:12:03,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-31 23:12:03,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:03,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-31 23:12:03,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,068 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,068 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 562 flow. Second operand 5 states and 664 transitions. [2023-08-31 23:12:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 147 transitions, 1636 flow [2023-08-31 23:12:03,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 147 transitions, 1523 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-08-31 23:12:03,093 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 585 flow [2023-08-31 23:12:03,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2023-08-31 23:12:03,094 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-31 23:12:03,094 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 585 flow [2023-08-31 23:12:03,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:03,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:12:03,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:03,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1891923532, now seen corresponding path program 1 times [2023-08-31 23:12:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114067373] [2023-08-31 23:12:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114067373] [2023-08-31 23:12:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114067373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642934315] [2023-08-31 23:12:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:03,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:03,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-08-31 23:12:03,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 585 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:03,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-08-31 23:12:03,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:03,840 INFO L130 PetriNetUnfolder]: 4208/6449 cut-off events. [2023-08-31 23:12:03,840 INFO L131 PetriNetUnfolder]: For 19669/21340 co-relation queries the response was YES. [2023-08-31 23:12:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27127 conditions, 6449 events. 4208/6449 cut-off events. For 19669/21340 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 39892 event pairs, 355 based on Foata normal form. 1018/7080 useless extension candidates. Maximal degree in co-relation 27109. Up to 2288 conditions per place. [2023-08-31 23:12:03,866 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 162 selfloop transitions, 19 changer transitions 3/200 dead transitions. [2023-08-31 23:12:03,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 200 transitions, 2162 flow [2023-08-31 23:12:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions. [2023-08-31 23:12:03,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-08-31 23:12:03,868 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 931 transitions. [2023-08-31 23:12:03,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions. [2023-08-31 23:12:03,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:03,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions. [2023-08-31 23:12:03,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,873 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,874 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 585 flow. Second operand 7 states and 931 transitions. [2023-08-31 23:12:03,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 200 transitions, 2162 flow [2023-08-31 23:12:03,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 200 transitions, 2157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:03,900 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 718 flow [2023-08-31 23:12:03,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=718, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2023-08-31 23:12:03,905 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-31 23:12:03,905 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 718 flow [2023-08-31 23:12:03,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:03,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:03,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:03,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:12:03,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:03,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1810897146, now seen corresponding path program 1 times [2023-08-31 23:12:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049947053] [2023-08-31 23:12:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:04,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049947053] [2023-08-31 23:12:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049947053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:04,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729071] [2023-08-31 23:12:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:04,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:04,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-31 23:12:04,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 718 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:04,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:04,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-31 23:12:04,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:04,947 INFO L130 PetriNetUnfolder]: 7097/10545 cut-off events. [2023-08-31 23:12:04,947 INFO L131 PetriNetUnfolder]: For 50707/50707 co-relation queries the response was YES. [2023-08-31 23:12:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52379 conditions, 10545 events. 7097/10545 cut-off events. For 50707/50707 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 60886 event pairs, 559 based on Foata normal form. 39/10584 useless extension candidates. Maximal degree in co-relation 52358. Up to 5333 conditions per place. [2023-08-31 23:12:04,989 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 104 selfloop transitions, 53 changer transitions 36/193 dead transitions. [2023-08-31 23:12:04,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 193 transitions, 2107 flow [2023-08-31 23:12:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-31 23:12:04,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48424908424908425 [2023-08-31 23:12:04,991 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-31 23:12:04,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-31 23:12:04,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:04,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-31 23:12:04,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:04,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:04,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:04,994 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 718 flow. Second operand 5 states and 661 transitions. [2023-08-31 23:12:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 193 transitions, 2107 flow [2023-08-31 23:12:05,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 193 transitions, 1935 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:05,324 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 1119 flow [2023-08-31 23:12:05,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1119, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2023-08-31 23:12:05,325 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-31 23:12:05,325 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 1119 flow [2023-08-31 23:12:05,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:05,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:05,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:12:05,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:05,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1565573965, now seen corresponding path program 1 times [2023-08-31 23:12:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467412125] [2023-08-31 23:12:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467412125] [2023-08-31 23:12:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467412125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322683666] [2023-08-31 23:12:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:05,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:05,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:05,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:05,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-08-31 23:12:05,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 1119 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 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:12:05,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:05,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-08-31 23:12:05,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:05,901 INFO L130 PetriNetUnfolder]: 2180/3527 cut-off events. [2023-08-31 23:12:05,901 INFO L131 PetriNetUnfolder]: For 19056/19866 co-relation queries the response was YES. [2023-08-31 23:12:05,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16705 conditions, 3527 events. 2180/3527 cut-off events. For 19056/19866 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20659 event pairs, 218 based on Foata normal form. 523/3901 useless extension candidates. Maximal degree in co-relation 16681. Up to 1083 conditions per place. [2023-08-31 23:12:05,916 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 161 selfloop transitions, 18 changer transitions 24/234 dead transitions. [2023-08-31 23:12:05,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 234 transitions, 3074 flow [2023-08-31 23:12:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 932 transitions. [2023-08-31 23:12:05,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48770277341705914 [2023-08-31 23:12:05,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 932 transitions. [2023-08-31 23:12:05,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 932 transitions. [2023-08-31 23:12:05,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:05,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 932 transitions. [2023-08-31 23:12:05,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 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:12:05,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:05,923 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:05,924 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 1119 flow. Second operand 7 states and 932 transitions. [2023-08-31 23:12:05,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 234 transitions, 3074 flow [2023-08-31 23:12:05,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 234 transitions, 3030 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:05,947 INFO L231 Difference]: Finished difference. Result has 77 places, 101 transitions, 1222 flow [2023-08-31 23:12:05,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1222, PETRI_PLACES=77, PETRI_TRANSITIONS=101} [2023-08-31 23:12:05,948 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-31 23:12:05,948 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 101 transitions, 1222 flow [2023-08-31 23:12:05,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 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:12:05,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:05,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:05,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:12:05,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:05,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -18543775, now seen corresponding path program 1 times [2023-08-31 23:12:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270268019] [2023-08-31 23:12:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270268019] [2023-08-31 23:12:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270268019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352636213] [2023-08-31 23:12:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:06,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:06,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-08-31 23:12:06,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 101 transitions, 1222 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:06,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-08-31 23:12:06,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:06,536 INFO L130 PetriNetUnfolder]: 2124/3416 cut-off events. [2023-08-31 23:12:06,537 INFO L131 PetriNetUnfolder]: For 17978/18694 co-relation queries the response was YES. [2023-08-31 23:12:06,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17516 conditions, 3416 events. 2124/3416 cut-off events. For 17978/18694 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19923 event pairs, 210 based on Foata normal form. 265/3533 useless extension candidates. Maximal degree in co-relation 17491. Up to 1081 conditions per place. [2023-08-31 23:12:06,555 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 156 selfloop transitions, 23 changer transitions 24/234 dead transitions. [2023-08-31 23:12:06,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 234 transitions, 3107 flow [2023-08-31 23:12:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:12:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:12:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1173 transitions. [2023-08-31 23:12:06,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47741147741147744 [2023-08-31 23:12:06,558 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1173 transitions. [2023-08-31 23:12:06,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1173 transitions. [2023-08-31 23:12:06,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:06,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1173 transitions. [2023-08-31 23:12:06,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.33333333333334) internal successors, (1173), 9 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,563 INFO L175 Difference]: Start difference. First operand has 77 places, 101 transitions, 1222 flow. Second operand 9 states and 1173 transitions. [2023-08-31 23:12:06,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 234 transitions, 3107 flow [2023-08-31 23:12:06,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 234 transitions, 2979 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:06,646 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 1197 flow [2023-08-31 23:12:06,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1197, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2023-08-31 23:12:06,647 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-31 23:12:06,647 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 1197 flow [2023-08-31 23:12:06,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:06,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:06,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:12:06,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:06,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash -76691735, now seen corresponding path program 1 times [2023-08-31 23:12:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430346837] [2023-08-31 23:12:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430346837] [2023-08-31 23:12:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430346837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936555793] [2023-08-31 23:12:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:06,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:06,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:06,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 273 [2023-08-31 23:12:06,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 1197 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:06,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 273 [2023-08-31 23:12:06,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:07,555 INFO L130 PetriNetUnfolder]: 3502/5363 cut-off events. [2023-08-31 23:12:07,555 INFO L131 PetriNetUnfolder]: For 31625/31625 co-relation queries the response was YES. [2023-08-31 23:12:07,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28100 conditions, 5363 events. 3502/5363 cut-off events. For 31625/31625 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 28357 event pairs, 285 based on Foata normal form. 1/5364 useless extension candidates. Maximal degree in co-relation 28073. Up to 2513 conditions per place. [2023-08-31 23:12:07,577 INFO L137 encePairwiseOnDemand]: 262/273 looper letters, 119 selfloop transitions, 76 changer transitions 87/282 dead transitions. [2023-08-31 23:12:07,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 282 transitions, 3428 flow [2023-08-31 23:12:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:12:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:12:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1250 transitions. [2023-08-31 23:12:07,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45787545787545786 [2023-08-31 23:12:07,580 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1250 transitions. [2023-08-31 23:12:07,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1250 transitions. [2023-08-31 23:12:07,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:07,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1250 transitions. [2023-08-31 23:12:07,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,586 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,586 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 1197 flow. Second operand 10 states and 1250 transitions. [2023-08-31 23:12:07,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 282 transitions, 3428 flow [2023-08-31 23:12:07,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 282 transitions, 3187 flow, removed 47 selfloop flow, removed 9 redundant places. [2023-08-31 23:12:07,678 INFO L231 Difference]: Finished difference. Result has 88 places, 126 transitions, 1718 flow [2023-08-31 23:12:07,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1718, PETRI_PLACES=88, PETRI_TRANSITIONS=126} [2023-08-31 23:12:07,679 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-31 23:12:07,679 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 126 transitions, 1718 flow [2023-08-31 23:12:07,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:07,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:07,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:12:07,680 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:07,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -256483113, now seen corresponding path program 2 times [2023-08-31 23:12:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627233012] [2023-08-31 23:12:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627233012] [2023-08-31 23:12:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627233012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658707545] [2023-08-31 23:12:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:07,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:07,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-31 23:12:07,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 126 transitions, 1718 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:07,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-31 23:12:07,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:08,267 INFO L130 PetriNetUnfolder]: 2616/4072 cut-off events. [2023-08-31 23:12:08,267 INFO L131 PetriNetUnfolder]: For 32096/32096 co-relation queries the response was YES. [2023-08-31 23:12:08,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22249 conditions, 4072 events. 2616/4072 cut-off events. For 32096/32096 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21195 event pairs, 438 based on Foata normal form. 1/4073 useless extension candidates. Maximal degree in co-relation 22221. Up to 1553 conditions per place. [2023-08-31 23:12:08,278 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 66 selfloop transitions, 20 changer transitions 133/219 dead transitions. [2023-08-31 23:12:08,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 219 transitions, 2905 flow [2023-08-31 23:12:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2023-08-31 23:12:08,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47802197802197804 [2023-08-31 23:12:08,282 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2023-08-31 23:12:08,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2023-08-31 23:12:08,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:08,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2023-08-31 23:12:08,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,285 INFO L175 Difference]: Start difference. First operand has 88 places, 126 transitions, 1718 flow. Second operand 6 states and 783 transitions. [2023-08-31 23:12:08,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 219 transitions, 2905 flow [2023-08-31 23:12:08,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 219 transitions, 2708 flow, removed 39 selfloop flow, removed 5 redundant places. [2023-08-31 23:12:08,358 INFO L231 Difference]: Finished difference. Result has 86 places, 60 transitions, 635 flow [2023-08-31 23:12:08,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=86, PETRI_TRANSITIONS=60} [2023-08-31 23:12:08,359 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2023-08-31 23:12:08,359 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 60 transitions, 635 flow [2023-08-31 23:12:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:08,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:12:08,359 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:08,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 185761507, now seen corresponding path program 3 times [2023-08-31 23:12:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:08,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032489842] [2023-08-31 23:12:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:08,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032489842] [2023-08-31 23:12:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032489842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203124687] [2023-08-31 23:12:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:08,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:08,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-08-31 23:12:08,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 60 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:08,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-08-31 23:12:08,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:08,720 INFO L130 PetriNetUnfolder]: 1171/1931 cut-off events. [2023-08-31 23:12:08,720 INFO L131 PetriNetUnfolder]: For 13726/13726 co-relation queries the response was YES. [2023-08-31 23:12:08,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10004 conditions, 1931 events. 1171/1931 cut-off events. For 13726/13726 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9650 event pairs, 404 based on Foata normal form. 1/1932 useless extension candidates. Maximal degree in co-relation 9977. Up to 1110 conditions per place. [2023-08-31 23:12:08,727 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 43 selfloop transitions, 7 changer transitions 40/90 dead transitions. [2023-08-31 23:12:08,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 993 flow [2023-08-31 23:12:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-31 23:12:08,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2023-08-31 23:12:08,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-31 23:12:08,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-31 23:12:08,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:08,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-31 23:12:08,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,732 INFO L175 Difference]: Start difference. First operand has 86 places, 60 transitions, 635 flow. Second operand 4 states and 519 transitions. [2023-08-31 23:12:08,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 993 flow [2023-08-31 23:12:08,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 796 flow, removed 18 selfloop flow, removed 16 redundant places. [2023-08-31 23:12:08,755 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 291 flow [2023-08-31 23:12:08,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2023-08-31 23:12:08,756 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-31 23:12:08,756 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 291 flow [2023-08-31 23:12:08,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:08,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:08,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:12:08,757 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:08,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1394321641, now seen corresponding path program 4 times [2023-08-31 23:12:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189743941] [2023-08-31 23:12:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:08,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189743941] [2023-08-31 23:12:08,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189743941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:08,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919530851] [2023-08-31 23:12:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:08,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:08,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:08,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-31 23:12:08,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:08,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-31 23:12:08,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:09,010 INFO L130 PetriNetUnfolder]: 316/586 cut-off events. [2023-08-31 23:12:09,010 INFO L131 PetriNetUnfolder]: For 1703/1713 co-relation queries the response was YES. [2023-08-31 23:12:09,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 586 events. 316/586 cut-off events. For 1703/1713 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2611 event pairs, 58 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 2434. Up to 291 conditions per place. [2023-08-31 23:12:09,012 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 44 selfloop transitions, 1 changer transitions 29/77 dead transitions. [2023-08-31 23:12:09,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 608 flow [2023-08-31 23:12:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-31 23:12:09,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49725274725274726 [2023-08-31 23:12:09,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-31 23:12:09,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-31 23:12:09,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:09,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-31 23:12:09,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,017 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,017 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 291 flow. Second operand 4 states and 543 transitions. [2023-08-31 23:12:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 608 flow [2023-08-31 23:12:09,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 553 flow, removed 6 selfloop flow, removed 13 redundant places. [2023-08-31 23:12:09,021 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 194 flow [2023-08-31 23:12:09,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-08-31 23:12:09,022 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-31 23:12:09,022 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 194 flow [2023-08-31 23:12:09,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:09,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:09,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:12:09,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:09,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 722859875, now seen corresponding path program 5 times [2023-08-31 23:12:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292678886] [2023-08-31 23:12:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292678886] [2023-08-31 23:12:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292678886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:09,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904816262] [2023-08-31 23:12:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:09,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:09,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-08-31 23:12:09,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:09,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-08-31 23:12:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:10,087 INFO L130 PetriNetUnfolder]: 173/361 cut-off events. [2023-08-31 23:12:10,087 INFO L131 PetriNetUnfolder]: For 708/726 co-relation queries the response was YES. [2023-08-31 23:12:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 361 events. 173/361 cut-off events. For 708/726 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1572 event pairs, 31 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1305. Up to 153 conditions per place. [2023-08-31 23:12:10,089 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 38 selfloop transitions, 5 changer transitions 23/70 dead transitions. [2023-08-31 23:12:10,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 507 flow [2023-08-31 23:12:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:12:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:12:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 997 transitions. [2023-08-31 23:12:10,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565018315018315 [2023-08-31 23:12:10,091 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 997 transitions. [2023-08-31 23:12:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 997 transitions. [2023-08-31 23:12:10,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:10,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 997 transitions. [2023-08-31 23:12:10,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.625) internal successors, (997), 8 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,095 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,095 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 194 flow. Second operand 8 states and 997 transitions. [2023-08-31 23:12:10,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 507 flow [2023-08-31 23:12:10,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 496 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:10,098 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 201 flow [2023-08-31 23:12:10,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-08-31 23:12:10,098 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-31 23:12:10,098 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 201 flow [2023-08-31 23:12:10,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:10,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:10,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:12:10,099 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:10,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -63223789, now seen corresponding path program 6 times [2023-08-31 23:12:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781604295] [2023-08-31 23:12:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:10,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:12:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:10,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:12:10,208 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:12:10,208 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:12:10,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:12:10,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:12:10,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:12:10,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:12:10,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:12:10,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:12:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:12:10,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:12:10,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:12:10,214 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:10,218 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:12:10,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:12:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:12:10 BasicIcfg [2023-08-31 23:12:10,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:12:10,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:12:10,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:12:10,283 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:12:10,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:46" (3/4) ... [2023-08-31 23:12:10,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:12:10,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:12:10,286 INFO L158 Benchmark]: Toolchain (without parser) took 24635.22ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 55.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-31 23:12:10,286 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:10,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.86ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 57.2MB in the end (delta: -1.4MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:10,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.89ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 54.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:10,287 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 79.7MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:10,287 INFO L158 Benchmark]: RCFGBuilder took 566.83ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 40.8MB in the end (delta: 11.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-08-31 23:12:10,287 INFO L158 Benchmark]: TraceAbstraction took 23488.36ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 40.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-31 23:12:10,287 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 2.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:10,288 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.14ms. Allocated memory is still 58.7MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.86ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 57.2MB in the end (delta: -1.4MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.89ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 54.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 79.7MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.83ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 40.8MB in the end (delta: 11.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23488.36ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 40.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 2.5GB. Free memory was 1.3GB in the beginning and 1.3GB 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.2s, 149 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3170 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 8642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3873, independent: 3652, independent conditional: 0, independent unconditional: 3652, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1698, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3873, independent: 2004, independent conditional: 0, independent unconditional: 2004, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 1698, unknown conditional: 0, unknown unconditional: 1698] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-1, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=0, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=1, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=2, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1200 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3437 IncrementalHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 99 mSDtfsCounter, 3437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1718occurred in iteration=14, InterpolantAutomatonStates: 101, 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.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 2861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:12:10,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:12:12,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:12:12,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:12:12,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:12:12,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:12:12,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:12:12,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:12:12,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:12:12,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:12:12,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:12:12,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:12:12,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:12:12,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:12:12,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:12:12,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:12:12,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:12:12,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:12:12,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:12:12,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:12:12,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:12:12,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:12:12,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:12:12,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:12:12,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:12:12,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:12:12,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:12:12,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:12:12,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:12:12,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:12:12,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:12:12,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:12:12,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:12:12,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:12:12,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:12:12,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:12:12,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:12:12,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:12:12,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:12:12,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:12:12,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:12:12,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:12:12,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:12:12,117 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:12:12,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:12:12,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:12:12,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:12:12,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:12:12,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:12:12,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:12:12,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:12:12,120 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:12:12,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:12:12,121 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:12:12,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:12:12,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:12:12,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:12:12,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:12:12,122 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:12:12,122 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:12:12,122 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:12:12,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:12:12,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:12:12,123 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:12:12,126 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:12:12,126 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:12:12,127 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:12:12,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:12:12,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:12:12,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:12:12,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:12,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:12:12,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:12:12,128 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:12:12,128 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:12:12,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:12:12,128 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:12:12,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:12:12,129 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:12:12,129 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:12:12,129 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:12:12,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:12:12,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:12:12,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:12:12,415 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:12:12,415 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:12:12,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-31 23:12:13,353 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:12:13,579 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:12:13,579 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-08-31 23:12:13,593 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4234dc0e/8f36bd7171fe4d8991796e4803e210f1/FLAGdc012ef49 [2023-08-31 23:12:13,601 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4234dc0e/8f36bd7171fe4d8991796e4803e210f1 [2023-08-31 23:12:13,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:12:13,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:12:13,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:13,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:12:13,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:12:13,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:13" (1/1) ... [2023-08-31 23:12:13,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65560d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:13, skipping insertion in model container [2023-08-31 23:12:13,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:13" (1/1) ... [2023-08-31 23:12:13,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:12:13,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:12:13,783 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i[944,957] [2023-08-31 23:12:13,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:14,011 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:12:14,025 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i[944,957] [2023-08-31 23:12:14,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:14,098 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:14,098 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:14,102 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:12:14,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14 WrapperNode [2023-08-31 23:12:14,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:14,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:14,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:12:14,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:12:14,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,156 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-31 23:12:14,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:14,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:12:14,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:12:14,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:12:14,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:12:14,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:12:14,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:12:14,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:12:14,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (1/1) ... [2023-08-31 23:12:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:12:14,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:12:14,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:12:14,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:12:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:12:14,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:12:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:12:14,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:12:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:12:14,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:12:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:12:14,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:12:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:12:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:12:14,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:12:14,269 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:12:14,437 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:12:14,438 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:12:14,718 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:12:14,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:12:14,799 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:12:14,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:14 BoogieIcfgContainer [2023-08-31 23:12:14,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:12:14,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:12:14,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:12:14,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:12:14,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:12:13" (1/3) ... [2023-08-31 23:12:14,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ca710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:14, skipping insertion in model container [2023-08-31 23:12:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:14" (2/3) ... [2023-08-31 23:12:14,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ca710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:14, skipping insertion in model container [2023-08-31 23:12:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:14" (3/3) ... [2023-08-31 23:12:14,807 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-08-31 23:12:14,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:12:14,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:12:14,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:12:14,874 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:12:14,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:12:14,945 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:12:14,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:14,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:12:14,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:12:14,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:12:14,954 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:12:14,965 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:12:14,967 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:12:14,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:12:15,001 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:12:15,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:15,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:12:15,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 3170 [2023-08-31 23:12:20,716 INFO L134 LiptonReduction]: Checked pairs total: 8512 [2023-08-31 23:12:20,716 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-31 23:12:20,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:12:20,729 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;@7db959e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:12:20,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:12:20,730 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:12:20,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:20,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:20,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:12:20,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:20,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 619, now seen corresponding path program 1 times [2023-08-31 23:12:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071586378] [2023-08-31 23:12:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:20,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:12:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:20,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:12:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:20,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:20,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:20,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071586378] [2023-08-31 23:12:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071586378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:20,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:12:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590198662] [2023-08-31 23:12:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:20,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:12:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:12:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:12:20,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-31 23:12:20,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:20,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-31 23:12:20,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:21,381 INFO L130 PetriNetUnfolder]: 4373/6062 cut-off events. [2023-08-31 23:12:21,382 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-31 23:12:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12148 conditions, 6062 events. 4373/6062 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 31735 event pairs, 4373 based on Foata normal form. 0/5335 useless extension candidates. Maximal degree in co-relation 12136. Up to 5983 conditions per place. [2023-08-31 23:12:21,410 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-31 23:12:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-31 23:12:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:12:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:12:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:12:21,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-31 23:12:21,423 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:12:21,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:12:21,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:21,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:12:21,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,434 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,435 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:12:21,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-31 23:12:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:21,452 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-31 23:12:21,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-31 23:12:21,456 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-31 23:12:21,456 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-31 23:12:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:21,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:21,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:21,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:21,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 870501722, now seen corresponding path program 1 times [2023-08-31 23:12:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130242330] [2023-08-31 23:12:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:21,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:21,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:21,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:21,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:12:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:21,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:21,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:21,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:21,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:21,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130242330] [2023-08-31 23:12:21,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130242330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:21,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:21,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:12:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514184473] [2023-08-31 23:12:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:21,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:21,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-31 23:12:21,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:21,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-31 23:12:21,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:22,170 INFO L130 PetriNetUnfolder]: 3632/5249 cut-off events. [2023-08-31 23:12:22,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:22,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 5249 events. 3632/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29587 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10336. Up to 3973 conditions per place. [2023-08-31 23:12:22,189 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-31 23:12:22,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-31 23:12:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-31 23:12:22,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017667844522968 [2023-08-31 23:12:22,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-31 23:12:22,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-31 23:12:22,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:22,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-31 23:12:22,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 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:12:22,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,197 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 426 transitions. [2023-08-31 23:12:22,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-31 23:12:22,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:22,198 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-31 23:12:22,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-31 23:12:22,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-31 23:12:22,199 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-31 23:12:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:22,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:22,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:22,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:22,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:22,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash 107013821, now seen corresponding path program 1 times [2023-08-31 23:12:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236341351] [2023-08-31 23:12:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:22,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:22,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:22,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:12:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:22,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:22,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:22,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:22,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236341351] [2023-08-31 23:12:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236341351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:22,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232856781] [2023-08-31 23:12:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:22,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:22,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:22,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:22,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:12:22,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:22,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:12:22,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:22,913 INFO L130 PetriNetUnfolder]: 2540/3675 cut-off events. [2023-08-31 23:12:22,913 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-31 23:12:22,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 3675 events. 2540/3675 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 18776 event pairs, 492 based on Foata normal form. 180/3718 useless extension candidates. Maximal degree in co-relation 7623. Up to 2887 conditions per place. [2023-08-31 23:12:22,927 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-08-31 23:12:22,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-08-31 23:12:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-31 23:12:22,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48480565371024736 [2023-08-31 23:12:22,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-31 23:12:22,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-31 23:12:22,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:22,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-31 23:12:22,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,933 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 686 transitions. [2023-08-31 23:12:22,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-08-31 23:12:22,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:22,936 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-08-31 23:12:22,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:12:22,937 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-31 23:12:22,937 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-08-31 23:12:22,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:22,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:22,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:23,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:23,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:23,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1190377368, now seen corresponding path program 1 times [2023-08-31 23:12:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780447676] [2023-08-31 23:12:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:23,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:23,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:23,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:23,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:12:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:23,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:23,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:23,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:23,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780447676] [2023-08-31 23:12:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780447676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410154117] [2023-08-31 23:12:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:23,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:12:23,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:23,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:12:23,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:23,578 INFO L130 PetriNetUnfolder]: 1284/1991 cut-off events. [2023-08-31 23:12:23,579 INFO L131 PetriNetUnfolder]: For 868/872 co-relation queries the response was YES. [2023-08-31 23:12:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 1991 events. 1284/1991 cut-off events. For 868/872 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9739 event pairs, 186 based on Foata normal form. 134/2064 useless extension candidates. Maximal degree in co-relation 5489. Up to 1027 conditions per place. [2023-08-31 23:12:23,586 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-08-31 23:12:23,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-08-31 23:12:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2023-08-31 23:12:23,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48586572438162545 [2023-08-31 23:12:23,589 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2023-08-31 23:12:23,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2023-08-31 23:12:23,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:23,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2023-08-31 23:12:23,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,593 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,593 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 825 transitions. [2023-08-31 23:12:23,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-08-31 23:12:23,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:23,605 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-08-31 23:12:23,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-31 23:12:23,606 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-31 23:12:23,606 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-08-31 23:12:23,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:23,607 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:12:23,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:23,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:23,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:23,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -997510880, now seen corresponding path program 1 times [2023-08-31 23:12:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494746385] [2023-08-31 23:12:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:23,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:23,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:23,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:12:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:23,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:12:23,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:23,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:23,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494746385] [2023-08-31 23:12:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494746385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407145541] [2023-08-31 23:12:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:23,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:12:23,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:23,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:12:23,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:24,262 INFO L130 PetriNetUnfolder]: 660/1071 cut-off events. [2023-08-31 23:12:24,262 INFO L131 PetriNetUnfolder]: For 1240/1248 co-relation queries the response was YES. [2023-08-31 23:12:24,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1071 events. 660/1071 cut-off events. For 1240/1248 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4655 event pairs, 124 based on Foata normal form. 60/1114 useless extension candidates. Maximal degree in co-relation 3488. Up to 395 conditions per place. [2023-08-31 23:12:24,271 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-08-31 23:12:24,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-08-31 23:12:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 962 transitions. [2023-08-31 23:12:24,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4856133266027259 [2023-08-31 23:12:24,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 962 transitions. [2023-08-31 23:12:24,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 962 transitions. [2023-08-31 23:12:24,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:24,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 962 transitions. [2023-08-31 23:12:24,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.42857142857142) internal successors, (962), 7 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,281 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 962 transitions. [2023-08-31 23:12:24,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-08-31 23:12:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:24,289 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-08-31 23:12:24,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-31 23:12:24,292 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-31 23:12:24,292 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-08-31 23:12:24,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:24,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:24,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:24,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:24,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:24,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1654383505, now seen corresponding path program 1 times [2023-08-31 23:12:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938751425] [2023-08-31 23:12:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:24,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:24,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:24,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:12:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:24,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:12:24,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:24,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:12:24,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:24,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938751425] [2023-08-31 23:12:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938751425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:24,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:24,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:24,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089727602] [2023-08-31 23:12:24,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:24,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:24,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:24,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:12:24,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:24,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:12:24,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:24,957 INFO L130 PetriNetUnfolder]: 528/840 cut-off events. [2023-08-31 23:12:24,957 INFO L131 PetriNetUnfolder]: For 962/970 co-relation queries the response was YES. [2023-08-31 23:12:24,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 840 events. 528/840 cut-off events. For 962/970 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3493 event pairs, 119 based on Foata normal form. 16/850 useless extension candidates. Maximal degree in co-relation 2630. Up to 340 conditions per place. [2023-08-31 23:12:24,961 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-08-31 23:12:24,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-08-31 23:12:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:12:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:12:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1075 transitions. [2023-08-31 23:12:24,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748233215547703 [2023-08-31 23:12:24,963 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1075 transitions. [2023-08-31 23:12:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1075 transitions. [2023-08-31 23:12:24,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:24,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1075 transitions. [2023-08-31 23:12:24,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.375) internal successors, (1075), 8 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,968 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,968 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1075 transitions. [2023-08-31 23:12:24,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-08-31 23:12:24,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:12:24,973 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-08-31 23:12:24,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-31 23:12:24,974 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-31 23:12:24,974 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-08-31 23:12:24,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:24,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:24,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:24,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:25,181 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:12:25,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:25,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1961069918, now seen corresponding path program 1 times [2023-08-31 23:12:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533807853] [2023-08-31 23:12:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:25,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:25,183 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:12:25,184 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:12:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:25,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:12:25,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:25,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:25,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533807853] [2023-08-31 23:12:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533807853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752950039] [2023-08-31 23:12:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:25,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:25,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 283 [2023-08-31 23:12:25,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:25,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:25,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 283 [2023-08-31 23:12:25,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:26,265 INFO L130 PetriNetUnfolder]: 518/840 cut-off events. [2023-08-31 23:12:26,266 INFO L131 PetriNetUnfolder]: For 1376/1380 co-relation queries the response was YES. [2023-08-31 23:12:26,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 840 events. 518/840 cut-off events. For 1376/1380 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3970 event pairs, 2 based on Foata normal form. 1/839 useless extension candidates. Maximal degree in co-relation 2562. Up to 670 conditions per place. [2023-08-31 23:12:26,270 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 52 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-31 23:12:26,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 451 flow [2023-08-31 23:12:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2023-08-31 23:12:26,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41048292108362777 [2023-08-31 23:12:26,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2023-08-31 23:12:26,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2023-08-31 23:12:26,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:26,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2023-08-31 23:12:26,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,276 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,276 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 6 states and 697 transitions. [2023-08-31 23:12:26,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 451 flow [2023-08-31 23:12:26,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 362 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 23:12:26,278 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 160 flow [2023-08-31 23:12:26,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-31 23:12:26,279 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-31 23:12:26,279 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 160 flow [2023-08-31 23:12:26,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:26,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:26,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:26,487 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:12:26,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:26,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 666678928, now seen corresponding path program 1 times [2023-08-31 23:12:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921712711] [2023-08-31 23:12:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:26,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:26,489 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:12:26,491 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:12:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:26,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:26,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:26,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:26,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:26,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921712711] [2023-08-31 23:12:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921712711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:26,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013768330] [2023-08-31 23:12:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:26,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:26,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:26,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:26,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:12:26,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:26,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:12:26,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:26,805 INFO L130 PetriNetUnfolder]: 909/1465 cut-off events. [2023-08-31 23:12:26,805 INFO L131 PetriNetUnfolder]: For 1044/1050 co-relation queries the response was YES. [2023-08-31 23:12:26,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1465 events. 909/1465 cut-off events. For 1044/1050 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7666 event pairs, 442 based on Foata normal form. 2/1457 useless extension candidates. Maximal degree in co-relation 4142. Up to 873 conditions per place. [2023-08-31 23:12:26,810 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 54 selfloop transitions, 2 changer transitions 11/70 dead transitions. [2023-08-31 23:12:26,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 432 flow [2023-08-31 23:12:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-31 23:12:26,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840989399293286 [2023-08-31 23:12:26,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-31 23:12:26,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-31 23:12:26,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:26,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-31 23:12:26,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,815 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 160 flow. Second operand 4 states and 548 transitions. [2023-08-31 23:12:26,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 432 flow [2023-08-31 23:12:26,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:26,823 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 163 flow [2023-08-31 23:12:26,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-31 23:12:26,824 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-31 23:12:26,824 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 163 flow [2023-08-31 23:12:26,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:26,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:26,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:26,832 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:12:27,028 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:12:27,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:27,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash -226881796, now seen corresponding path program 2 times [2023-08-31 23:12:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146956453] [2023-08-31 23:12:27,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:12:27,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:27,032 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:12:27,032 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:12:27,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:12:27,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:12:27,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:27,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:27,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:27,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146956453] [2023-08-31 23:12:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146956453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:27,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337205177] [2023-08-31 23:12:27,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:27,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:27,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:27,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:27,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-31 23:12:27,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:27,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-31 23:12:27,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:27,377 INFO L130 PetriNetUnfolder]: 531/1002 cut-off events. [2023-08-31 23:12:27,377 INFO L131 PetriNetUnfolder]: For 939/964 co-relation queries the response was YES. [2023-08-31 23:12:27,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 1002 events. 531/1002 cut-off events. For 939/964 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5305 event pairs, 55 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 2902. Up to 584 conditions per place. [2023-08-31 23:12:27,381 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 42 selfloop transitions, 1 changer transitions 32/78 dead transitions. [2023-08-31 23:12:27,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 483 flow [2023-08-31 23:12:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-31 23:12:27,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47703180212014135 [2023-08-31 23:12:27,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-31 23:12:27,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-31 23:12:27,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:27,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-31 23:12:27,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,387 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 163 flow. Second operand 5 states and 675 transitions. [2023-08-31 23:12:27,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 483 flow [2023-08-31 23:12:27,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 471 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:27,392 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 164 flow [2023-08-31 23:12:27,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 23:12:27,393 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-31 23:12:27,393 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 164 flow [2023-08-31 23:12:27,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:27,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:27,403 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 (10)] Ended with exit code 0 [2023-08-31 23:12:27,601 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:12:27,602 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:27,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 248169830, now seen corresponding path program 3 times [2023-08-31 23:12:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497267068] [2023-08-31 23:12:27,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:12:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:27,603 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:12:27,605 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:12:27,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:12:27,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:12:27,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:27,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:27,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:27,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497267068] [2023-08-31 23:12:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497267068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764439165] [2023-08-31 23:12:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:27,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:27,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-31 23:12:27,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:27,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-31 23:12:27,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:27,939 INFO L130 PetriNetUnfolder]: 660/1081 cut-off events. [2023-08-31 23:12:27,939 INFO L131 PetriNetUnfolder]: For 1035/1035 co-relation queries the response was YES. [2023-08-31 23:12:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3283 conditions, 1081 events. 660/1081 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4904 event pairs, 84 based on Foata normal form. 1/1077 useless extension candidates. Maximal degree in co-relation 3272. Up to 595 conditions per place. [2023-08-31 23:12:27,942 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 45 selfloop transitions, 1 changer transitions 32/81 dead transitions. [2023-08-31 23:12:27,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 516 flow [2023-08-31 23:12:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-31 23:12:27,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763250883392226 [2023-08-31 23:12:27,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-31 23:12:27,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-31 23:12:27,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:27,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-31 23:12:27,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,947 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,948 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 164 flow. Second operand 5 states and 674 transitions. [2023-08-31 23:12:27,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 516 flow [2023-08-31 23:12:27,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:27,952 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 168 flow [2023-08-31 23:12:27,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-31 23:12:27,953 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-31 23:12:27,953 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 168 flow [2023-08-31 23:12:27,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:27,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:27,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:27,963 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:12:28,160 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:12:28,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:28,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 206991094, now seen corresponding path program 4 times [2023-08-31 23:12:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826221497] [2023-08-31 23:12:28,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:12:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:28,162 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:12:28,165 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:12:28,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:12:28,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:12:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-31 23:12:28,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:28,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:28,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826221497] [2023-08-31 23:12:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826221497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:28,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:28,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113891817] [2023-08-31 23:12:28,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:28,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:12:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:12:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:12:28,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-31 23:12:28,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 125.875) internal successors, (1007), 8 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:28,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:28,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-31 23:12:28,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:29,195 INFO L130 PetriNetUnfolder]: 486/844 cut-off events. [2023-08-31 23:12:29,195 INFO L131 PetriNetUnfolder]: For 1071/1073 co-relation queries the response was YES. [2023-08-31 23:12:29,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 844 events. 486/844 cut-off events. For 1071/1073 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3821 event pairs, 154 based on Foata normal form. 1/830 useless extension candidates. Maximal degree in co-relation 2638. Up to 296 conditions per place. [2023-08-31 23:12:29,197 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 39 selfloop transitions, 5 changer transitions 51/99 dead transitions. [2023-08-31 23:12:29,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 673 flow [2023-08-31 23:12:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:12:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:12:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1161 transitions. [2023-08-31 23:12:29,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558303886925795 [2023-08-31 23:12:29,199 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1161 transitions. [2023-08-31 23:12:29,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1161 transitions. [2023-08-31 23:12:29,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:29,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1161 transitions. [2023-08-31 23:12:29,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:29,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:29,204 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:29,204 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 168 flow. Second operand 9 states and 1161 transitions. [2023-08-31 23:12:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 673 flow [2023-08-31 23:12:29,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 663 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:29,208 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 181 flow [2023-08-31 23:12:29,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-08-31 23:12:29,208 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-31 23:12:29,208 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 181 flow [2023-08-31 23:12:29,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 125.875) internal successors, (1007), 8 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:29,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:29,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:29,229 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:12:29,416 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:12:29,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:12:29,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash 173595180, now seen corresponding path program 5 times [2023-08-31 23:12:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590732454] [2023-08-31 23:12:29,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:12:29,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:29,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:29,417 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:29,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:12:29,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:12:29,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:12:29,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:12:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:29,640 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:12:29,640 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:12:29,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:12:29,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:12:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:12:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:12:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:12:29,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:12:29,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:29,851 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:29,855 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:12:29,855 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:12:29,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:12:29 BasicIcfg [2023-08-31 23:12:29,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:12:29,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:12:29,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:12:29,918 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:12:29,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:14" (3/4) ... [2023-08-31 23:12:29,919 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:12:29,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:12:29,920 INFO L158 Benchmark]: Toolchain (without parser) took 16314.50ms. Allocated memory was 75.5MB in the beginning and 534.8MB in the end (delta: 459.3MB). Free memory was 51.0MB in the beginning and 352.9MB in the end (delta: -301.9MB). Peak memory consumption was 157.7MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,920 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:29,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.91ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 44.5MB in the end (delta: 6.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.37ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,921 INFO L158 Benchmark]: Boogie Preprocessor took 49.44ms. Allocated memory is still 75.5MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,921 INFO L158 Benchmark]: RCFGBuilder took 589.88ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 39.1MB in the beginning and 59.9MB in the end (delta: -20.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,921 INFO L158 Benchmark]: TraceAbstraction took 15115.09ms. Allocated memory was 94.4MB in the beginning and 534.8MB in the end (delta: 440.4MB). Free memory was 59.3MB in the beginning and 352.9MB in the end (delta: -293.6MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2023-08-31 23:12:29,921 INFO L158 Benchmark]: Witness Printer took 1.91ms. Allocated memory is still 534.8MB. Free memory is still 352.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:29,922 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.08ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.91ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 44.5MB in the end (delta: 6.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.37ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.44ms. Allocated memory is still 75.5MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.88ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 39.1MB in the beginning and 59.9MB in the end (delta: -20.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15115.09ms. Allocated memory was 94.4MB in the beginning and 534.8MB in the end (delta: 440.4MB). Free memory was 59.3MB in the beginning and 352.9MB in the end (delta: -293.6MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 1.91ms. Allocated memory is still 534.8MB. Free memory is still 352.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 150 PlacesBefore, 51 PlacesAfterwards, 139 TransitionsBefore, 39 TransitionsAfterwards, 3170 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 8512 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3192, independent: 2981, independent conditional: 0, independent unconditional: 2981, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1602, independent: 1569, independent conditional: 0, independent unconditional: 1569, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3192, independent: 1412, independent conditional: 0, independent unconditional: 1412, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 1602, unknown conditional: 0, unknown unconditional: 1602] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=0, t357={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=1, t357={11:0}, t358={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=2, t357={11:0}, t358={15:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=3, t357={11:0}, t358={15:0}, t359={7:0}, t360={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={11:0}, t358={15:0}, t359={7:0}, t360={-2147483637:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2241 IncrementalHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 21 mSDtfsCounter, 2241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 18 QuantifiedInterpolants, 2059 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1720 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:12:29,942 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