./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix013.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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:45:39,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:45:39,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:45:39,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:45:39,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:45:39,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:45:39,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:45:39,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:45:39,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:45:39,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:45:39,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:45:39,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:45:39,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:45:39,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:45:39,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:45:39,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:45:39,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:45:39,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:45:39,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:45:39,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:45:39,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:45:39,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:45:39,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:45:39,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:45:39,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:45:39,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:45:39,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:45:39,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:45:39,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:45:39,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:45:39,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:45:39,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:45:39,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:45:39,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:45:39,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:45:39,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:45:39,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:45:39,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:45:39,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:45:39,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:45:39,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:45:39,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:45:39,206 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:45:39,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:45:39,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:45:39,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:45:39,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:45:39,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:45:39,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:45:39,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:45:39,210 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:45:39,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:45:39,211 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:45:39,211 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:45:39,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:45:39,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:45:39,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:45:39,212 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:45:39,212 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:45:39,213 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:45:39,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:45:39,213 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:45:39,213 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:45:39,213 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:45:39,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:45:39,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:45:39,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:45:39,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:45:39,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:45:39,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:45:39,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:45:39,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:45:39,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:45:39,215 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:45:39,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:45:39,216 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:45:39,216 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 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 -> TOGETHER [2023-08-30 02:45:39,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:45:39,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:45:39,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:45:39,537 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:45:39,537 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:45:39,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 02:45:40,654 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:45:40,919 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:45:40,920 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 02:45:40,935 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d58ed7de/48c4627dd0104b888b0dca2fc8ae8a89/FLAGfb275c0ec [2023-08-30 02:45:40,947 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d58ed7de/48c4627dd0104b888b0dca2fc8ae8a89 [2023-08-30 02:45:40,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:45:40,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:45:40,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:45:40,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:45:40,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:45:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:45:40" (1/1) ... [2023-08-30 02:45:40,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72faf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:40, skipping insertion in model container [2023-08-30 02:45:40,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:45:40" (1/1) ... [2023-08-30 02:45:40,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:45:40,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:45:41,117 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/mix013.opt.i[944,957] [2023-08-30 02:45:41,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:45:41,326 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:45:41,339 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/mix013.opt.i[944,957] [2023-08-30 02:45:41,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:45:41,437 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:45:41,437 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:45:41,443 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:45:41,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41 WrapperNode [2023-08-30 02:45:41,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:45:41,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:45:41,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:45:41,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:45:41,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,514 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-30 02:45:41,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:45:41,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:45:41,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:45:41,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:45:41,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:45:41,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:45:41,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:45:41,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:45:41,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (1/1) ... [2023-08-30 02:45:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:45:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:45:41,614 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-30 02:45:41,637 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-30 02:45:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:45:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:45:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:45:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:45:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:45:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:45:41,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:45:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:45:41,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:45:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:45:41,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:45:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:45:41,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:45:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:45:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:45:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:45:41,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:45:41,655 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:45:41,824 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:45:41,826 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:45:42,218 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:45:42,363 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:45:42,364 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:45:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:45:42 BoogieIcfgContainer [2023-08-30 02:45:42,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:45:42,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:45:42,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:45:42,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:45:42,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:45:40" (1/3) ... [2023-08-30 02:45:42,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ccc26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:45:42, skipping insertion in model container [2023-08-30 02:45:42,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:45:41" (2/3) ... [2023-08-30 02:45:42,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ccc26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:45:42, skipping insertion in model container [2023-08-30 02:45:42,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:45:42" (3/3) ... [2023-08-30 02:45:42,379 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-08-30 02:45:42,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:45:42,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:45:42,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:45:42,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:45:42,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:45:42,582 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:45:42,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:45:42,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:45:42,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:45:42,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:45:42,601 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:45:42,618 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:45:42,621 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:45:42,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:45:42,668 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:45:42,668 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:45:42,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:45:42,673 INFO L119 LiptonReduction]: Number of co-enabled transitions 3170 [2023-08-30 02:45:47,138 INFO L134 LiptonReduction]: Checked pairs total: 8319 [2023-08-30 02:45:47,139 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-30 02:45:47,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:45:47,155 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;@3c1c5d03, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:45:47,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:45:47,157 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:45:47,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:45:47,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:47,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:45:47,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:47,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2023-08-30 02:45:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852535398] [2023-08-30 02:45:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:47,259 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-30 02:45:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852535398] [2023-08-30 02:45:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852535398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:45:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430087237] [2023-08-30 02:45:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:47,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:45:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:45:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:45:47,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-30 02:45:47,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:47,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:47,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-30 02:45:47,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:48,070 INFO L130 PetriNetUnfolder]: 4373/6068 cut-off events. [2023-08-30 02:45:48,071 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 02:45:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12154 conditions, 6068 events. 4373/6068 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 31956 event pairs, 4373 based on Foata normal form. 0/5338 useless extension candidates. Maximal degree in co-relation 12142. Up to 5983 conditions per place. [2023-08-30 02:45:48,119 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 02:45:48,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-30 02:45:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:45:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:45:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-30 02:45:48,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-30 02:45:48,130 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-30 02:45:48,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-30 02:45:48,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:48,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-30 02:45:48,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:48,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:48,140 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:48,142 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 295 transitions. [2023-08-30 02:45:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-30 02:45:48,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:45:48,147 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-30 02:45:48,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 02:45:48,151 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 02:45:48,152 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-30 02:45:48,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:48,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:48,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:48,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:45:48,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:48,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1540535482, now seen corresponding path program 1 times [2023-08-30 02:45:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:48,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089406038] [2023-08-30 02:45:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:48,517 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-30 02:45:48,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089406038] [2023-08-30 02:45:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089406038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:45:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845869595] [2023-08-30 02:45:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:48,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:45:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:45:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:45:48,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-30 02:45:48,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:48,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:48,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-30 02:45:48,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:49,136 INFO L130 PetriNetUnfolder]: 3632/5255 cut-off events. [2023-08-30 02:45:49,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:45:49,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 5255 events. 3632/5255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29839 event pairs, 668 based on Foata normal form. 0/4885 useless extension candidates. Maximal degree in co-relation 10342. Up to 3973 conditions per place. [2023-08-30 02:45:49,166 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-30 02:45:49,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-30 02:45:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:45:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:45:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-30 02:45:49,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017667844522968 [2023-08-30 02:45:49,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-30 02:45:49,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-30 02:45:49,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:49,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-30 02:45:49,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:49,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:49,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:49,175 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 426 transitions. [2023-08-30 02:45:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-30 02:45:49,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:45:49,177 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 02:45:49,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:45:49,178 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:45:49,178 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 02:45:49,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:49,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:49,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:49,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:45:49,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:49,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1309233259, now seen corresponding path program 1 times [2023-08-30 02:45:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579030412] [2023-08-30 02:45:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:49,464 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-30 02:45:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579030412] [2023-08-30 02:45:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579030412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:49,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:49,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:45:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777463504] [2023-08-30 02:45:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:49,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:45:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:45:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:45:49,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:45:49,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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-30 02:45:49,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:49,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:45:49,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:50,971 INFO L130 PetriNetUnfolder]: 11333/15334 cut-off events. [2023-08-30 02:45:50,972 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2023-08-30 02:45:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31499 conditions, 15334 events. 11333/15334 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 75693 event pairs, 4529 based on Foata normal form. 0/14870 useless extension candidates. Maximal degree in co-relation 31495. Up to 12359 conditions per place. [2023-08-30 02:45:51,069 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 02:45:51,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 232 flow [2023-08-30 02:45:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:45:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:45:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-30 02:45:51,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876325088339223 [2023-08-30 02:45:51,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-30 02:45:51,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-30 02:45:51,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:51,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-30 02:45:51,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:51,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:51,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:51,079 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 414 transitions. [2023-08-30 02:45:51,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 232 flow [2023-08-30 02:45:51,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:45:51,085 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2023-08-30 02:45:51,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 02:45:51,086 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-30 02:45:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2023-08-30 02:45:51,090 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-30 02:45:51,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:51,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:45:51,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:51,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1931526303, now seen corresponding path program 1 times [2023-08-30 02:45:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381263502] [2023-08-30 02:45:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:51,726 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-30 02:45:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381263502] [2023-08-30 02:45:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381263502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:45:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396947591] [2023-08-30 02:45:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:51,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:45:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:45:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:45:52,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-30 02:45:52,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:52,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:52,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-30 02:45:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:53,562 INFO L130 PetriNetUnfolder]: 7919/11539 cut-off events. [2023-08-30 02:45:53,562 INFO L131 PetriNetUnfolder]: For 3031/3059 co-relation queries the response was YES. [2023-08-30 02:45:53,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27432 conditions, 11539 events. 7919/11539 cut-off events. For 3031/3059 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 66141 event pairs, 2341 based on Foata normal form. 656/11926 useless extension candidates. Maximal degree in co-relation 27427. Up to 6710 conditions per place. [2023-08-30 02:45:53,790 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 51 selfloop transitions, 10 changer transitions 17/84 dead transitions. [2023-08-30 02:45:53,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 436 flow [2023-08-30 02:45:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:45:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:45:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-08-30 02:45:53,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336193841494195 [2023-08-30 02:45:53,800 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-08-30 02:45:53,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-08-30 02:45:53,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:53,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-08-30 02:45:53,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:53,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:53,807 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:53,807 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 7 states and 859 transitions. [2023-08-30 02:45:53,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 436 flow [2023-08-30 02:45:53,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:45:53,850 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 167 flow [2023-08-30 02:45:53,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 02:45:53,852 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-30 02:45:53,852 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 167 flow [2023-08-30 02:45:53,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:53,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:53,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:53,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:45:53,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:53,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -616364186, now seen corresponding path program 1 times [2023-08-30 02:45:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476736940] [2023-08-30 02:45:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:54,039 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-30 02:45:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476736940] [2023-08-30 02:45:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476736940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:45:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302891100] [2023-08-30 02:45:54,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:54,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:54,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:54,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:45:54,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:54,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:54,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:45:54,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:55,127 INFO L130 PetriNetUnfolder]: 8141/11118 cut-off events. [2023-08-30 02:45:55,127 INFO L131 PetriNetUnfolder]: For 3105/3105 co-relation queries the response was YES. [2023-08-30 02:45:55,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28245 conditions, 11118 events. 8141/11118 cut-off events. For 3105/3105 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 51757 event pairs, 2287 based on Foata normal form. 0/10926 useless extension candidates. Maximal degree in co-relation 28236. Up to 6473 conditions per place. [2023-08-30 02:45:55,190 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-08-30 02:45:55,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 372 flow [2023-08-30 02:45:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:45:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:45:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-30 02:45:55,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726148409893993 [2023-08-30 02:45:55,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-30 02:45:55,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-30 02:45:55,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:55,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-30 02:45:55,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:55,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:55,197 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:55,198 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 167 flow. Second operand 4 states and 535 transitions. [2023-08-30 02:45:55,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 372 flow [2023-08-30 02:45:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 356 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:45:55,237 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 216 flow [2023-08-30 02:45:55,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-30 02:45:55,240 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-30 02:45:55,240 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 216 flow [2023-08-30 02:45:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:55,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:55,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:45:55,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:55,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash -835953832, now seen corresponding path program 1 times [2023-08-30 02:45:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36235915] [2023-08-30 02:45:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:55,721 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-30 02:45:55,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:55,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36235915] [2023-08-30 02:45:55,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36235915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:55,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:45:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601388149] [2023-08-30 02:45:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:55,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:45:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:45:55,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:45:55,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 283 [2023-08-30 02:45:55,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:55,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:55,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 283 [2023-08-30 02:45:55,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:56,866 INFO L130 PetriNetUnfolder]: 5833/8639 cut-off events. [2023-08-30 02:45:56,866 INFO L131 PetriNetUnfolder]: For 5980/6046 co-relation queries the response was YES. [2023-08-30 02:45:56,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21843 conditions, 8639 events. 5833/8639 cut-off events. For 5980/6046 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48393 event pairs, 1033 based on Foata normal form. 280/8737 useless extension candidates. Maximal degree in co-relation 21833. Up to 4969 conditions per place. [2023-08-30 02:45:56,914 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 44 selfloop transitions, 8 changer transitions 14/79 dead transitions. [2023-08-30 02:45:56,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 442 flow [2023-08-30 02:45:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:45:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:45:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 02:45:56,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4321049974760222 [2023-08-30 02:45:56,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 02:45:56,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 02:45:56,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:56,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 02:45:56,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:56,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:56,924 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:56,924 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 216 flow. Second operand 7 states and 856 transitions. [2023-08-30 02:45:56,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 442 flow [2023-08-30 02:45:56,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:45:56,943 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 217 flow [2023-08-30 02:45:56,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-30 02:45:56,946 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-30 02:45:56,946 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 217 flow [2023-08-30 02:45:56,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:56,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:56,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:45:56,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:56,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1655927892, now seen corresponding path program 1 times [2023-08-30 02:45:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22540549] [2023-08-30 02:45:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:57,202 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-30 02:45:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22540549] [2023-08-30 02:45:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22540549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:45:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122284631] [2023-08-30 02:45:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:57,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:57,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-30 02:45:57,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 217 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-30 02:45:57,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:57,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-30 02:45:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:58,009 INFO L130 PetriNetUnfolder]: 4380/6552 cut-off events. [2023-08-30 02:45:58,010 INFO L131 PetriNetUnfolder]: For 4965/5085 co-relation queries the response was YES. [2023-08-30 02:45:58,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17156 conditions, 6552 events. 4380/6552 cut-off events. For 4965/5085 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 36942 event pairs, 1013 based on Foata normal form. 420/6565 useless extension candidates. Maximal degree in co-relation 17144. Up to 4445 conditions per place. [2023-08-30 02:45:58,061 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-30 02:45:58,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 519 flow [2023-08-30 02:45:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:45:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:45:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-30 02:45:58,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742049469964664 [2023-08-30 02:45:58,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-30 02:45:58,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-30 02:45:58,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:58,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-30 02:45:58,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:58,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:58,070 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:58,070 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 217 flow. Second operand 5 states and 671 transitions. [2023-08-30 02:45:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 519 flow [2023-08-30 02:45:58,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 471 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-08-30 02:45:58,084 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 266 flow [2023-08-30 02:45:58,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2023-08-30 02:45:58,085 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-30 02:45:58,085 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 266 flow [2023-08-30 02:45:58,087 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-30 02:45:58,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:58,088 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-30 02:45:58,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:45:58,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:58,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1655012406, now seen corresponding path program 1 times [2023-08-30 02:45:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039311400] [2023-08-30 02:45:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:58,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-30 02:45:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039311400] [2023-08-30 02:45:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039311400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:45:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010164206] [2023-08-30 02:45:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:58,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:58,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:45:58,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:58,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:58,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:45:58,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:59,408 INFO L130 PetriNetUnfolder]: 6495/9899 cut-off events. [2023-08-30 02:45:59,409 INFO L131 PetriNetUnfolder]: For 11621/11795 co-relation queries the response was YES. [2023-08-30 02:45:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32109 conditions, 9899 events. 6495/9899 cut-off events. For 11621/11795 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 60099 event pairs, 2328 based on Foata normal form. 110/9693 useless extension candidates. Maximal degree in co-relation 32095. Up to 4906 conditions per place. [2023-08-30 02:45:59,488 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 83 selfloop transitions, 4 changer transitions 9/106 dead transitions. [2023-08-30 02:45:59,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 106 transitions, 731 flow [2023-08-30 02:45:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:45:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:45:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-08-30 02:45:59,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49734982332155475 [2023-08-30 02:45:59,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-08-30 02:45:59,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-08-30 02:45:59,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:59,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-08-30 02:45:59,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:59,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:59,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:59,495 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 266 flow. Second operand 4 states and 563 transitions. [2023-08-30 02:45:59,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 106 transitions, 731 flow [2023-08-30 02:45:59,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 719 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:45:59,512 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 274 flow [2023-08-30 02:45:59,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=261, 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-30 02:45:59,513 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-30 02:45:59,513 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 274 flow [2023-08-30 02:45:59,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:59,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:59,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:59,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:45:59,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:59,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1756845202, now seen corresponding path program 1 times [2023-08-30 02:45:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:45:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814737442] [2023-08-30 02:45:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:45:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:59,780 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-30 02:45:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:45:59,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814737442] [2023-08-30 02:45:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814737442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:45:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598390425] [2023-08-30 02:45:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:59,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:45:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:45:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:45:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:45:59,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-30 02:45:59,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:59,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:59,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-30 02:45:59,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:00,718 INFO L130 PetriNetUnfolder]: 3826/6085 cut-off events. [2023-08-30 02:46:00,718 INFO L131 PetriNetUnfolder]: For 6577/7022 co-relation queries the response was YES. [2023-08-30 02:46:00,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19853 conditions, 6085 events. 3826/6085 cut-off events. For 6577/7022 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 37355 event pairs, 607 based on Foata normal form. 486/6193 useless extension candidates. Maximal degree in co-relation 19837. Up to 2296 conditions per place. [2023-08-30 02:46:00,785 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 82 selfloop transitions, 16 changer transitions 0/113 dead transitions. [2023-08-30 02:46:00,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 731 flow [2023-08-30 02:46:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2023-08-30 02:46:00,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729934376577486 [2023-08-30 02:46:00,789 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 937 transitions. [2023-08-30 02:46:00,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 937 transitions. [2023-08-30 02:46:00,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:00,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 937 transitions. [2023-08-30 02:46:00,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:00,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:00,796 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:00,796 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 274 flow. Second operand 7 states and 937 transitions. [2023-08-30 02:46:00,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 731 flow [2023-08-30 02:46:00,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:00,812 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 398 flow [2023-08-30 02:46:00,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2023-08-30 02:46:00,813 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-30 02:46:00,813 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 398 flow [2023-08-30 02:46:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:00,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:00,814 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-30 02:46:00,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:46:00,814 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:00,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2010712576, now seen corresponding path program 1 times [2023-08-30 02:46:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017615907] [2023-08-30 02:46:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:01,093 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-30 02:46:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017615907] [2023-08-30 02:46:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017615907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795345709] [2023-08-30 02:46:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:01,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:01,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-30 02:46:01,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 398 flow. Second operand has 6 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-30 02:46:01,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:01,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-30 02:46:01,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:01,712 INFO L130 PetriNetUnfolder]: 3105/4957 cut-off events. [2023-08-30 02:46:01,713 INFO L131 PetriNetUnfolder]: For 8970/10095 co-relation queries the response was YES. [2023-08-30 02:46:01,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19220 conditions, 4957 events. 3105/4957 cut-off events. For 8970/10095 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30127 event pairs, 404 based on Foata normal form. 343/4991 useless extension candidates. Maximal degree in co-relation 19201. Up to 1907 conditions per place. [2023-08-30 02:46:01,746 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 89 selfloop transitions, 25 changer transitions 9/138 dead transitions. [2023-08-30 02:46:01,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1002 flow [2023-08-30 02:46:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:46:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:46:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1204 transitions. [2023-08-30 02:46:01,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47271299568119357 [2023-08-30 02:46:01,750 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1204 transitions. [2023-08-30 02:46:01,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1204 transitions. [2023-08-30 02:46:01,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:01,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1204 transitions. [2023-08-30 02:46:01,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:01,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:01,757 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:01,757 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 398 flow. Second operand 9 states and 1204 transitions. [2023-08-30 02:46:01,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1002 flow [2023-08-30 02:46:01,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 955 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:01,922 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 523 flow [2023-08-30 02:46:01,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=523, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-08-30 02:46:01,923 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-30 02:46:01,923 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 523 flow [2023-08-30 02:46:01,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-30 02:46:01,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:01,924 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-30 02:46:01,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:46:01,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:01,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1186202442, now seen corresponding path program 1 times [2023-08-30 02:46:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606875285] [2023-08-30 02:46:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:02,156 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-30 02:46:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:02,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606875285] [2023-08-30 02:46:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606875285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889620220] [2023-08-30 02:46:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:02,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:02,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:02,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-30 02:46:02,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:02,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:02,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-30 02:46:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:03,115 INFO L130 PetriNetUnfolder]: 5367/8170 cut-off events. [2023-08-30 02:46:03,115 INFO L131 PetriNetUnfolder]: For 23510/23510 co-relation queries the response was YES. [2023-08-30 02:46:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33309 conditions, 8170 events. 5367/8170 cut-off events. For 23510/23510 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 46678 event pairs, 406 based on Foata normal form. 10/8180 useless extension candidates. Maximal degree in co-relation 33287. Up to 5155 conditions per place. [2023-08-30 02:46:03,188 INFO L137 encePairwiseOnDemand]: 273/283 looper letters, 105 selfloop transitions, 25 changer transitions 34/164 dead transitions. [2023-08-30 02:46:03,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 164 transitions, 1586 flow [2023-08-30 02:46:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-30 02:46:03,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47491166077738517 [2023-08-30 02:46:03,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-30 02:46:03,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-30 02:46:03,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:03,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-30 02:46:03,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:03,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:03,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:03,198 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 523 flow. Second operand 5 states and 672 transitions. [2023-08-30 02:46:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 164 transitions, 1586 flow [2023-08-30 02:46:03,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 164 transitions, 1335 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:03,564 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 528 flow [2023-08-30 02:46:03,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-30 02:46:03,565 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-30 02:46:03,565 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 528 flow [2023-08-30 02:46:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:03,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:03,566 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-30 02:46:03,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:46:03,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:03,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash -649068430, now seen corresponding path program 2 times [2023-08-30 02:46:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363879733] [2023-08-30 02:46:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:03,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:03,841 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-30 02:46:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363879733] [2023-08-30 02:46:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363879733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:46:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218307452] [2023-08-30 02:46:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:03,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:03,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:03,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-30 02:46:03,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:03,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:03,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-30 02:46:03,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:04,318 INFO L130 PetriNetUnfolder]: 1862/3006 cut-off events. [2023-08-30 02:46:04,318 INFO L131 PetriNetUnfolder]: For 5917/6299 co-relation queries the response was YES. [2023-08-30 02:46:04,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 3006 events. 1862/3006 cut-off events. For 5917/6299 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16900 event pairs, 290 based on Foata normal form. 176/3051 useless extension candidates. Maximal degree in co-relation 11319. Up to 1105 conditions per place. [2023-08-30 02:46:04,342 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 72 selfloop transitions, 18 changer transitions 11/120 dead transitions. [2023-08-30 02:46:04,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 985 flow [2023-08-30 02:46:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:46:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:46:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1051 transitions. [2023-08-30 02:46:04,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642226148409894 [2023-08-30 02:46:04,346 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1051 transitions. [2023-08-30 02:46:04,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1051 transitions. [2023-08-30 02:46:04,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:04,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1051 transitions. [2023-08-30 02:46:04,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:04,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:04,353 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:04,353 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 528 flow. Second operand 8 states and 1051 transitions. [2023-08-30 02:46:04,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 985 flow [2023-08-30 02:46:04,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 120 transitions, 895 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-08-30 02:46:04,407 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 477 flow [2023-08-30 02:46:04,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=477, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-08-30 02:46:04,409 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-30 02:46:04,409 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 477 flow [2023-08-30 02:46:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:04,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:04,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:04,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:46:04,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:04,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -352379513, now seen corresponding path program 1 times [2023-08-30 02:46:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:04,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97815142] [2023-08-30 02:46:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:04,670 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-30 02:46:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97815142] [2023-08-30 02:46:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97815142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534442663] [2023-08-30 02:46:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:04,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-30 02:46:04,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 477 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-30 02:46:04,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-30 02:46:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:05,220 INFO L130 PetriNetUnfolder]: 2999/4608 cut-off events. [2023-08-30 02:46:05,220 INFO L131 PetriNetUnfolder]: For 12203/12203 co-relation queries the response was YES. [2023-08-30 02:46:05,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19182 conditions, 4608 events. 2999/4608 cut-off events. For 12203/12203 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23766 event pairs, 656 based on Foata normal form. 1/4609 useless extension candidates. Maximal degree in co-relation 19161. Up to 3351 conditions per place. [2023-08-30 02:46:05,251 INFO L137 encePairwiseOnDemand]: 273/283 looper letters, 112 selfloop transitions, 33 changer transitions 3/148 dead transitions. [2023-08-30 02:46:05,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 148 transitions, 1325 flow [2023-08-30 02:46:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-30 02:46:05,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742049469964664 [2023-08-30 02:46:05,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-30 02:46:05,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-30 02:46:05,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:05,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-30 02:46:05,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:05,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:05,259 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:05,259 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 477 flow. Second operand 5 states and 671 transitions. [2023-08-30 02:46:05,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 148 transitions, 1325 flow [2023-08-30 02:46:05,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 148 transitions, 1174 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-08-30 02:46:05,318 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 671 flow [2023-08-30 02:46:05,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=671, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2023-08-30 02:46:05,320 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-30 02:46:05,320 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 671 flow [2023-08-30 02:46:05,320 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-30 02:46:05,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:05,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:05,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:46:05,321 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:05,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash -921380499, now seen corresponding path program 2 times [2023-08-30 02:46:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106555396] [2023-08-30 02:46:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:05,575 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-30 02:46:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106555396] [2023-08-30 02:46:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106555396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586102583] [2023-08-30 02:46:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:05,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:46:05,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 671 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:05,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:05,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:46:05,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:06,002 INFO L130 PetriNetUnfolder]: 2714/4481 cut-off events. [2023-08-30 02:46:06,002 INFO L131 PetriNetUnfolder]: For 10797/11078 co-relation queries the response was YES. [2023-08-30 02:46:06,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17798 conditions, 4481 events. 2714/4481 cut-off events. For 10797/11078 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27251 event pairs, 593 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 17778. Up to 2188 conditions per place. [2023-08-30 02:46:06,032 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 103 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2023-08-30 02:46:06,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 1179 flow [2023-08-30 02:46:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-08-30 02:46:06,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929328621908127 [2023-08-30 02:46:06,035 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-08-30 02:46:06,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-08-30 02:46:06,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:06,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-08-30 02:46:06,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,039 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 671 flow. Second operand 4 states and 558 transitions. [2023-08-30 02:46:06,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 1179 flow [2023-08-30 02:46:06,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 134 transitions, 1173 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:06,123 INFO L231 Difference]: Finished difference. Result has 75 places, 82 transitions, 679 flow [2023-08-30 02:46:06,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2023-08-30 02:46:06,124 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-30 02:46:06,124 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 679 flow [2023-08-30 02:46:06,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:06,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:06,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:46:06,125 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:06,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -343155101, now seen corresponding path program 3 times [2023-08-30 02:46:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083362660] [2023-08-30 02:46:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:06,363 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-30 02:46:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083362660] [2023-08-30 02:46:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083362660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563602299] [2023-08-30 02:46:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:06,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-30 02:46:06,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 679 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:06,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:06,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-30 02:46:06,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:07,086 INFO L130 PetriNetUnfolder]: 4181/6515 cut-off events. [2023-08-30 02:46:07,086 INFO L131 PetriNetUnfolder]: For 20187/20187 co-relation queries the response was YES. [2023-08-30 02:46:07,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27380 conditions, 6515 events. 4181/6515 cut-off events. For 20187/20187 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37406 event pairs, 491 based on Foata normal form. 1/6516 useless extension candidates. Maximal degree in co-relation 27359. Up to 3217 conditions per place. [2023-08-30 02:46:07,125 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 127 selfloop transitions, 27 changer transitions 0/154 dead transitions. [2023-08-30 02:46:07,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 1435 flow [2023-08-30 02:46:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2023-08-30 02:46:07,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652532391048292 [2023-08-30 02:46:07,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 790 transitions. [2023-08-30 02:46:07,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions. [2023-08-30 02:46:07,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:07,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions. [2023-08-30 02:46:07,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,133 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 679 flow. Second operand 6 states and 790 transitions. [2023-08-30 02:46:07,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 1435 flow [2023-08-30 02:46:07,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 1430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:46:07,284 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 780 flow [2023-08-30 02:46:07,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-08-30 02:46:07,284 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-30 02:46:07,284 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 780 flow [2023-08-30 02:46:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:07,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:07,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:07,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:46:07,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:07,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2131262567, now seen corresponding path program 4 times [2023-08-30 02:46:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474518533] [2023-08-30 02:46:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:08,119 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-30 02:46:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:46:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474518533] [2023-08-30 02:46:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474518533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252413924] [2023-08-30 02:46:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:08,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:46:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:08,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:46:08,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 780 flow. Second operand has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:08,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:46:08,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:08,809 INFO L130 PetriNetUnfolder]: 3407/5837 cut-off events. [2023-08-30 02:46:08,809 INFO L131 PetriNetUnfolder]: For 16336/16821 co-relation queries the response was YES. [2023-08-30 02:46:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23803 conditions, 5837 events. 3407/5837 cut-off events. For 16336/16821 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 39350 event pairs, 442 based on Foata normal form. 41/5710 useless extension candidates. Maximal degree in co-relation 23780. Up to 1726 conditions per place. [2023-08-30 02:46:08,853 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 110 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2023-08-30 02:46:08,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 155 transitions, 1502 flow [2023-08-30 02:46:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:46:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:46:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1056 transitions. [2023-08-30 02:46:08,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4664310954063604 [2023-08-30 02:46:08,857 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1056 transitions. [2023-08-30 02:46:08,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1056 transitions. [2023-08-30 02:46:08,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:08,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1056 transitions. [2023-08-30 02:46:08,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,863 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:08,864 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 780 flow. Second operand 8 states and 1056 transitions. [2023-08-30 02:46:08,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 155 transitions, 1502 flow [2023-08-30 02:46:09,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1443 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:46:09,003 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 800 flow [2023-08-30 02:46:09,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=800, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-08-30 02:46:09,003 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-30 02:46:09,003 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 800 flow [2023-08-30 02:46:09,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:09,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:09,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:09,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:46:09,005 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:09,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1553806569, now seen corresponding path program 5 times [2023-08-30 02:46:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:46:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188211661] [2023-08-30 02:46:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:46:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:09,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:46:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:09,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:46:09,108 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:46:09,109 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:46:09,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:46:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:46:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:46:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:46:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:46:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:46:09,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:46:09,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:46:09,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:46:09,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:46:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:46:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:46:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:46:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:46:09,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:46:09,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:46:09,115 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:09,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:46:09,120 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:46:09,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:46:09 BasicIcfg [2023-08-30 02:46:09,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:46:09,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:46:09,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:46:09,185 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:46:09,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:45:42" (3/4) ... [2023-08-30 02:46:09,188 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:46:09,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:46:09,189 INFO L158 Benchmark]: Toolchain (without parser) took 28238.12ms. Allocated memory was 88.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 64.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 674.9MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,189 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:09,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.91ms. Allocated memory is still 88.1MB. Free memory was 64.5MB in the beginning and 61.7MB in the end (delta: 2.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.16ms. Allocated memory is still 88.1MB. Free memory was 61.7MB in the beginning and 59.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,189 INFO L158 Benchmark]: Boogie Preprocessor took 60.64ms. Allocated memory is still 88.1MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,190 INFO L158 Benchmark]: RCFGBuilder took 784.69ms. Allocated memory is still 88.1MB. Free memory was 56.6MB in the beginning and 46.8MB in the end (delta: 9.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,190 INFO L158 Benchmark]: TraceAbstraction took 26815.07ms. Allocated memory was 88.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 46.3MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 655.0MB. Max. memory is 16.1GB. [2023-08-30 02:46:09,190 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 2.8GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:09,192 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.19ms. Allocated memory is still 65.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.91ms. Allocated memory is still 88.1MB. Free memory was 64.5MB in the beginning and 61.7MB in the end (delta: 2.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.16ms. Allocated memory is still 88.1MB. Free memory was 61.7MB in the beginning and 59.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.64ms. Allocated memory is still 88.1MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 784.69ms. Allocated memory is still 88.1MB. Free memory was 56.6MB in the beginning and 46.8MB in the end (delta: 9.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26815.07ms. Allocated memory was 88.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 46.3MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 655.0MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 2.8GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 150 PlacesBefore, 51 PlacesAfterwards, 139 TransitionsBefore, 39 TransitionsAfterwards, 3170 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 8319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4565, independent: 4351, independent conditional: 0, independent unconditional: 4351, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1737, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4565, independent: 2653, independent conditional: 0, independent unconditional: 2653, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1737, unknown conditional: 0, unknown unconditional: 1737] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-4, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=-3, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=-2, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=-1, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1052 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3170 IncrementalHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 133 mSDtfsCounter, 3170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=16, InterpolantAutomatonStates: 87, 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.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-30 02:46:09,222 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/mix013.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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:46:11,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:46:11,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:46:11,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:46:11,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:46:11,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:46:11,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:46:11,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:46:11,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:46:11,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:46:11,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:46:11,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:46:11,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:46:11,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:46:11,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:46:11,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:46:11,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:46:11,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:46:11,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:46:11,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:46:11,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:46:11,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:46:11,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:46:11,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:46:11,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:46:11,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:46:11,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:46:11,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:46:11,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:46:11,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:46:11,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:46:11,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:46:11,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:46:11,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:46:11,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:46:11,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:46:11,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:46:11,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:46:11,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:46:11,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:46:11,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:46:11,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:46:11,536 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:46:11,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:46:11,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:46:11,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:46:11,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:46:11,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:46:11,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:46:11,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:46:11,541 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:46:11,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:46:11,542 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:46:11,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:46:11,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:46:11,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:46:11,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:46:11,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:46:11,544 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:46:11,544 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:46:11,544 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:46:11,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:46:11,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:46:11,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:46:11,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:46:11,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:46:11,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:46:11,546 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:46:11,546 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:46:11,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:46:11,547 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:46:11,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:46:11,547 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:46:11,547 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:46:11,547 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 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 -> TOGETHER [2023-08-30 02:46:11,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:46:11,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:46:11,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:46:11,881 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:46:11,881 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:46:11,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 02:46:13,147 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:46:13,407 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:46:13,408 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 02:46:13,432 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a69ffd9/24b34d7333ce4c6db32ad1163f7350da/FLAGd0071aa49 [2023-08-30 02:46:13,467 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a69ffd9/24b34d7333ce4c6db32ad1163f7350da [2023-08-30 02:46:13,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:46:13,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:46:13,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:13,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:46:13,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:46:13,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:13,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6540b89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13, skipping insertion in model container [2023-08-30 02:46:13,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:13,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:46:13,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:46:13,674 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/mix013.opt.i[944,957] [2023-08-30 02:46:13,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:13,867 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:46:13,880 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/mix013.opt.i[944,957] [2023-08-30 02:46:13,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:46:13,985 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:13,985 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:46:13,991 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:46:13,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13 WrapperNode [2023-08-30 02:46:13,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:46:13,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:13,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:46:13,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:46:14,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,065 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-30 02:46:14,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:46:14,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:46:14,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:46:14,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:46:14,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,106 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:46:14,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:46:14,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:46:14,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:46:14,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (1/1) ... [2023-08-30 02:46:14,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:46:14,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:46:14,154 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-30 02:46:14,161 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-30 02:46:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:46:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:46:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:46:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:46:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:46:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:46:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:46:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:46:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:46:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:46:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:46:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:46:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:46:14,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:46:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:46:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:46:14,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:46:14,193 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:46:14,402 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:46:14,404 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:46:14,771 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:46:14,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:46:14,878 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:46:14,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:14 BoogieIcfgContainer [2023-08-30 02:46:14,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:46:14,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:46:14,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:46:14,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:46:14,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:46:13" (1/3) ... [2023-08-30 02:46:14,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c13ea87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:14, skipping insertion in model container [2023-08-30 02:46:14,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:46:13" (2/3) ... [2023-08-30 02:46:14,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c13ea87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:46:14, skipping insertion in model container [2023-08-30 02:46:14,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:14" (3/3) ... [2023-08-30 02:46:14,888 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-08-30 02:46:14,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:46:14,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:46:14,904 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:46:14,958 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:46:14,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:46:15,048 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:46:15,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:15,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:46:15,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:46:15,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-30 02:46:15,060 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:46:15,068 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:46:15,071 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:46:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-30 02:46:15,101 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:46:15,101 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:15,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:46:15,104 INFO L119 LiptonReduction]: Number of co-enabled transitions 3170 [2023-08-30 02:46:22,273 INFO L134 LiptonReduction]: Checked pairs total: 8156 [2023-08-30 02:46:22,273 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-30 02:46:22,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:46:22,291 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;@6904915e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:46:22,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:46:22,293 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:46:22,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:22,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:22,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:46:22,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:22,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash 619, now seen corresponding path program 1 times [2023-08-30 02:46:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:22,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867850052] [2023-08-30 02:46:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:22,310 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-30 02:46:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:22,318 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-30 02:46:22,319 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-30 02:46:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:22,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:46:22,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:22,407 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-30 02:46:22,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:22,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:22,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867850052] [2023-08-30 02:46:22,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867850052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:46:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236699538] [2023-08-30 02:46:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:46:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:46:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:46:22,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 283 [2023-08-30 02:46:22,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:22,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:22,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 283 [2023-08-30 02:46:22,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:23,268 INFO L130 PetriNetUnfolder]: 3743/5222 cut-off events. [2023-08-30 02:46:23,269 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 02:46:23,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10462 conditions, 5222 events. 3743/5222 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 27229 event pairs, 3743 based on Foata normal form. 0/4528 useless extension candidates. Maximal degree in co-relation 10450. Up to 5137 conditions per place. [2023-08-30 02:46:23,308 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:46:23,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-30 02:46:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:46:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:46:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-30 02:46:23,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-30 02:46:23,331 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-30 02:46:23,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-30 02:46:23,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:23,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-30 02:46:23,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,347 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,348 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 295 transitions. [2023-08-30 02:46:23,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-30 02:46:23,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:23,358 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:46:23,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:46:23,374 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:46:23,375 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:46:23,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:23,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:23,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:23,584 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-30 02:46:23,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:23,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash 516194959, now seen corresponding path program 1 times [2023-08-30 02:46:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729227075] [2023-08-30 02:46:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:23,591 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-30 02:46:23,594 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-30 02:46:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:23,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:46:23,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:23,745 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-30 02:46:23,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:23,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729227075] [2023-08-30 02:46:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729227075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:46:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920772748] [2023-08-30 02:46:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:23,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:46:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:23,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:46:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:46:23,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-30 02:46:23,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:23,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:23,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-30 02:46:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:24,321 INFO L130 PetriNetUnfolder]: 3113/4520 cut-off events. [2023-08-30 02:46:24,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:46:24,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8911 conditions, 4520 events. 3113/4520 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 25101 event pairs, 593 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 8908. Up to 3385 conditions per place. [2023-08-30 02:46:24,347 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-30 02:46:24,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-08-30 02:46:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:46:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:46:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-30 02:46:24,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502944640753828 [2023-08-30 02:46:24,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-30 02:46:24,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-30 02:46:24,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:24,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-30 02:46:24,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,357 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 427 transitions. [2023-08-30 02:46:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-08-30 02:46:24,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:46:24,359 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:46:24,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:46:24,360 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:46:24,360 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:46:24,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:24,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:24,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:24,575 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-30 02:46:24,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:24,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2142179238, now seen corresponding path program 1 times [2023-08-30 02:46:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536456276] [2023-08-30 02:46:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:24,578 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-30 02:46:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:24,579 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-30 02:46:24,582 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-30 02:46:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:24,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:46:24,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:24,730 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-30 02:46:24,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:24,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:24,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536456276] [2023-08-30 02:46:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536456276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:24,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:24,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052965192] [2023-08-30 02:46:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:24,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-30 02:46:24,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:24,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:24,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-30 02:46:24,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:25,185 INFO L130 PetriNetUnfolder]: 2213/3232 cut-off events. [2023-08-30 02:46:25,185 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2023-08-30 02:46:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6701 conditions, 3232 events. 2213/3232 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16764 event pairs, 263 based on Foata normal form. 180/3273 useless extension candidates. Maximal degree in co-relation 6697. Up to 1837 conditions per place. [2023-08-30 02:46:25,200 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 45 selfloop transitions, 6 changer transitions 1/56 dead transitions. [2023-08-30 02:46:25,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 238 flow [2023-08-30 02:46:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-30 02:46:25,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48586572438162545 [2023-08-30 02:46:25,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-30 02:46:25,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-30 02:46:25,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:25,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-30 02:46:25,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,208 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 4 states and 550 transitions. [2023-08-30 02:46:25,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 238 flow [2023-08-30 02:46:25,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:25,210 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 104 flow [2023-08-30 02:46:25,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-30 02:46:25,211 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-08-30 02:46:25,212 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 104 flow [2023-08-30 02:46:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:25,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:25,222 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-30 02:46:25,421 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-30 02:46:25,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:25,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2032120214, now seen corresponding path program 1 times [2023-08-30 02:46:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659728348] [2023-08-30 02:46:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:25,424 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-30 02:46:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:25,425 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-30 02:46:25,428 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-30 02:46:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:25,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:25,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:25,572 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-30 02:46:25,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:25,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659728348] [2023-08-30 02:46:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659728348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:25,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:25,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156453154] [2023-08-30 02:46:25,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:25,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:46:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:46:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:46:25,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-30 02:46:25,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:25,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-30 02:46:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:25,963 INFO L130 PetriNetUnfolder]: 1185/1840 cut-off events. [2023-08-30 02:46:25,963 INFO L131 PetriNetUnfolder]: For 619/626 co-relation queries the response was YES. [2023-08-30 02:46:25,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4811 conditions, 1840 events. 1185/1840 cut-off events. For 619/626 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8971 event pairs, 121 based on Foata normal form. 136/1913 useless extension candidates. Maximal degree in co-relation 4805. Up to 621 conditions per place. [2023-08-30 02:46:25,975 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 56 selfloop transitions, 10 changer transitions 1/71 dead transitions. [2023-08-30 02:46:25,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 347 flow [2023-08-30 02:46:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:46:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:46:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-30 02:46:25,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48692579505300354 [2023-08-30 02:46:25,978 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-30 02:46:25,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-30 02:46:25,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:25,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-30 02:46:25,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,984 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 104 flow. Second operand 5 states and 689 transitions. [2023-08-30 02:46:25,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 347 flow [2023-08-30 02:46:25,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 336 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:25,988 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 156 flow [2023-08-30 02:46:25,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-30 02:46:25,989 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-30 02:46:25,989 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 156 flow [2023-08-30 02:46:25,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:25,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:25,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:26,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:26,205 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-30 02:46:26,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:26,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 98879549, now seen corresponding path program 1 times [2023-08-30 02:46:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122464606] [2023-08-30 02:46:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:26,207 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-30 02:46:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:26,208 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-30 02:46:26,211 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-30 02:46:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:26,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:46:26,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:46:26,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:26,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122464606] [2023-08-30 02:46:26,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122464606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:26,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:26,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104517178] [2023-08-30 02:46:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:26,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:26,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-30 02:46:26,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:26,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:26,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-30 02:46:26,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:26,748 INFO L130 PetriNetUnfolder]: 649/1052 cut-off events. [2023-08-30 02:46:26,748 INFO L131 PetriNetUnfolder]: For 1054/1068 co-relation queries the response was YES. [2023-08-30 02:46:26,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1052 events. 649/1052 cut-off events. For 1054/1068 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4576 event pairs, 119 based on Foata normal form. 64/1097 useless extension candidates. Maximal degree in co-relation 3236. Up to 347 conditions per place. [2023-08-30 02:46:26,755 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 65 selfloop transitions, 14 changer transitions 1/84 dead transitions. [2023-08-30 02:46:26,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 462 flow [2023-08-30 02:46:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-30 02:46:26,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48645465253239106 [2023-08-30 02:46:26,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-30 02:46:26,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-30 02:46:26,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:26,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-30 02:46:26,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:26,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:26,765 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:26,765 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 156 flow. Second operand 6 states and 826 transitions. [2023-08-30 02:46:26,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 462 flow [2023-08-30 02:46:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 432 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:26,778 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 206 flow [2023-08-30 02:46:26,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-30 02:46:26,780 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-30 02:46:26,781 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 206 flow [2023-08-30 02:46:26,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:26,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:26,783 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-30 02:46:26,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:26,993 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-30 02:46:26,994 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:26,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2008842637, now seen corresponding path program 1 times [2023-08-30 02:46:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87478779] [2023-08-30 02:46:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:26,995 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-30 02:46:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:26,996 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-30 02:46:26,999 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-30 02:46:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:27,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:46:27,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:27,185 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-30 02:46:27,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:27,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87478779] [2023-08-30 02:46:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87478779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:27,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:27,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:46:27,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62306061] [2023-08-30 02:46:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:27,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:27,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-30 02:46:27,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:27,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:27,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-30 02:46:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:27,572 INFO L130 PetriNetUnfolder]: 528/843 cut-off events. [2023-08-30 02:46:27,572 INFO L131 PetriNetUnfolder]: For 973/987 co-relation queries the response was YES. [2023-08-30 02:46:27,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 843 events. 528/843 cut-off events. For 973/987 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3522 event pairs, 119 based on Foata normal form. 20/855 useless extension candidates. Maximal degree in co-relation 2686. Up to 340 conditions per place. [2023-08-30 02:46:27,579 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 50 selfloop transitions, 18 changer transitions 1/73 dead transitions. [2023-08-30 02:46:27,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 428 flow [2023-08-30 02:46:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 02:46:27,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47400302877334677 [2023-08-30 02:46:27,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 02:46:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 02:46:27,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:27,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 02:46:27,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:27,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:27,589 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:27,589 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 206 flow. Second operand 7 states and 939 transitions. [2023-08-30 02:46:27,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 428 flow [2023-08-30 02:46:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 382 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-30 02:46:27,596 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 216 flow [2023-08-30 02:46:27,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-30 02:46:27,597 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-30 02:46:27,597 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 216 flow [2023-08-30 02:46:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:27,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:27,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:27,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:27,808 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-30 02:46:27,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:27,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 758699683, now seen corresponding path program 1 times [2023-08-30 02:46:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405279671] [2023-08-30 02:46:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:27,810 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-30 02:46:27,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:27,811 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-30 02:46:27,812 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-30 02:46:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:28,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:46:28,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:28,602 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-30 02:46:28,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:28,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405279671] [2023-08-30 02:46:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405279671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:28,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:46:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719759417] [2023-08-30 02:46:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:46:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:46:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:46:28,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 283 [2023-08-30 02:46:28,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:28,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:28,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 283 [2023-08-30 02:46:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:29,309 INFO L130 PetriNetUnfolder]: 518/839 cut-off events. [2023-08-30 02:46:29,310 INFO L131 PetriNetUnfolder]: For 1375/1379 co-relation queries the response was YES. [2023-08-30 02:46:29,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 839 events. 518/839 cut-off events. For 1375/1379 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3996 event pairs, 8 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 2595. Up to 669 conditions per place. [2023-08-30 02:46:29,317 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-30 02:46:29,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 450 flow [2023-08-30 02:46:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:46:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:46:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-08-30 02:46:29,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134275618374558 [2023-08-30 02:46:29,320 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-08-30 02:46:29,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-08-30 02:46:29,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:29,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-08-30 02:46:29,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:29,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:29,325 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:29,325 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 216 flow. Second operand 6 states and 702 transitions. [2023-08-30 02:46:29,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 450 flow [2023-08-30 02:46:29,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 296 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-30 02:46:29,328 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 124 flow [2023-08-30 02:46:29,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-30 02:46:29,329 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-30 02:46:29,329 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 124 flow [2023-08-30 02:46:29,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:29,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:29,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:29,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:29,540 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-30 02:46:29,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:29,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2122147212, now seen corresponding path program 1 times [2023-08-30 02:46:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551861028] [2023-08-30 02:46:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:46:29,542 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-30 02:46:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:29,543 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-30 02:46:29,547 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-30 02:46:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:46:29,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:29,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:29,710 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-30 02:46:29,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:29,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:29,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551861028] [2023-08-30 02:46:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551861028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:29,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822778816] [2023-08-30 02:46:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:29,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:29,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:29,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:29,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:29,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-30 02:46:29,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:29,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:29,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-30 02:46:29,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:29,986 INFO L130 PetriNetUnfolder]: 909/1594 cut-off events. [2023-08-30 02:46:29,986 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2023-08-30 02:46:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 1594 events. 909/1594 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8871 event pairs, 167 based on Foata normal form. 1/1595 useless extension candidates. Maximal degree in co-relation 3697. Up to 739 conditions per place. [2023-08-30 02:46:29,998 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 52 selfloop transitions, 1 changer transitions 29/85 dead transitions. [2023-08-30 02:46:29,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 446 flow [2023-08-30 02:46:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-30 02:46:30,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495583038869258 [2023-08-30 02:46:30,001 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-30 02:46:30,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-30 02:46:30,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:30,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-30 02:46:30,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,005 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,005 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 124 flow. Second operand 4 states and 561 transitions. [2023-08-30 02:46:30,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 446 flow [2023-08-30 02:46:30,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 85 transitions, 433 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:46:30,008 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 124 flow [2023-08-30 02:46:30,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-30 02:46:30,010 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-30 02:46:30,010 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 124 flow [2023-08-30 02:46:30,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:30,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:30,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:30,228 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-30 02:46:30,228 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:30,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1578243662, now seen corresponding path program 2 times [2023-08-30 02:46:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336473156] [2023-08-30 02:46:30,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:46:30,230 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-30 02:46:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:30,231 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-30 02:46:30,234 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-30 02:46:30,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:46:30,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:46:30,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:30,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:30,384 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-30 02:46:30,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:30,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336473156] [2023-08-30 02:46:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336473156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:30,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290246476] [2023-08-30 02:46:30,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:30,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:30,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-30 02:46:30,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:30,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-30 02:46:30,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:30,656 INFO L130 PetriNetUnfolder]: 1116/1770 cut-off events. [2023-08-30 02:46:30,657 INFO L131 PetriNetUnfolder]: For 582/583 co-relation queries the response was YES. [2023-08-30 02:46:30,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 1770 events. 1116/1770 cut-off events. For 582/583 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8734 event pairs, 155 based on Foata normal form. 1/1736 useless extension candidates. Maximal degree in co-relation 4459. Up to 924 conditions per place. [2023-08-30 02:46:30,663 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 48 selfloop transitions, 1 changer transitions 28/80 dead transitions. [2023-08-30 02:46:30,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 419 flow [2023-08-30 02:46:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 02:46:30,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911660777385159 [2023-08-30 02:46:30,665 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 02:46:30,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 02:46:30,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:30,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 02:46:30,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,669 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,669 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 124 flow. Second operand 4 states and 556 transitions. [2023-08-30 02:46:30,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 419 flow [2023-08-30 02:46:30,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 415 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:30,672 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 128 flow [2023-08-30 02:46:30,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 02:46:30,672 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:46:30,672 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 128 flow [2023-08-30 02:46:30,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:30,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:30,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:30,683 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-30 02:46:30,883 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-30 02:46:30,883 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:30,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1909982682, now seen corresponding path program 3 times [2023-08-30 02:46:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937173017] [2023-08-30 02:46:30,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:46:30,885 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-30 02:46:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:30,886 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-30 02:46:30,889 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-30 02:46:31,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:46:31,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:46:31,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:46:31,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:31,054 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-30 02:46:31,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:31,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937173017] [2023-08-30 02:46:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937173017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:46:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770436321] [2023-08-30 02:46:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:31,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:46:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:46:31,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:46:31,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-30 02:46:31,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:31,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:31,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-30 02:46:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:31,315 INFO L130 PetriNetUnfolder]: 1008/1727 cut-off events. [2023-08-30 02:46:31,315 INFO L131 PetriNetUnfolder]: For 983/987 co-relation queries the response was YES. [2023-08-30 02:46:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 1727 events. 1008/1727 cut-off events. For 983/987 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9237 event pairs, 218 based on Foata normal form. 1/1690 useless extension candidates. Maximal degree in co-relation 4460. Up to 993 conditions per place. [2023-08-30 02:46:31,322 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 36 selfloop transitions, 1 changer transitions 42/82 dead transitions. [2023-08-30 02:46:31,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 440 flow [2023-08-30 02:46:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:46:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:46:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-08-30 02:46:31,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929328621908127 [2023-08-30 02:46:31,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-08-30 02:46:31,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-08-30 02:46:31,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:31,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-08-30 02:46:31,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:31,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:31,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:31,333 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 128 flow. Second operand 4 states and 558 transitions. [2023-08-30 02:46:31,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 440 flow [2023-08-30 02:46:31,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 435 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:31,335 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 132 flow [2023-08-30 02:46:31,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-30 02:46:31,336 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-30 02:46:31,336 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 132 flow [2023-08-30 02:46:31,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:31,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:31,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:31,345 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-30 02:46:31,540 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-30 02:46:31,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:31,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2126433504, now seen corresponding path program 4 times [2023-08-30 02:46:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403917907] [2023-08-30 02:46:31,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:46:31,542 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-30 02:46:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:31,544 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-30 02:46:31,546 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-30 02:46:31,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:46:31,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:46:31,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:46:31,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:46:32,306 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-30 02:46:32,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:46:32,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:46:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403917907] [2023-08-30 02:46:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403917907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:46:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:46:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:46:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998421795] [2023-08-30 02:46:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:46:32,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:46:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:46:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:46:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:46:32,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-30 02:46:32,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:32,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:46:32,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-30 02:46:32,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:46:32,684 INFO L130 PetriNetUnfolder]: 836/1404 cut-off events. [2023-08-30 02:46:32,684 INFO L131 PetriNetUnfolder]: For 956/963 co-relation queries the response was YES. [2023-08-30 02:46:32,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3880 conditions, 1404 events. 836/1404 cut-off events. For 956/963 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6893 event pairs, 273 based on Foata normal form. 2/1338 useless extension candidates. Maximal degree in co-relation 3872. Up to 495 conditions per place. [2023-08-30 02:46:32,689 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 39 selfloop transitions, 4 changer transitions 50/97 dead transitions. [2023-08-30 02:46:32,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 97 transitions, 548 flow [2023-08-30 02:46:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:46:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:46:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-30 02:46:32,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147905098435133 [2023-08-30 02:46:32,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-30 02:46:32,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-30 02:46:32,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:46:32,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-30 02:46:32,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:32,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:32,698 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:32,698 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 132 flow. Second operand 7 states and 934 transitions. [2023-08-30 02:46:32,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 97 transitions, 548 flow [2023-08-30 02:46:32,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 541 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:46:32,701 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 142 flow [2023-08-30 02:46:32,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-08-30 02:46:32,701 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-30 02:46:32,702 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 142 flow [2023-08-30 02:46:32,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:46:32,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:46:32,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:32,713 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-30 02:46:32,912 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-30 02:46:32,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:46:32,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:46:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1120298204, now seen corresponding path program 5 times [2023-08-30 02:46:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:46:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944778411] [2023-08-30 02:46:32,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:46:32,913 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-30 02:46:32,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:46:32,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:46:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 02:46:33,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:46:33,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:46:33,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:46:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:46:33,222 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:46:33,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:46:33,223 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:46:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:46:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:46:33,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:46:33,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:46:33,437 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:46:33,441 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:46:33,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:46:33,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:46:33 BasicIcfg [2023-08-30 02:46:33,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:46:33,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:46:33,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:46:33,536 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:46:33,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:46:14" (3/4) ... [2023-08-30 02:46:33,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:46:33,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:46:33,539 INFO L158 Benchmark]: Toolchain (without parser) took 20068.17ms. Allocated memory was 81.8MB in the beginning and 453.0MB in the end (delta: 371.2MB). Free memory was 62.3MB in the beginning and 114.4MB in the end (delta: -52.1MB). Peak memory consumption was 317.9MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,540 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 65.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:33,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.82ms. Allocated memory is still 81.8MB. Free memory was 62.0MB in the beginning and 57.3MB in the end (delta: 4.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.98ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 54.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,540 INFO L158 Benchmark]: Boogie Preprocessor took 49.51ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,541 INFO L158 Benchmark]: RCFGBuilder took 759.78ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.0MB in the end (delta: 3.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,541 INFO L158 Benchmark]: TraceAbstraction took 18652.87ms. Allocated memory was 81.8MB in the beginning and 453.0MB in the end (delta: 371.2MB). Free memory was 48.5MB in the beginning and 114.4MB in the end (delta: -65.9MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. [2023-08-30 02:46:33,541 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 453.0MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:46:33,543 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.22ms. Allocated memory is still 65.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.82ms. Allocated memory is still 81.8MB. Free memory was 62.0MB in the beginning and 57.3MB in the end (delta: 4.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.98ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 54.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.51ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.78ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.0MB in the end (delta: 3.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18652.87ms. Allocated memory was 81.8MB in the beginning and 453.0MB in the end (delta: 371.2MB). Free memory was 48.5MB in the beginning and 114.4MB in the end (delta: -65.9MB). Peak memory consumption was 305.0MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 453.0MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 151 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 37 TransitionsAfterwards, 3170 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 8156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4372, independent: 4163, independent conditional: 0, independent unconditional: 4163, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1735, independent: 1692, independent conditional: 0, independent unconditional: 1692, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4372, independent: 2471, independent conditional: 0, independent unconditional: 2471, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1735, unknown conditional: 0, unknown unconditional: 1735] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=0, t325={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=1, t325={11:0}, t326={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=2, t325={11:0}, t326={15:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=3, t325={11:0}, t326={15:0}, t327={7:0}, t328={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={11:0}, t326={15:0}, t327={7:0}, t328={-2147483637:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={11:0}, t326={15:0}, t327={7:0}, t328={-2147483637:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1577 IncrementalHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 27 mSDtfsCounter, 1577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=6, InterpolantAutomatonStates: 52, 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.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 17 QuantifiedInterpolants, 1786 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:46:33,564 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