./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:36:05,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:36:05,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:36:05,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:36:05,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:36:05,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:36:05,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:36:05,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:36:05,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:36:05,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:36:05,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:36:05,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:36:05,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:36:05,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:36:05,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:36:05,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:36:05,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:36:05,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:36:05,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:36:05,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:36:05,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:36:05,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:36:05,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:36:05,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:36:05,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:36:05,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:36:05,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:36:05,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:36:05,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:36:05,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:36:05,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:36:05,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:36:05,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:36:05,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:36:05,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:36:05,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:36:05,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:36:05,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:36:05,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:36:05,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:36:05,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:36:05,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:36:05,710 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:36:05,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:36:05,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:36:05,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:36:05,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:36:05,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:36:05,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:36:05,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:36:05,713 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:36:05,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:36:05,714 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:36:05,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:36:05,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:36:05,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:36:05,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:36:05,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:36:05,716 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:36:05,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:36:05,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:36:05,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:36:05,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:36:05,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:36:05,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:36:05,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:36:05,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:36:05,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:36:05,718 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:36:05,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:36:05,719 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:36:05,719 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:36:06,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:36:06,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:36:06,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:36:06,076 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:36:06,076 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:36:06,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-29 20:36:07,222 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:36:07,500 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:36:07,503 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-29 20:36:07,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a994b63/9354dc7c06e94d0397c8acb4527d2b6e/FLAGc8f574469 [2023-08-29 20:36:07,538 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a994b63/9354dc7c06e94d0397c8acb4527d2b6e [2023-08-29 20:36:07,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:36:07,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:36:07,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:36:07,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:36:07,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:36:07,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:36:07" (1/1) ... [2023-08-29 20:36:07,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78571ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:07, skipping insertion in model container [2023-08-29 20:36:07,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:36:07" (1/1) ... [2023-08-29 20:36:07,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:36:07,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:36:07,794 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/safe003_power.opt.i[951,964] [2023-08-29 20:36:08,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:36:08,023 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:36:08,036 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/safe003_power.opt.i[951,964] [2023-08-29 20:36:08,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:36:08,140 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:36:08,141 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:36:08,146 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:36:08,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08 WrapperNode [2023-08-29 20:36:08,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:36:08,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:36:08,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:36:08,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:36:08,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,229 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-29 20:36:08,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:36:08,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:36:08,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:36:08,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:36:08,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:36:08,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:36:08,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:36:08,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:36:08,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (1/1) ... [2023-08-29 20:36:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:36:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:36:08,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:36:08,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:36:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:36:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:36:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:36:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:36:08,331 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:36:08,518 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:36:08,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:36:09,040 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:36:09,616 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:36:09,616 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:36:09,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:36:09 BoogieIcfgContainer [2023-08-29 20:36:09,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:36:09,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:36:09,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:36:09,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:36:09,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:36:07" (1/3) ... [2023-08-29 20:36:09,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3569d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:36:09, skipping insertion in model container [2023-08-29 20:36:09,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:36:08" (2/3) ... [2023-08-29 20:36:09,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3569d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:36:09, skipping insertion in model container [2023-08-29 20:36:09,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:36:09" (3/3) ... [2023-08-29 20:36:09,626 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-08-29 20:36:09,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:36:09,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-29 20:36:09,643 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:36:09,768 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:36:09,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:36:09,882 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:36:09,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:36:09,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:36:09,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:36:09,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-29 20:36:09,897 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:36:09,905 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:36:09,907 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:36:09,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-29 20:36:09,944 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:36:09,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:36:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:36:09,949 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-29 20:36:21,485 INFO L134 LiptonReduction]: Checked pairs total: 34669 [2023-08-29 20:36:21,485 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-29 20:36:21,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:36:21,503 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;@5afa2f5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:36:21,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-29 20:36:21,504 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:36:21,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:36:21,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:21,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:36:21,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:21,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1117, now seen corresponding path program 1 times [2023-08-29 20:36:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878446140] [2023-08-29 20:36:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878446140] [2023-08-29 20:36:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878446140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:21,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:36:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905529328] [2023-08-29 20:36:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:21,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:36:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:36:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:36:21,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-29 20:36:21,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:21,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:21,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-29 20:36:21,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:26,963 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-29 20:36:26,963 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:36:27,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3422. Compared 316871 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-29 20:36:27,251 INFO L137 encePairwiseOnDemand]: 294/315 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:36:27,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-29 20:36:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:36:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:36:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-29 20:36:27,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2023-08-29 20:36:27,271 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-29 20:36:27,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-29 20:36:27,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:27,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-29 20:36:27,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,287 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,288 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 314 transitions. [2023-08-29 20:36:27,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-29 20:36:27,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:36:27,441 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-29 20:36:27,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 20:36:27,460 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:36:27,460 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-29 20:36:27,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:27,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:36:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:36:27,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:27,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash 34183690, now seen corresponding path program 1 times [2023-08-29 20:36:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371418946] [2023-08-29 20:36:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371418946] [2023-08-29 20:36:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371418946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247731188] [2023-08-29 20:36:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:27,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:27,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-29 20:36:27,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:27,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:27,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-29 20:36:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:32,558 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-29 20:36:32,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:36:32,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3098. Compared 303326 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-29 20:36:32,745 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-29 20:36:32,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-29 20:36:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-29 20:36:32,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2023-08-29 20:36:32,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-29 20:36:32,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-29 20:36:32,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:32,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-29 20:36:32,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:32,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:32,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:32,757 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-29 20:36:32,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-29 20:36:32,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:36:32,760 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-29 20:36:32,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 20:36:32,761 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-29 20:36:32,762 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-29 20:36:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:32,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:32,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:36:32,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:36:32,763 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:32,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1059695312, now seen corresponding path program 1 times [2023-08-29 20:36:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499282689] [2023-08-29 20:36:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499282689] [2023-08-29 20:36:32,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499282689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:32,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610469421] [2023-08-29 20:36:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:32,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 315 [2023-08-29 20:36:32,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:32,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:32,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 315 [2023-08-29 20:36:32,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:35,148 INFO L130 PetriNetUnfolder]: 17406/25455 cut-off events. [2023-08-29 20:36:35,148 INFO L131 PetriNetUnfolder]: For 921/921 co-relation queries the response was YES. [2023-08-29 20:36:35,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51637 conditions, 25455 events. 17406/25455 cut-off events. For 921/921 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 181129 event pairs, 10856 based on Foata normal form. 0/13741 useless extension candidates. Maximal degree in co-relation 51633. Up to 14741 conditions per place. [2023-08-29 20:36:35,331 INFO L137 encePairwiseOnDemand]: 297/315 looper letters, 55 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-29 20:36:35,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 272 flow [2023-08-29 20:36:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-29 20:36:35,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2023-08-29 20:36:35,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-29 20:36:35,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-29 20:36:35,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:35,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-29 20:36:35,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:35,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:35,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:35,338 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 430 transitions. [2023-08-29 20:36:35,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 272 flow [2023-08-29 20:36:35,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:35,341 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 176 flow [2023-08-29 20:36:35,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-29 20:36:35,342 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-29 20:36:35,342 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 176 flow [2023-08-29 20:36:35,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:35,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:35,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:36:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:36:35,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:35,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1059695313, now seen corresponding path program 1 times [2023-08-29 20:36:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007269100] [2023-08-29 20:36:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007269100] [2023-08-29 20:36:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007269100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:35,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459597013] [2023-08-29 20:36:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:35,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:35,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-29 20:36:35,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:35,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:35,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-29 20:36:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:36,334 INFO L130 PetriNetUnfolder]: 5214/8034 cut-off events. [2023-08-29 20:36:36,334 INFO L131 PetriNetUnfolder]: For 2191/2191 co-relation queries the response was YES. [2023-08-29 20:36:36,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21986 conditions, 8034 events. 5214/8034 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 50704 event pairs, 4096 based on Foata normal form. 1723/8447 useless extension candidates. Maximal degree in co-relation 21981. Up to 7882 conditions per place. [2023-08-29 20:36:36,379 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-29 20:36:36,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 242 flow [2023-08-29 20:36:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-29 20:36:36,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2023-08-29 20:36:36,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-29 20:36:36,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-29 20:36:36,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:36,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-29 20:36:36,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:36,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:36,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:36,386 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 176 flow. Second operand 3 states and 410 transitions. [2023-08-29 20:36:36,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 242 flow [2023-08-29 20:36:36,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:36,405 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 142 flow [2023-08-29 20:36:36,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-29 20:36:36,406 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -31 predicate places. [2023-08-29 20:36:36,406 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 142 flow [2023-08-29 20:36:36,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:36,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:36,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:36,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:36:36,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:36,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1379766903, now seen corresponding path program 1 times [2023-08-29 20:36:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:36,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069401984] [2023-08-29 20:36:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069401984] [2023-08-29 20:36:36,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069401984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:36,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410641657] [2023-08-29 20:36:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:36,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:36,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-29 20:36:36,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:36,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:36,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-29 20:36:36,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:37,326 INFO L130 PetriNetUnfolder]: 5112/8033 cut-off events. [2023-08-29 20:36:37,326 INFO L131 PetriNetUnfolder]: For 919/944 co-relation queries the response was YES. [2023-08-29 20:36:37,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20363 conditions, 8033 events. 5112/8033 cut-off events. For 919/944 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 52869 event pairs, 1762 based on Foata normal form. 0/6088 useless extension candidates. Maximal degree in co-relation 20358. Up to 6126 conditions per place. [2023-08-29 20:36:37,369 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 66 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-29 20:36:37,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 366 flow [2023-08-29 20:36:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:36:37,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-29 20:36:37,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:36:37,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:36:37,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:37,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:36:37,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,376 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 142 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:36:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 366 flow [2023-08-29 20:36:37,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:37,380 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 154 flow [2023-08-29 20:36:37,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-29 20:36:37,383 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -29 predicate places. [2023-08-29 20:36:37,383 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 154 flow [2023-08-29 20:36:37,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:37,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:37,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:36:37,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:37,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1379767153, now seen corresponding path program 1 times [2023-08-29 20:36:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586852510] [2023-08-29 20:36:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:37,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:37,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:37,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586852510] [2023-08-29 20:36:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586852510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:37,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:37,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284403955] [2023-08-29 20:36:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:37,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:37,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:36:37,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:37,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:37,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:36:37,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:38,448 INFO L130 PetriNetUnfolder]: 5061/8180 cut-off events. [2023-08-29 20:36:38,448 INFO L131 PetriNetUnfolder]: For 2022/2022 co-relation queries the response was YES. [2023-08-29 20:36:38,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21279 conditions, 8180 events. 5061/8180 cut-off events. For 2022/2022 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 55346 event pairs, 983 based on Foata normal form. 0/6483 useless extension candidates. Maximal degree in co-relation 21273. Up to 6512 conditions per place. [2023-08-29 20:36:38,485 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 67 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-29 20:36:38,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 392 flow [2023-08-29 20:36:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-29 20:36:38,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-29 20:36:38,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-29 20:36:38,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-29 20:36:38,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:38,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-29 20:36:38,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:38,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:38,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:38,491 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 154 flow. Second operand 3 states and 420 transitions. [2023-08-29 20:36:38,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 392 flow [2023-08-29 20:36:38,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:38,494 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 156 flow [2023-08-29 20:36:38,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-29 20:36:38,495 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -28 predicate places. [2023-08-29 20:36:38,495 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 156 flow [2023-08-29 20:36:38,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:38,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:38,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:38,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:36:38,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:38,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 432917052, now seen corresponding path program 1 times [2023-08-29 20:36:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786141091] [2023-08-29 20:36:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786141091] [2023-08-29 20:36:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786141091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:39,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:36:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377780409] [2023-08-29 20:36:39,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:39,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:36:39,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:36:39,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:36:39,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 315 [2023-08-29 20:36:39,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:39,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:39,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 315 [2023-08-29 20:36:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:40,748 INFO L130 PetriNetUnfolder]: 10213/15636 cut-off events. [2023-08-29 20:36:40,748 INFO L131 PetriNetUnfolder]: For 2847/2886 co-relation queries the response was YES. [2023-08-29 20:36:40,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42695 conditions, 15636 events. 10213/15636 cut-off events. For 2847/2886 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 110469 event pairs, 2570 based on Foata normal form. 120/12142 useless extension candidates. Maximal degree in co-relation 42688. Up to 6159 conditions per place. [2023-08-29 20:36:40,806 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 186 selfloop transitions, 28 changer transitions 0/216 dead transitions. [2023-08-29 20:36:40,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 216 transitions, 1175 flow [2023-08-29 20:36:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:36:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:36:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1409 transitions. [2023-08-29 20:36:40,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40663780663780663 [2023-08-29 20:36:40,810 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1409 transitions. [2023-08-29 20:36:40,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1409 transitions. [2023-08-29 20:36:40,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:40,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1409 transitions. [2023-08-29 20:36:40,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0909090909091) internal successors, (1409), 11 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:40,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:40,819 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:40,820 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 156 flow. Second operand 11 states and 1409 transitions. [2023-08-29 20:36:40,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 216 transitions, 1175 flow [2023-08-29 20:36:40,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 216 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:36:40,826 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 398 flow [2023-08-29 20:36:40,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=398, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-29 20:36:40,827 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -13 predicate places. [2023-08-29 20:36:40,827 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 398 flow [2023-08-29 20:36:40,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:40,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:40,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:40,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:36:40,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:40,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -178400329, now seen corresponding path program 1 times [2023-08-29 20:36:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303913241] [2023-08-29 20:36:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303913241] [2023-08-29 20:36:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303913241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:41,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:41,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176725741] [2023-08-29 20:36:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:41,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:41,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-29 20:36:41,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:41,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:41,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-29 20:36:41,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:42,626 INFO L130 PetriNetUnfolder]: 12604/18827 cut-off events. [2023-08-29 20:36:42,627 INFO L131 PetriNetUnfolder]: For 14466/14466 co-relation queries the response was YES. [2023-08-29 20:36:42,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61083 conditions, 18827 events. 12604/18827 cut-off events. For 14466/14466 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 128684 event pairs, 4578 based on Foata normal form. 9/14933 useless extension candidates. Maximal degree in co-relation 61069. Up to 18440 conditions per place. [2023-08-29 20:36:42,768 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 104 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2023-08-29 20:36:42,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 813 flow [2023-08-29 20:36:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-29 20:36:42,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433862433862434 [2023-08-29 20:36:42,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-29 20:36:42,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-29 20:36:42,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:42,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-29 20:36:42,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:42,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:42,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:42,773 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 398 flow. Second operand 3 states and 419 transitions. [2023-08-29 20:36:42,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 813 flow [2023-08-29 20:36:43,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:36:43,214 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 417 flow [2023-08-29 20:36:43,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-29 20:36:43,215 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-29 20:36:43,215 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 417 flow [2023-08-29 20:36:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:43,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:43,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:36:43,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:43,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1190757210, now seen corresponding path program 1 times [2023-08-29 20:36:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774141726] [2023-08-29 20:36:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:43,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774141726] [2023-08-29 20:36:43,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774141726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:43,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:43,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:36:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205810410] [2023-08-29 20:36:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:36:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:36:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:36:43,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-29 20:36:43,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:43,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:43,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-29 20:36:43,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:45,297 INFO L130 PetriNetUnfolder]: 14321/21073 cut-off events. [2023-08-29 20:36:45,297 INFO L131 PetriNetUnfolder]: For 17332/17348 co-relation queries the response was YES. [2023-08-29 20:36:45,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69399 conditions, 21073 events. 14321/21073 cut-off events. For 17332/17348 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 140482 event pairs, 3474 based on Foata normal form. 51/16411 useless extension candidates. Maximal degree in co-relation 69383. Up to 15149 conditions per place. [2023-08-29 20:36:45,480 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 122 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2023-08-29 20:36:45,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 995 flow [2023-08-29 20:36:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:36:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:36:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:36:45,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455026455026455 [2023-08-29 20:36:45,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:36:45,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:36:45,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:45,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:36:45,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:45,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:45,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:45,485 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 417 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:36:45,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 995 flow [2023-08-29 20:36:45,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:45,619 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 422 flow [2023-08-29 20:36:45,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-29 20:36:45,620 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2023-08-29 20:36:45,620 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 422 flow [2023-08-29 20:36:45,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:45,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:45,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:45,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:36:45,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:45,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1188687464, now seen corresponding path program 1 times [2023-08-29 20:36:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317239924] [2023-08-29 20:36:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:45,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317239924] [2023-08-29 20:36:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317239924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:45,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792615600] [2023-08-29 20:36:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:36:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:36:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:36:45,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 315 [2023-08-29 20:36:45,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:45,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:45,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 315 [2023-08-29 20:36:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:47,325 INFO L130 PetriNetUnfolder]: 10041/15076 cut-off events. [2023-08-29 20:36:47,325 INFO L131 PetriNetUnfolder]: For 13046/13112 co-relation queries the response was YES. [2023-08-29 20:36:47,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50826 conditions, 15076 events. 10041/15076 cut-off events. For 13046/13112 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 99154 event pairs, 3927 based on Foata normal form. 20/11732 useless extension candidates. Maximal degree in co-relation 50809. Up to 6589 conditions per place. [2023-08-29 20:36:47,397 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 79 selfloop transitions, 20 changer transitions 0/102 dead transitions. [2023-08-29 20:36:47,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 746 flow [2023-08-29 20:36:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-29 20:36:47,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158730158730159 [2023-08-29 20:36:47,399 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-29 20:36:47,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-29 20:36:47,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:47,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-29 20:36:47,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:47,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:47,403 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:47,403 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 422 flow. Second operand 4 states and 524 transitions. [2023-08-29 20:36:47,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 746 flow [2023-08-29 20:36:47,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 736 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:36:47,498 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 531 flow [2023-08-29 20:36:47,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-08-29 20:36:47,499 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-29 20:36:47,500 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 531 flow [2023-08-29 20:36:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:47,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:47,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:47,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:36:47,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:47,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1349055979, now seen corresponding path program 1 times [2023-08-29 20:36:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579048653] [2023-08-29 20:36:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579048653] [2023-08-29 20:36:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579048653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:47,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:36:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120410870] [2023-08-29 20:36:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:36:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:36:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:36:47,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-29 20:36:47,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:47,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:47,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-29 20:36:47,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:49,897 INFO L130 PetriNetUnfolder]: 12273/18936 cut-off events. [2023-08-29 20:36:49,897 INFO L131 PetriNetUnfolder]: For 22978/22993 co-relation queries the response was YES. [2023-08-29 20:36:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69774 conditions, 18936 events. 12273/18936 cut-off events. For 22978/22993 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 138334 event pairs, 3319 based on Foata normal form. 2/16064 useless extension candidates. Maximal degree in co-relation 69757. Up to 7632 conditions per place. [2023-08-29 20:36:50,023 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 187 selfloop transitions, 16 changer transitions 0/206 dead transitions. [2023-08-29 20:36:50,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 206 transitions, 1655 flow [2023-08-29 20:36:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:36:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:36:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-08-29 20:36:50,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253968253968254 [2023-08-29 20:36:50,027 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-08-29 20:36:50,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-08-29 20:36:50,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:50,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-08-29 20:36:50,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,033 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,033 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 531 flow. Second operand 8 states and 1072 transitions. [2023-08-29 20:36:50,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 206 transitions, 1655 flow [2023-08-29 20:36:50,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 206 transitions, 1640 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:50,371 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 590 flow [2023-08-29 20:36:50,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-08-29 20:36:50,372 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 3 predicate places. [2023-08-29 20:36:50,372 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 590 flow [2023-08-29 20:36:50,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:50,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:50,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:36:50,374 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:50,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:50,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114094, now seen corresponding path program 1 times [2023-08-29 20:36:50,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:50,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958618925] [2023-08-29 20:36:50,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:50,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958618925] [2023-08-29 20:36:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958618925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:50,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788086677] [2023-08-29 20:36:50,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:36:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:36:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:36:50,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:36:50,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:50,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:50,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:36:50,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:52,515 INFO L130 PetriNetUnfolder]: 12556/19533 cut-off events. [2023-08-29 20:36:52,515 INFO L131 PetriNetUnfolder]: For 33752/33785 co-relation queries the response was YES. [2023-08-29 20:36:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75738 conditions, 19533 events. 12556/19533 cut-off events. For 33752/33785 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 144211 event pairs, 4172 based on Foata normal form. 76/17509 useless extension candidates. Maximal degree in co-relation 75716. Up to 9287 conditions per place. [2023-08-29 20:36:52,698 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 68 selfloop transitions, 36 changer transitions 0/107 dead transitions. [2023-08-29 20:36:52,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 927 flow [2023-08-29 20:36:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:36:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:36:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-29 20:36:52,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-29 20:36:52,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-29 20:36:52,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-29 20:36:52,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:52,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-29 20:36:52,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:52,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:52,705 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:52,706 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 590 flow. Second operand 4 states and 539 transitions. [2023-08-29 20:36:52,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 927 flow [2023-08-29 20:36:53,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 895 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:36:53,038 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 667 flow [2023-08-29 20:36:53,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=667, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2023-08-29 20:36:53,039 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-29 20:36:53,039 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 667 flow [2023-08-29 20:36:53,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:53,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:53,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:36:53,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:53,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1818086776, now seen corresponding path program 1 times [2023-08-29 20:36:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265374860] [2023-08-29 20:36:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:36:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:36:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:36:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265374860] [2023-08-29 20:36:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265374860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:36:53,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:36:53,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:36:53,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146609657] [2023-08-29 20:36:53,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:36:53,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:36:53,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:36:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:36:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:36:53,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:36:53,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 667 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-29 20:36:53,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:36:53,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:36:53,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:36:58,060 INFO L130 PetriNetUnfolder]: 31049/49232 cut-off events. [2023-08-29 20:36:58,061 INFO L131 PetriNetUnfolder]: For 110426/110507 co-relation queries the response was YES. [2023-08-29 20:36:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199568 conditions, 49232 events. 31049/49232 cut-off events. For 110426/110507 co-relation queries the response was YES. Maximal size of possible extension queue 3831. Compared 420780 event pairs, 8280 based on Foata normal form. 264/43981 useless extension candidates. Maximal degree in co-relation 199550. Up to 17618 conditions per place. [2023-08-29 20:36:58,423 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 265 selfloop transitions, 6 changer transitions 0/272 dead transitions. [2023-08-29 20:36:58,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 272 transitions, 2842 flow [2023-08-29 20:36:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:36:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:36:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-08-29 20:36:58,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4450793650793651 [2023-08-29 20:36:58,425 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-08-29 20:36:58,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-08-29 20:36:58,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:36:58,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-08-29 20:36:58,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:58,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:58,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:36:58,430 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 667 flow. Second operand 5 states and 701 transitions. [2023-08-29 20:36:58,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 272 transitions, 2842 flow [2023-08-29 20:36:59,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 272 transitions, 2686 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-29 20:36:59,935 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 675 flow [2023-08-29 20:36:59,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-08-29 20:36:59,936 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-29 20:36:59,936 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 675 flow [2023-08-29 20:36:59,936 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-29 20:36:59,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:36:59,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:36:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:36:59,937 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:36:59,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:36:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1741229332, now seen corresponding path program 2 times [2023-08-29 20:36:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:36:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203444281] [2023-08-29 20:36:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:36:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:36:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:37:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203444281] [2023-08-29 20:37:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203444281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:00,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:00,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:37:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519481864] [2023-08-29 20:37:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:00,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:37:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:37:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:37:00,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:37:00,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 675 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:00,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:00,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:37:00,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:10,063 INFO L130 PetriNetUnfolder]: 55930/86844 cut-off events. [2023-08-29 20:37:10,063 INFO L131 PetriNetUnfolder]: For 193327/193327 co-relation queries the response was YES. [2023-08-29 20:37:10,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354893 conditions, 86844 events. 55930/86844 cut-off events. For 193327/193327 co-relation queries the response was YES. Maximal size of possible extension queue 5713. Compared 748980 event pairs, 16063 based on Foata normal form. 216/77207 useless extension candidates. Maximal degree in co-relation 354872. Up to 32745 conditions per place. [2023-08-29 20:37:10,786 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 267 selfloop transitions, 8 changer transitions 0/275 dead transitions. [2023-08-29 20:37:10,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 275 transitions, 2747 flow [2023-08-29 20:37:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:37:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:37:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2023-08-29 20:37:10,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634920634920633 [2023-08-29 20:37:10,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2023-08-29 20:37:10,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2023-08-29 20:37:10,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:10,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2023-08-29 20:37:10,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:10,792 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 675 flow. Second operand 5 states and 703 transitions. [2023-08-29 20:37:10,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 275 transitions, 2747 flow [2023-08-29 20:37:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 275 transitions, 2743 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-29 20:37:14,785 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 719 flow [2023-08-29 20:37:14,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=719, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2023-08-29 20:37:14,785 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2023-08-29 20:37:14,786 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 719 flow [2023-08-29 20:37:14,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:14,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:14,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:14,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:37:14,786 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:37:14,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1741168882, now seen corresponding path program 3 times [2023-08-29 20:37:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875516726] [2023-08-29 20:37:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:37:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875516726] [2023-08-29 20:37:15,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875516726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:15,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:37:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216885329] [2023-08-29 20:37:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:15,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:37:15,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:37:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:37:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:37:15,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:15,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:15,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:37:15,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:26,344 INFO L130 PetriNetUnfolder]: 65120/101348 cut-off events. [2023-08-29 20:37:26,344 INFO L131 PetriNetUnfolder]: For 247868/247868 co-relation queries the response was YES. [2023-08-29 20:37:26,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425141 conditions, 101348 events. 65120/101348 cut-off events. For 247868/247868 co-relation queries the response was YES. Maximal size of possible extension queue 6959. Compared 896208 event pairs, 19261 based on Foata normal form. 234/89945 useless extension candidates. Maximal degree in co-relation 425117. Up to 68924 conditions per place. [2023-08-29 20:37:27,152 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 186 selfloop transitions, 5 changer transitions 0/191 dead transitions. [2023-08-29 20:37:27,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 191 transitions, 1920 flow [2023-08-29 20:37:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:37:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:37:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-29 20:37:27,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396825396825397 [2023-08-29 20:37:27,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-29 20:37:27,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-29 20:37:27,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:27,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-29 20:37:27,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:27,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:27,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:27,157 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 719 flow. Second operand 4 states and 554 transitions. [2023-08-29 20:37:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 191 transitions, 1920 flow [2023-08-29 20:37:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 191 transitions, 1912 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-29 20:37:32,019 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 736 flow [2023-08-29 20:37:32,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=736, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2023-08-29 20:37:32,020 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2023-08-29 20:37:32,020 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 736 flow [2023-08-29 20:37:32,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:32,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:32,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:32,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:37:32,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:37:32,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 132711279, now seen corresponding path program 1 times [2023-08-29 20:37:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213326987] [2023-08-29 20:37:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:37:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213326987] [2023-08-29 20:37:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213326987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:32,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:32,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:37:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13125767] [2023-08-29 20:37:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:32,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:37:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:32,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:37:32,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:37:32,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:37:32,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 736 flow. Second operand has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:32,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:32,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:37:32,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:39,958 INFO L130 PetriNetUnfolder]: 37235/60054 cut-off events. [2023-08-29 20:37:39,958 INFO L131 PetriNetUnfolder]: For 160143/160599 co-relation queries the response was YES. [2023-08-29 20:37:40,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237842 conditions, 60054 events. 37235/60054 cut-off events. For 160143/160599 co-relation queries the response was YES. Maximal size of possible extension queue 5337. Compared 545862 event pairs, 9223 based on Foata normal form. 84/57968 useless extension candidates. Maximal degree in co-relation 237816. Up to 22903 conditions per place. [2023-08-29 20:37:40,567 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 116 selfloop transitions, 27 changer transitions 1/152 dead transitions. [2023-08-29 20:37:40,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1426 flow [2023-08-29 20:37:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:37:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:37:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2023-08-29 20:37:40,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764172335600907 [2023-08-29 20:37:40,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2023-08-29 20:37:40,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2023-08-29 20:37:40,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:40,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2023-08-29 20:37:40,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,575 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:40,575 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 736 flow. Second operand 7 states and 830 transitions. [2023-08-29 20:37:40,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1426 flow [2023-08-29 20:37:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 1415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:37:41,842 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 690 flow [2023-08-29 20:37:41,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=690, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-08-29 20:37:41,843 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2023-08-29 20:37:41,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 690 flow [2023-08-29 20:37:41,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:41,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:41,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:37:41,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:37:41,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1805396294, now seen corresponding path program 1 times [2023-08-29 20:37:41,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:41,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501363835] [2023-08-29 20:37:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:41,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:37:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501363835] [2023-08-29 20:37:42,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501363835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:37:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794805393] [2023-08-29 20:37:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:37:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:37:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:37:42,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-29 20:37:42,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:42,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:42,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-29 20:37:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:47,674 INFO L130 PetriNetUnfolder]: 27254/44793 cut-off events. [2023-08-29 20:37:47,675 INFO L131 PetriNetUnfolder]: For 117349/117801 co-relation queries the response was YES. [2023-08-29 20:37:47,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171903 conditions, 44793 events. 27254/44793 cut-off events. For 117349/117801 co-relation queries the response was YES. Maximal size of possible extension queue 3296. Compared 396826 event pairs, 12201 based on Foata normal form. 1459/44880 useless extension candidates. Maximal degree in co-relation 171877. Up to 18906 conditions per place. [2023-08-29 20:37:48,039 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 101 selfloop transitions, 21 changer transitions 1/131 dead transitions. [2023-08-29 20:37:48,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 1274 flow [2023-08-29 20:37:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:37:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:37:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-29 20:37:48,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941798941798942 [2023-08-29 20:37:48,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-29 20:37:48,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-29 20:37:48,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:48,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-29 20:37:48,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:48,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:48,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:48,044 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 690 flow. Second operand 6 states and 745 transitions. [2023-08-29 20:37:48,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 1274 flow [2023-08-29 20:37:48,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 131 transitions, 1220 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 20:37:48,798 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 780 flow [2023-08-29 20:37:48,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2023-08-29 20:37:48,798 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2023-08-29 20:37:48,798 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 780 flow [2023-08-29 20:37:48,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:48,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:37:48,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:37:48,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:37:48,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:37:48,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:37:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1783372630, now seen corresponding path program 1 times [2023-08-29 20:37:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:37:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989136643] [2023-08-29 20:37:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:37:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:37:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:37:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:37:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:37:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989136643] [2023-08-29 20:37:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989136643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:37:49,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:37:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:37:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908375982] [2023-08-29 20:37:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:37:49,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:37:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:37:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:37:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:37:49,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:37:49,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 780 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:49,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:37:49,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:37:49,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:37:56,693 INFO L130 PetriNetUnfolder]: 37777/62479 cut-off events. [2023-08-29 20:37:56,693 INFO L131 PetriNetUnfolder]: For 219938/220137 co-relation queries the response was YES. [2023-08-29 20:37:57,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259836 conditions, 62479 events. 37777/62479 cut-off events. For 219938/220137 co-relation queries the response was YES. Maximal size of possible extension queue 3962. Compared 574122 event pairs, 13956 based on Foata normal form. 221/61555 useless extension candidates. Maximal degree in co-relation 259809. Up to 30735 conditions per place. [2023-08-29 20:37:57,167 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 172 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2023-08-29 20:37:57,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 180 transitions, 2007 flow [2023-08-29 20:37:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:37:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:37:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:37:57,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2023-08-29 20:37:57,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:37:57,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:37:57,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:37:57,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:37:57,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:57,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:57,172 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:37:57,173 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 780 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:37:57,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 180 transitions, 2007 flow [2023-08-29 20:38:01,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 180 transitions, 1953 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:01,325 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 782 flow [2023-08-29 20:38:01,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=782, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2023-08-29 20:38:01,326 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 21 predicate places. [2023-08-29 20:38:01,326 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 782 flow [2023-08-29 20:38:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:01,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:01,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:38:01,327 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:01,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 279946760, now seen corresponding path program 2 times [2023-08-29 20:38:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685847138] [2023-08-29 20:38:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:02,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-29 20:38:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685847138] [2023-08-29 20:38:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685847138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:02,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:38:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647593535] [2023-08-29 20:38:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:02,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:38:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:38:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:38:02,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 315 [2023-08-29 20:38:02,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 782 flow. Second operand has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:02,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:02,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 315 [2023-08-29 20:38:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:09,791 INFO L130 PetriNetUnfolder]: 34340/56390 cut-off events. [2023-08-29 20:38:09,791 INFO L131 PetriNetUnfolder]: For 156520/157172 co-relation queries the response was YES. [2023-08-29 20:38:10,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231340 conditions, 56390 events. 34340/56390 cut-off events. For 156520/157172 co-relation queries the response was YES. Maximal size of possible extension queue 4227. Compared 518308 event pairs, 17041 based on Foata normal form. 87/54747 useless extension candidates. Maximal degree in co-relation 231311. Up to 53004 conditions per place. [2023-08-29 20:38:10,229 INFO L137 encePairwiseOnDemand]: 303/315 looper letters, 138 selfloop transitions, 55 changer transitions 0/201 dead transitions. [2023-08-29 20:38:10,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 2074 flow [2023-08-29 20:38:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:38:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:38:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1264 transitions. [2023-08-29 20:38:10,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3647907647907648 [2023-08-29 20:38:10,232 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1264 transitions. [2023-08-29 20:38:10,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1264 transitions. [2023-08-29 20:38:10,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:10,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1264 transitions. [2023-08-29 20:38:10,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.9090909090909) internal successors, (1264), 11 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,238 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,239 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 782 flow. Second operand 11 states and 1264 transitions. [2023-08-29 20:38:10,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 2074 flow [2023-08-29 20:38:13,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 2050 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:13,334 INFO L231 Difference]: Finished difference. Result has 118 places, 141 transitions, 1470 flow [2023-08-29 20:38:13,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1470, PETRI_PLACES=118, PETRI_TRANSITIONS=141} [2023-08-29 20:38:13,335 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 38 predicate places. [2023-08-29 20:38:13,335 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 141 transitions, 1470 flow [2023-08-29 20:38:13,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:13,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:13,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:38:13,336 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:13,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 132714388, now seen corresponding path program 1 times [2023-08-29 20:38:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482466249] [2023-08-29 20:38:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:13,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482466249] [2023-08-29 20:38:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482466249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693672794] [2023-08-29 20:38:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:13,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:13,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-29 20:38:13,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 141 transitions, 1470 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:13,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:13,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-29 20:38:13,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:19,252 INFO L130 PetriNetUnfolder]: 28232/43327 cut-off events. [2023-08-29 20:38:19,252 INFO L131 PetriNetUnfolder]: For 179942/180896 co-relation queries the response was YES. [2023-08-29 20:38:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186918 conditions, 43327 events. 28232/43327 cut-off events. For 179942/180896 co-relation queries the response was YES. Maximal size of possible extension queue 2514. Compared 340899 event pairs, 14380 based on Foata normal form. 1769/44329 useless extension candidates. Maximal degree in co-relation 186880. Up to 35409 conditions per place. [2023-08-29 20:38:19,637 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 47 selfloop transitions, 1 changer transitions 94/145 dead transitions. [2023-08-29 20:38:19,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 145 transitions, 1759 flow [2023-08-29 20:38:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-29 20:38:19,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4031746031746032 [2023-08-29 20:38:19,639 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-29 20:38:19,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-29 20:38:19,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:19,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-29 20:38:19,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-29 20:38:19,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:19,641 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:19,641 INFO L175 Difference]: Start difference. First operand has 118 places, 141 transitions, 1470 flow. Second operand 4 states and 508 transitions. [2023-08-29 20:38:19,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 145 transitions, 1759 flow [2023-08-29 20:38:22,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 1650 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-08-29 20:38:22,488 INFO L231 Difference]: Finished difference. Result has 109 places, 51 transitions, 397 flow [2023-08-29 20:38:22,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=109, PETRI_TRANSITIONS=51} [2023-08-29 20:38:22,488 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2023-08-29 20:38:22,488 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 51 transitions, 397 flow [2023-08-29 20:38:22,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:22,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:22,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:38:22,489 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:22,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 210091800, now seen corresponding path program 1 times [2023-08-29 20:38:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557159110] [2023-08-29 20:38:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557159110] [2023-08-29 20:38:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557159110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:38:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950240417] [2023-08-29 20:38:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:23,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:38:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:38:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:38:24,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-29 20:38:24,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 51 transitions, 397 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:24,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-29 20:38:24,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:24,728 INFO L130 PetriNetUnfolder]: 2548/4098 cut-off events. [2023-08-29 20:38:24,728 INFO L131 PetriNetUnfolder]: For 19322/19407 co-relation queries the response was YES. [2023-08-29 20:38:24,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14740 conditions, 4098 events. 2548/4098 cut-off events. For 19322/19407 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24049 event pairs, 1043 based on Foata normal form. 104/4170 useless extension candidates. Maximal degree in co-relation 14706. Up to 2883 conditions per place. [2023-08-29 20:38:24,753 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 56 selfloop transitions, 26 changer transitions 1/86 dead transitions. [2023-08-29 20:38:24,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 86 transitions, 764 flow [2023-08-29 20:38:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:38:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:38:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 920 transitions. [2023-08-29 20:38:24,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2023-08-29 20:38:24,755 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 920 transitions. [2023-08-29 20:38:24,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 920 transitions. [2023-08-29 20:38:24,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:24,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 920 transitions. [2023-08-29 20:38:24,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,760 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,760 INFO L175 Difference]: Start difference. First operand has 109 places, 51 transitions, 397 flow. Second operand 8 states and 920 transitions. [2023-08-29 20:38:24,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 86 transitions, 764 flow [2023-08-29 20:38:24,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 638 flow, removed 17 selfloop flow, removed 20 redundant places. [2023-08-29 20:38:24,781 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 452 flow [2023-08-29 20:38:24,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=452, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-29 20:38:24,782 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2023-08-29 20:38:24,782 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 452 flow [2023-08-29 20:38:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:24,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:24,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:38:24,783 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:24,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1542566286, now seen corresponding path program 1 times [2023-08-29 20:38:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710255802] [2023-08-29 20:38:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710255802] [2023-08-29 20:38:24,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710255802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:24,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:24,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521897206] [2023-08-29 20:38:24,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:24,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:24,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-29 20:38:24,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:24,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:24,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-29 20:38:24,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:25,516 INFO L130 PetriNetUnfolder]: 2535/4202 cut-off events. [2023-08-29 20:38:25,516 INFO L131 PetriNetUnfolder]: For 13313/13313 co-relation queries the response was YES. [2023-08-29 20:38:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15465 conditions, 4202 events. 2535/4202 cut-off events. For 13313/13313 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24945 event pairs, 989 based on Foata normal form. 107/4309 useless extension candidates. Maximal degree in co-relation 15441. Up to 2217 conditions per place. [2023-08-29 20:38:25,531 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 46 selfloop transitions, 2 changer transitions 43/92 dead transitions. [2023-08-29 20:38:25,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 891 flow [2023-08-29 20:38:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-29 20:38:25,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2023-08-29 20:38:25,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-29 20:38:25,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-29 20:38:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:25,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-29 20:38:25,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-29 20:38:25,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:25,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:25,534 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 452 flow. Second operand 3 states and 396 transitions. [2023-08-29 20:38:25,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 891 flow [2023-08-29 20:38:25,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 92 transitions, 839 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-29 20:38:25,548 INFO L231 Difference]: Finished difference. Result has 79 places, 38 transitions, 264 flow [2023-08-29 20:38:25,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=79, PETRI_TRANSITIONS=38} [2023-08-29 20:38:25,548 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-29 20:38:25,548 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 38 transitions, 264 flow [2023-08-29 20:38:25,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:25,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:25,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:25,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:38:25,549 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:25,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 724810655, now seen corresponding path program 1 times [2023-08-29 20:38:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:25,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753021859] [2023-08-29 20:38:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753021859] [2023-08-29 20:38:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753021859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611815251] [2023-08-29 20:38:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:25,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:25,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:38:25,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 38 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:25,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:25,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:38:25,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:26,118 INFO L130 PetriNetUnfolder]: 848/1507 cut-off events. [2023-08-29 20:38:26,119 INFO L131 PetriNetUnfolder]: For 4860/4860 co-relation queries the response was YES. [2023-08-29 20:38:26,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1507 events. 848/1507 cut-off events. For 4860/4860 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8112 event pairs, 156 based on Foata normal form. 169/1668 useless extension candidates. Maximal degree in co-relation 5558. Up to 892 conditions per place. [2023-08-29 20:38:26,127 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 48 selfloop transitions, 4 changer transitions 35/89 dead transitions. [2023-08-29 20:38:26,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 789 flow [2023-08-29 20:38:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-29 20:38:26,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2023-08-29 20:38:26,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-29 20:38:26,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-29 20:38:26,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:26,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-29 20:38:26,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:26,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:26,132 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:26,132 INFO L175 Difference]: Start difference. First operand has 79 places, 38 transitions, 264 flow. Second operand 5 states and 645 transitions. [2023-08-29 20:38:26,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 789 flow [2023-08-29 20:38:26,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 724 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-08-29 20:38:26,138 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 266 flow [2023-08-29 20:38:26,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2023-08-29 20:38:26,139 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2023-08-29 20:38:26,139 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 266 flow [2023-08-29 20:38:26,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:26,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:26,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:38:26,140 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:26,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash -673365644, now seen corresponding path program 1 times [2023-08-29 20:38:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:26,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867172004] [2023-08-29 20:38:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867172004] [2023-08-29 20:38:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867172004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:27,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:38:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269420099] [2023-08-29 20:38:27,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:27,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:38:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:38:27,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:38:28,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 315 [2023-08-29 20:38:28,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 107.54545454545455) internal successors, (1183), 11 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:28,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:28,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 315 [2023-08-29 20:38:28,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:28,758 INFO L130 PetriNetUnfolder]: 623/1123 cut-off events. [2023-08-29 20:38:28,758 INFO L131 PetriNetUnfolder]: For 2816/2822 co-relation queries the response was YES. [2023-08-29 20:38:28,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4827 conditions, 1123 events. 623/1123 cut-off events. For 2816/2822 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5469 event pairs, 212 based on Foata normal form. 8/1125 useless extension candidates. Maximal degree in co-relation 4807. Up to 1035 conditions per place. [2023-08-29 20:38:28,763 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 35 selfloop transitions, 15 changer transitions 3/55 dead transitions. [2023-08-29 20:38:28,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 55 transitions, 442 flow [2023-08-29 20:38:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:38:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:38:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2023-08-29 20:38:28,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353968253968254 [2023-08-29 20:38:28,764 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2023-08-29 20:38:28,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2023-08-29 20:38:28,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:28,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2023-08-29 20:38:28,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:28,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:28,767 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:28,767 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 266 flow. Second operand 8 states and 892 transitions. [2023-08-29 20:38:28,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 55 transitions, 442 flow [2023-08-29 20:38:28,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 55 transitions, 433 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:28,771 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 320 flow [2023-08-29 20:38:28,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=320, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2023-08-29 20:38:28,772 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2023-08-29 20:38:28,772 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 320 flow [2023-08-29 20:38:28,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 107.54545454545455) internal successors, (1183), 11 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:28,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:28,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:28,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:38:28,772 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:28,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -434728941, now seen corresponding path program 1 times [2023-08-29 20:38:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808848170] [2023-08-29 20:38:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:28,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808848170] [2023-08-29 20:38:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808848170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992910258] [2023-08-29 20:38:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:29,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:29,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:38:29,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 43 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:29,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:38:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:29,278 INFO L130 PetriNetUnfolder]: 431/847 cut-off events. [2023-08-29 20:38:29,278 INFO L131 PetriNetUnfolder]: For 2526/2526 co-relation queries the response was YES. [2023-08-29 20:38:29,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 847 events. 431/847 cut-off events. For 2526/2526 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4285 event pairs, 54 based on Foata normal form. 98/943 useless extension candidates. Maximal degree in co-relation 3687. Up to 329 conditions per place. [2023-08-29 20:38:29,281 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 59 selfloop transitions, 7 changer transitions 28/96 dead transitions. [2023-08-29 20:38:29,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 917 flow [2023-08-29 20:38:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:38:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:38:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-29 20:38:29,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40793650793650793 [2023-08-29 20:38:29,283 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-29 20:38:29,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-29 20:38:29,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:29,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-29 20:38:29,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,285 INFO L175 Difference]: Start difference. First operand has 77 places, 43 transitions, 320 flow. Second operand 6 states and 771 transitions. [2023-08-29 20:38:29,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 917 flow [2023-08-29 20:38:29,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 96 transitions, 877 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-29 20:38:29,288 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 348 flow [2023-08-29 20:38:29,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2023-08-29 20:38:29,289 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-29 20:38:29,289 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 348 flow [2023-08-29 20:38:29,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:29,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:29,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:38:29,290 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:29,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1019572303, now seen corresponding path program 1 times [2023-08-29 20:38:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581268584] [2023-08-29 20:38:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581268584] [2023-08-29 20:38:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581268584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:38:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053359671] [2023-08-29 20:38:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:29,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:38:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:38:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:38:29,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-29 20:38:29,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 46 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:29,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-29 20:38:29,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:29,779 INFO L130 PetriNetUnfolder]: 279/565 cut-off events. [2023-08-29 20:38:29,779 INFO L131 PetriNetUnfolder]: For 1943/1945 co-relation queries the response was YES. [2023-08-29 20:38:29,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 565 events. 279/565 cut-off events. For 1943/1945 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2631 event pairs, 48 based on Foata normal form. 24/588 useless extension candidates. Maximal degree in co-relation 2655. Up to 233 conditions per place. [2023-08-29 20:38:29,782 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 56 selfloop transitions, 10 changer transitions 13/81 dead transitions. [2023-08-29 20:38:29,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 787 flow [2023-08-29 20:38:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:38:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:38:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-29 20:38:29,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39909297052154197 [2023-08-29 20:38:29,785 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-29 20:38:29,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-29 20:38:29,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:29,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-29 20:38:29,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,792 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,792 INFO L175 Difference]: Start difference. First operand has 79 places, 46 transitions, 348 flow. Second operand 7 states and 880 transitions. [2023-08-29 20:38:29,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 787 flow [2023-08-29 20:38:29,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 721 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:38:29,798 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 330 flow [2023-08-29 20:38:29,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2023-08-29 20:38:29,799 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-29 20:38:29,799 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 330 flow [2023-08-29 20:38:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:29,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:29,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:29,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:38:29,800 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:29,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -441206942, now seen corresponding path program 1 times [2023-08-29 20:38:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754520774] [2023-08-29 20:38:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:29,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:38:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:30,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:38:30,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:38:30,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-29 20:38:30,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-29 20:38:30,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-29 20:38:30,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-29 20:38:30,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-29 20:38:30,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-29 20:38:30,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-29 20:38:30,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-29 20:38:30,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-29 20:38:30,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-29 20:38:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-29 20:38:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-29 20:38:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-29 20:38:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-29 20:38:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-29 20:38:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-29 20:38:30,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-29 20:38:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-29 20:38:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-29 20:38:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-29 20:38:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-29 20:38:30,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-29 20:38:30,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-29 20:38:30,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-29 20:38:30,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-29 20:38:30,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:38:30,122 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:30,130 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:38:30,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:38:30,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:38:30 BasicIcfg [2023-08-29 20:38:30,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:38:30,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:38:30,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:38:30,209 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:38:30,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:36:09" (3/4) ... [2023-08-29 20:38:30,211 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:38:30,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:38:30,212 INFO L158 Benchmark]: Toolchain (without parser) took 142669.26ms. Allocated memory was 65.0MB in the beginning and 14.8GB in the end (delta: 14.7GB). Free memory was 30.5MB in the beginning and 9.8GB in the end (delta: -9.8GB). Peak memory consumption was 5.0GB. Max. memory is 16.1GB. [2023-08-29 20:38:30,212 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:30,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.18ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 40.1MB in the end (delta: -9.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-08-29 20:38:30,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.11ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 58.3MB in the end (delta: -18.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-29 20:38:30,213 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:30,213 INFO L158 Benchmark]: RCFGBuilder took 1346.92ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 55.9MB in the beginning and 65.6MB in the end (delta: -9.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2023-08-29 20:38:30,214 INFO L158 Benchmark]: TraceAbstraction took 140587.20ms. Allocated memory was 104.9MB in the beginning and 14.8GB in the end (delta: 14.7GB). Free memory was 64.7MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 5.0GB. Max. memory is 16.1GB. [2023-08-29 20:38:30,214 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 14.8GB. Free memory is still 9.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:30,215 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.18ms. Allocated memory is still 65.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.18ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 40.1MB in the end (delta: -9.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.11ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 58.3MB in the end (delta: -18.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1346.92ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 55.9MB in the beginning and 65.6MB in the end (delta: -9.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * TraceAbstraction took 140587.20ms. Allocated memory was 104.9MB in the beginning and 14.8GB in the end (delta: 14.7GB). Free memory was 64.7MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 5.0GB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 14.8GB. Free memory is still 9.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6s, 176 PlacesBefore, 80 PlacesAfterwards, 168 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 34669 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9371, independent: 8735, independent conditional: 0, independent unconditional: 8735, dependent: 636, dependent conditional: 0, dependent unconditional: 636, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2783, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9371, independent: 6054, independent conditional: 0, independent unconditional: 6054, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 2783, unknown conditional: 0, unknown unconditional: 2783] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 487, Positive conditional cache size: 0, Positive unconditional cache size: 487, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=-3, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=-2, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=-1, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 140.3s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 118.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2722 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2182 mSDsluCounter, 1022 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 821 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5708 IncrementalHoareTripleChecker+Invalid, 6072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 201 mSDtfsCounter, 5708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1470occurred in iteration=19, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:38:30,247 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/safe003_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:38:32,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:38:32,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:38:33,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:38:33,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:38:33,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:38:33,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:38:33,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:38:33,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:38:33,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:38:33,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:38:33,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:38:33,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:38:33,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:38:33,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:38:33,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:38:33,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:38:33,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:38:33,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:38:33,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:38:33,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:38:33,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:38:33,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:38:33,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:38:33,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:38:33,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:38:33,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:38:33,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:38:33,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:38:33,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:38:33,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:38:33,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:38:33,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:38:33,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:38:33,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:38:33,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:38:33,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:38:33,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:38:33,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:38:33,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:38:33,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:38:33,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:38:33,102 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:38:33,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:38:33,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:38:33,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:38:33,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:38:33,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:38:33,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:38:33,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:38:33,106 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:38:33,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:38:33,107 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:38:33,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:38:33,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:38:33,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:38:33,109 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:38:33,109 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:38:33,109 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:38:33,109 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:38:33,109 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:38:33,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:38:33,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:38:33,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:38:33,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:33,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:38:33,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:38:33,111 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:38:33,111 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:38:33,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:38:33,112 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:38:33,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:38:33,112 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:38:33,112 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:38:33,112 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:38:33,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:38:33,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:38:33,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:38:33,424 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:38:33,425 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:38:33,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-29 20:38:34,560 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:38:34,834 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:38:34,835 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-29 20:38:34,859 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0510cec/aa73558e77554509b220ca677fde3674/FLAG13a6b3524 [2023-08-29 20:38:34,874 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0510cec/aa73558e77554509b220ca677fde3674 [2023-08-29 20:38:34,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:38:34,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:38:34,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:34,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:38:34,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:38:34,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:34" (1/1) ... [2023-08-29 20:38:34,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5fe78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:34, skipping insertion in model container [2023-08-29 20:38:34,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:34" (1/1) ... [2023-08-29 20:38:34,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:38:34,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:38:35,121 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/safe003_power.opt.i[951,964] [2023-08-29 20:38:35,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:35,369 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:38:35,385 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/safe003_power.opt.i[951,964] [2023-08-29 20:38:35,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:35,464 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:35,464 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:35,470 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:38:35,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35 WrapperNode [2023-08-29 20:38:35,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:35,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:35,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:38:35,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:38:35,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,514 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-08-29 20:38:35,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:35,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:38:35,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:38:35,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:38:35,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,546 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:38:35,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:38:35,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:38:35,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:38:35,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (1/1) ... [2023-08-29 20:38:35,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:38:35,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:38:35,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:38:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:38:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:38:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:38:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:38:35,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:38:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:38:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:38:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:38:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:38:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:38:35,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:38:35,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:38:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:38:35,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:38:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:38:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:38:35,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:38:35,642 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:38:35,786 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:38:35,789 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:38:36,487 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:38:37,081 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:38:37,082 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:38:37,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:37 BoogieIcfgContainer [2023-08-29 20:38:37,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:38:37,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:38:37,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:38:37,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:38:37,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:38:34" (1/3) ... [2023-08-29 20:38:37,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:37, skipping insertion in model container [2023-08-29 20:38:37,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:35" (2/3) ... [2023-08-29 20:38:37,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:37, skipping insertion in model container [2023-08-29 20:38:37,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:37" (3/3) ... [2023-08-29 20:38:37,092 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-08-29 20:38:37,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:38:37,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-29 20:38:37,108 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:38:37,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:38:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:38:37,367 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:38:37,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:37,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:38:37,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:38:37,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-29 20:38:37,389 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:38:37,402 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:38:37,406 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:38:37,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-29 20:38:37,475 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:38:37,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:37,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-29 20:38:37,481 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-29 20:38:58,548 INFO L134 LiptonReduction]: Checked pairs total: 31029 [2023-08-29 20:38:58,548 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-29 20:38:58,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:38:58,566 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;@3ea1e55d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:38:58,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-29 20:38:58,568 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:38:58,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:58,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:58,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:38:58,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:38:58,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1121, now seen corresponding path program 1 times [2023-08-29 20:38:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469494322] [2023-08-29 20:38:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:58,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:38:58,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:58,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:38:58,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:38:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:58,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:38:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:58,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:58,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469494322] [2023-08-29 20:38:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469494322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:38:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50971384] [2023-08-29 20:38:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:58,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:38:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:58,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:38:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:38:58,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 319 [2023-08-29 20:38:58,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:58,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:58,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 319 [2023-08-29 20:38:58,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:04,037 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-29 20:39:04,037 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:39:04,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3439. Compared 317073 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-29 20:39:04,305 INFO L137 encePairwiseOnDemand]: 298/319 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:39:04,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-29 20:39:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:39:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:39:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2023-08-29 20:39:04,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952978056426332 [2023-08-29 20:39:04,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2023-08-29 20:39:04,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2023-08-29 20:39:04,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:04,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2023-08-29 20:39:04,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:04,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:04,338 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:04,340 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 316 transitions. [2023-08-29 20:39:04,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-29 20:39:04,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:39:04,357 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-29 20:39:04,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 20:39:04,362 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-29 20:39:04,363 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-29 20:39:04,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:04,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:04,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:39:04,382 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-29 20:39:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:04,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:04,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 34304809, now seen corresponding path program 1 times [2023-08-29 20:39:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2349620] [2023-08-29 20:39:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:04,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:04,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:04,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:39:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:04,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:04,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:04,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2349620] [2023-08-29 20:39:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2349620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:04,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:39:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530904807] [2023-08-29 20:39:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:04,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:04,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 319 [2023-08-29 20:39:04,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:04,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:04,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 319 [2023-08-29 20:39:04,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:09,219 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-29 20:39:09,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:39:09,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3081. Compared 302963 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-29 20:39:09,415 INFO L137 encePairwiseOnDemand]: 316/319 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-29 20:39:09,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-29 20:39:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-29 20:39:09,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723092998955068 [2023-08-29 20:39:09,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-29 20:39:09,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-29 20:39:09,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:09,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-29 20:39:09,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:09,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:09,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:09,432 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 452 transitions. [2023-08-29 20:39:09,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-29 20:39:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:39:09,435 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-29 20:39:09,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 20:39:09,439 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-29 20:39:09,439 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-29 20:39:09,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:09,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:09,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:39:09,454 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 (3)] Ended with exit code 0 [2023-08-29 20:39:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:09,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:09,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450003, now seen corresponding path program 1 times [2023-08-29 20:39:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427303080] [2023-08-29 20:39:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:09,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:09,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:09,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:39:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:09,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:39:09,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:09,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:09,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427303080] [2023-08-29 20:39:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427303080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:39:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320821534] [2023-08-29 20:39:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:09,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:09,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 319 [2023-08-29 20:39:09,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:09,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:09,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 319 [2023-08-29 20:39:09,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:15,088 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-29 20:39:15,088 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-29 20:39:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4161. Compared 381975 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-29 20:39:15,409 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-29 20:39:15,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-29 20:39:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-29 20:39:15,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47335423197492166 [2023-08-29 20:39:15,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-29 20:39:15,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-29 20:39:15,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:15,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-29 20:39:15,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:15,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:15,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:15,420 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 453 transitions. [2023-08-29 20:39:15,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-29 20:39:15,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:15,424 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-29 20:39:15,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-29 20:39:15,426 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:39:15,426 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-29 20:39:15,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:15,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:15,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:39:15,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:15,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:15,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450005, now seen corresponding path program 1 times [2023-08-29 20:39:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:15,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889243154] [2023-08-29 20:39:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:15,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:15,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:39:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:15,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:15,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:15,826 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 20:39:15,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-29 20:39:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:15,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:15,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889243154] [2023-08-29 20:39:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889243154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:39:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143553015] [2023-08-29 20:39:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:15,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 319 [2023-08-29 20:39:15,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:15,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:15,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 319 [2023-08-29 20:39:15,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:18,799 INFO L130 PetriNetUnfolder]: 18173/25645 cut-off events. [2023-08-29 20:39:18,800 INFO L131 PetriNetUnfolder]: For 6146/6261 co-relation queries the response was YES. [2023-08-29 20:39:18,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 25645 events. 18173/25645 cut-off events. For 6146/6261 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 173052 event pairs, 10086 based on Foata normal form. 0/17231 useless extension candidates. Maximal degree in co-relation 58994. Up to 13595 conditions per place. [2023-08-29 20:39:18,907 INFO L137 encePairwiseOnDemand]: 308/319 looper letters, 68 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-29 20:39:18,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 347 flow [2023-08-29 20:39:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-29 20:39:18,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45245559038662486 [2023-08-29 20:39:18,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-29 20:39:18,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-29 20:39:18,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:18,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-29 20:39:18,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:18,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:18,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:18,913 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 3 states and 433 transitions. [2023-08-29 20:39:18,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 347 flow [2023-08-29 20:39:18,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:18,948 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 154 flow [2023-08-29 20:39:18,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 20:39:18,949 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 20:39:18,949 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 154 flow [2023-08-29 20:39:18,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:18,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:18,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:39:18,961 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 (5)] Ended with exit code 0 [2023-08-29 20:39:19,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:19,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:19,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450006, now seen corresponding path program 1 times [2023-08-29 20:39:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202689943] [2023-08-29 20:39:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:19,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:19,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:39:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:19,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:39:19,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:19,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:39:19,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:39:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:19,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:19,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202689943] [2023-08-29 20:39:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202689943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:39:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939109588] [2023-08-29 20:39:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:39:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:39:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:39:19,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 319 [2023-08-29 20:39:19,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:19,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:19,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 319 [2023-08-29 20:39:19,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:20,250 INFO L130 PetriNetUnfolder]: 5199/7521 cut-off events. [2023-08-29 20:39:20,250 INFO L131 PetriNetUnfolder]: For 2867/2902 co-relation queries the response was YES. [2023-08-29 20:39:20,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19250 conditions, 7521 events. 5199/7521 cut-off events. For 2867/2902 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42931 event pairs, 4639 based on Foata normal form. 1868/8235 useless extension candidates. Maximal degree in co-relation 19244. Up to 7464 conditions per place. [2023-08-29 20:39:20,431 INFO L137 encePairwiseOnDemand]: 309/319 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-29 20:39:20,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 214 flow [2023-08-29 20:39:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:39:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:39:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:39:20,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346917450365726 [2023-08-29 20:39:20,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:39:20,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:39:20,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:20,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:39:20,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:20,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:20,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:20,437 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 154 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:39:20,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 214 flow [2023-08-29 20:39:20,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:20,443 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 132 flow [2023-08-29 20:39:20,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:39:20,444 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -30 predicate places. [2023-08-29 20:39:20,444 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 132 flow [2023-08-29 20:39:20,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:20,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:20,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:20,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-29 20:39:20,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:20,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:20,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1908950064, now seen corresponding path program 1 times [2023-08-29 20:39:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327086184] [2023-08-29 20:39:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:20,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:20,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:39:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:20,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:39:20,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:20,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:20,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327086184] [2023-08-29 20:39:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327086184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:39:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10555171] [2023-08-29 20:39:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:20,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:39:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:39:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:39:20,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-29 20:39:20,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:20,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:20,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-29 20:39:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:21,547 INFO L130 PetriNetUnfolder]: 1879/3031 cut-off events. [2023-08-29 20:39:21,548 INFO L131 PetriNetUnfolder]: For 1141/1144 co-relation queries the response was YES. [2023-08-29 20:39:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 3031 events. 1879/3031 cut-off events. For 1141/1144 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17105 event pairs, 680 based on Foata normal form. 94/2714 useless extension candidates. Maximal degree in co-relation 7588. Up to 2535 conditions per place. [2023-08-29 20:39:21,560 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 56 selfloop transitions, 4 changer transitions 29/91 dead transitions. [2023-08-29 20:39:21,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 466 flow [2023-08-29 20:39:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:39:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:39:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:39:21,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419435736677116 [2023-08-29 20:39:21,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:39:21,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:39:21,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:21,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:39:21,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:21,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:21,570 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:21,571 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 132 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:39:21,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 466 flow [2023-08-29 20:39:21,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:21,573 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 171 flow [2023-08-29 20:39:21,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-29 20:39:21,574 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-29 20:39:21,574 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 171 flow [2023-08-29 20:39:21,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:21,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:21,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:21,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:21,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:21,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:21,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash -313015302, now seen corresponding path program 1 times [2023-08-29 20:39:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085394171] [2023-08-29 20:39:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:21,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:21,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:21,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:39:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:21,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:39:21,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:21,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:21,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085394171] [2023-08-29 20:39:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085394171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:39:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846896578] [2023-08-29 20:39:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:39:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:39:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:39:21,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-29 20:39:21,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:21,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:21,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-29 20:39:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:22,384 INFO L130 PetriNetUnfolder]: 456/859 cut-off events. [2023-08-29 20:39:22,384 INFO L131 PetriNetUnfolder]: For 640/643 co-relation queries the response was YES. [2023-08-29 20:39:22,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 859 events. 456/859 cut-off events. For 640/643 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3968 event pairs, 137 based on Foata normal form. 51/842 useless extension candidates. Maximal degree in co-relation 2491. Up to 329 conditions per place. [2023-08-29 20:39:22,387 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 67 selfloop transitions, 7 changer transitions 26/102 dead transitions. [2023-08-29 20:39:22,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 589 flow [2023-08-29 20:39:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:39:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:39:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-29 20:39:22,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41849529780564265 [2023-08-29 20:39:22,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-29 20:39:22,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-29 20:39:22,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:22,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-29 20:39:22,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:22,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:22,396 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:22,396 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 171 flow. Second operand 6 states and 801 transitions. [2023-08-29 20:39:22,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 589 flow [2023-08-29 20:39:22,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 581 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:39:22,401 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 223 flow [2023-08-29 20:39:22,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-29 20:39:22,402 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-29 20:39:22,402 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 223 flow [2023-08-29 20:39:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:22,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:22,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:22,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-29 20:39:22,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:22,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:22,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 751352060, now seen corresponding path program 1 times [2023-08-29 20:39:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931014006] [2023-08-29 20:39:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:22,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:22,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:39:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:22,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:39:22,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:22,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:22,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931014006] [2023-08-29 20:39:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931014006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:39:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789880627] [2023-08-29 20:39:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:22,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:39:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:39:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:39:22,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-29 20:39:22,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:22,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:22,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-29 20:39:22,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:23,213 INFO L130 PetriNetUnfolder]: 255/477 cut-off events. [2023-08-29 20:39:23,213 INFO L131 PetriNetUnfolder]: For 605/608 co-relation queries the response was YES. [2023-08-29 20:39:23,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 477 events. 255/477 cut-off events. For 605/608 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1919 event pairs, 95 based on Foata normal form. 12/481 useless extension candidates. Maximal degree in co-relation 1484. Up to 215 conditions per place. [2023-08-29 20:39:23,215 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 55 selfloop transitions, 10 changer transitions 13/80 dead transitions. [2023-08-29 20:39:23,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 495 flow [2023-08-29 20:39:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:39:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:39:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-29 20:39:23,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043887147335423 [2023-08-29 20:39:23,217 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-29 20:39:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-29 20:39:23,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:23,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-29 20:39:23,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:23,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:23,224 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:23,224 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 223 flow. Second operand 7 states and 903 transitions. [2023-08-29 20:39:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 495 flow [2023-08-29 20:39:23,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 457 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-29 20:39:23,228 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 181 flow [2023-08-29 20:39:23,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:39:23,229 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-29 20:39:23,229 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 181 flow [2023-08-29 20:39:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:23,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:23,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:23,240 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 (9)] Ended with exit code 0 [2023-08-29 20:39:23,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:23,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:23,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1925746073, now seen corresponding path program 1 times [2023-08-29 20:39:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212330130] [2023-08-29 20:39:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:23,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:23,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:23,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:39:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:23,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 20:39:23,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:23,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 20:39:25,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:39:25,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-08-29 20:39:25,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:39:25,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:39:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:25,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:25,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212330130] [2023-08-29 20:39:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212330130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:39:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607018903] [2023-08-29 20:39:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:39:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:39:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:39:25,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 319 [2023-08-29 20:39:25,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:25,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:25,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 319 [2023-08-29 20:39:25,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:26,154 INFO L130 PetriNetUnfolder]: 296/574 cut-off events. [2023-08-29 20:39:26,154 INFO L131 PetriNetUnfolder]: For 655/667 co-relation queries the response was YES. [2023-08-29 20:39:26,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 574 events. 296/574 cut-off events. For 655/667 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2646 event pairs, 47 based on Foata normal form. 3/574 useless extension candidates. Maximal degree in co-relation 1804. Up to 229 conditions per place. [2023-08-29 20:39:26,156 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 76 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2023-08-29 20:39:26,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 617 flow [2023-08-29 20:39:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:39:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:39:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-29 20:39:26,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39901477832512317 [2023-08-29 20:39:26,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-29 20:39:26,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-29 20:39:26,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:26,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-29 20:39:26,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,164 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,164 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 181 flow. Second operand 7 states and 891 transitions. [2023-08-29 20:39:26,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 617 flow [2023-08-29 20:39:26,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 525 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-29 20:39:26,168 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-08-29 20:39:26,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-29 20:39:26,169 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-29 20:39:26,169 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-08-29 20:39:26,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:26,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:26,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:26,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:26,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:26,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1362554199, now seen corresponding path program 1 times [2023-08-29 20:39:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710772459] [2023-08-29 20:39:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:39:26,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:26,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:26,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:39:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:39:26,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:39:26,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:39:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:39:26,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:39:26,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:39:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710772459] [2023-08-29 20:39:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710772459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:39:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:39:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:39:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319958451] [2023-08-29 20:39:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:39:26,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:39:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:39:26,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:39:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:39:26,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-29 20:39:26,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 124.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-29 20:39:26,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:39:26,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-29 20:39:26,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:39:26,945 INFO L130 PetriNetUnfolder]: 737/1415 cut-off events. [2023-08-29 20:39:26,945 INFO L131 PetriNetUnfolder]: For 2081/2081 co-relation queries the response was YES. [2023-08-29 20:39:26,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 1415 events. 737/1415 cut-off events. For 2081/2081 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8041 event pairs, 176 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 4925. Up to 492 conditions per place. [2023-08-29 20:39:26,950 INFO L137 encePairwiseOnDemand]: 315/319 looper letters, 134 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-08-29 20:39:26,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 140 transitions, 960 flow [2023-08-29 20:39:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:39:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:39:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-29 20:39:26,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250783699059561 [2023-08-29 20:39:26,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-29 20:39:26,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-29 20:39:26,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:39:26,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-29 20:39:26,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:39:26,956 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 5 states and 678 transitions. [2023-08-29 20:39:26,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 140 transitions, 960 flow [2023-08-29 20:39:26,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:39:26,964 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 246 flow [2023-08-29 20:39:26,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-29 20:39:26,965 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-29 20:39:26,965 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 246 flow [2023-08-29 20:39:26,966 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-29 20:39:26,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:39:26,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:26,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:39:27,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:27,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-29 20:39:27,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:39:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1824050969, now seen corresponding path program 2 times [2023-08-29 20:39:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:39:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608129767] [2023-08-29 20:39:27,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:39:27,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:39:27,179 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:39:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:39:27,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:39:27,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:39:27,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:39:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:39:27,591 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:39:27,592 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:39:27,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-29 20:39:27,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-29 20:39:27,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-29 20:39:27,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-29 20:39:27,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-29 20:39:27,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-29 20:39:27,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-29 20:39:27,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-29 20:39:27,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-29 20:39:27,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-29 20:39:27,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-29 20:39:27,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-29 20:39:27,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-29 20:39:27,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-29 20:39:27,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-29 20:39:27,621 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-29 20:39:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:39:27,819 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:39:27,823 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:39:27,823 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:39:27,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:39:27 BasicIcfg [2023-08-29 20:39:27,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:39:27,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:39:27,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:39:27,926 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:39:27,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:37" (3/4) ... [2023-08-29 20:39:27,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:39:27,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:39:27,929 INFO L158 Benchmark]: Toolchain (without parser) took 53051.64ms. Allocated memory was 81.8MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 60.8MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-08-29 20:39:27,930 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:39:27,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.89ms. Allocated memory is still 81.8MB. Free memory was 60.8MB in the beginning and 57.4MB in the end (delta: 3.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-29 20:39:27,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.77ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:39:27,933 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 52.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:39:27,933 INFO L158 Benchmark]: RCFGBuilder took 1528.29ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 52.3MB in the beginning and 38.0MB in the end (delta: 14.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2023-08-29 20:39:27,934 INFO L158 Benchmark]: TraceAbstraction took 50838.33ms. Allocated memory was 98.6MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 37.3MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-08-29 20:39:27,934 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 10.3GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:39:27,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.89ms. Allocated memory is still 81.8MB. Free memory was 60.8MB in the beginning and 57.4MB in the end (delta: 3.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.77ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 52.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1528.29ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 52.3MB in the beginning and 38.0MB in the end (delta: 14.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50838.33ms. Allocated memory was 98.6MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 37.3MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 10.3GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.1s, 177 PlacesBefore, 80 PlacesAfterwards, 169 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 31029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7519, independent: 6963, independent conditional: 0, independent unconditional: 6963, dependent: 556, dependent conditional: 0, dependent unconditional: 556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2557, independent: 2473, independent conditional: 0, independent unconditional: 2473, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7519, independent: 4490, independent conditional: 0, independent unconditional: 4490, dependent: 472, dependent conditional: 0, dependent unconditional: 472, unknown: 2557, unknown conditional: 0, unknown unconditional: 2557] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=0, t1852={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={-2147483642:0}, t1853={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=1, t1852={-2147483642:0}, t1853={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=2, t1852={-2147483642:0}, t1853={6:0}, t1854={134217731:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={-2147483642:0}, t1853={6:0}, t1854={134217731:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 227 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1717 IncrementalHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 17 mSDtfsCounter, 1717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1218 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:39:27,976 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