./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.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/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --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 03:01:56,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:01:56,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:01:56,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:01:56,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:01:56,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:01:56,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:01:56,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:01:56,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:01:56,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:01:56,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:01:56,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:01:56,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:01:56,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:01:56,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:01:56,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:01:56,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:01:56,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:01:56,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:01:56,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:01:56,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:01:56,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:01:56,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:01:56,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:01:56,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:01:56,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:01:56,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:01:56,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:01:56,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:01:56,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:01:56,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:01:56,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:01:56,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:01:56,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:01:56,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:01:56,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:01:56,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:01:56,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:01:56,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:01:56,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:01:56,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:01:56,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:01:56,226 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:01:56,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:01:56,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:01:56,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:01:56,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:01:56,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:01:56,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:01:56,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:01:56,230 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:01:56,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:01:56,231 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:01:56,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:01:56,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:01:56,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:01:56,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:01:56,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:01:56,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:01:56,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:01:56,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:01:56,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:01:56,233 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:01:56,233 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:01:56,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:01:56,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:01:56,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:01:56,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:01:56,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:01:56,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:01:56,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:01:56,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:01:56,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:01:56,235 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:01:56,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:01:56,236 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:01:56,236 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 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 03:01:56,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:01:56,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:01:56,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:01:56,581 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:01:56,581 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:01:56,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 03:01:57,737 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:01:58,031 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:01:58,032 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 03:01:58,062 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bb384ac/3dbab1d0b3b04c6998f18b2ccf155caa/FLAG891d01392 [2023-08-30 03:01:58,074 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bb384ac/3dbab1d0b3b04c6998f18b2ccf155caa [2023-08-30 03:01:58,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:01:58,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:01:58,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:01:58,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:01:58,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:01:58,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16734697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58, skipping insertion in model container [2023-08-30 03:01:58,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:01:58,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:01:58,332 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/safe000_power.opt.i[951,964] [2023-08-30 03:01:58,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:01:58,620 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:01:58,631 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/safe000_power.opt.i[951,964] [2023-08-30 03:01:58,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:01:58,722 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:01:58,722 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:01:58,728 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:01:58,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58 WrapperNode [2023-08-30 03:01:58,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:01:58,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:01:58,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:01:58,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:01:58,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,790 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-30 03:01:58,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:01:58,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:01:58,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:01:58,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:01:58,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,832 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:01:58,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:01:58,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:01:58,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:01:58,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (1/1) ... [2023-08-30 03:01:58,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:01:58,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:01:58,882 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 03:01:58,895 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 03:01:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:01:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:01:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:01:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:01:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:01:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:01:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:01:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:01:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:01:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:01:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:01:58,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:01:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:01:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:01:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:01:58,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:01:58,923 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 03:01:59,134 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:01:59,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:01:59,667 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:02:00,281 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:02:00,281 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:02:00,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:02:00 BoogieIcfgContainer [2023-08-30 03:02:00,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:02:00,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:02:00,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:02:00,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:02:00,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:01:58" (1/3) ... [2023-08-30 03:02:00,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b2f832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:02:00, skipping insertion in model container [2023-08-30 03:02:00,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:58" (2/3) ... [2023-08-30 03:02:00,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b2f832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:02:00, skipping insertion in model container [2023-08-30 03:02:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:02:00" (3/3) ... [2023-08-30 03:02:00,292 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-30 03:02:00,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:02:00,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-30 03:02:00,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:02:00,449 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:02:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-30 03:02:00,590 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-30 03:02:00,591 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:02:00,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 03:02:00,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-30 03:02:00,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-30 03:02:00,613 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:02:00,626 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-30 03:02:00,629 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-30 03:02:00,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-30 03:02:00,687 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-30 03:02:00,687 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:02:00,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 03:02:00,693 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-30 03:02:12,389 INFO L134 LiptonReduction]: Checked pairs total: 31207 [2023-08-30 03:02:12,393 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-30 03:02:12,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:02:12,410 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;@589fde1e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:02:12,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-30 03:02:12,412 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:02:12,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:02:12,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:12,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:02:12,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:12,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1117, now seen corresponding path program 1 times [2023-08-30 03:02:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308106514] [2023-08-30 03:02:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:12,606 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 03:02:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308106514] [2023-08-30 03:02:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308106514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:02:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413652182] [2023-08-30 03:02:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:12,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:02:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:02:12,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:02:12,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-30 03:02:12,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:12,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:12,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-30 03:02:12,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:18,177 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-30 03:02:18,177 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 03:02:18,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3422. Compared 317079 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-30 03:02:18,476 INFO L137 encePairwiseOnDemand]: 294/315 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-30 03:02:18,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-30 03:02:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:02:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:02:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-30 03:02:18,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2023-08-30 03:02:18,498 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-30 03:02:18,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-30 03:02:18,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:18,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-30 03:02:18,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:18,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:18,513 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:18,515 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 314 transitions. [2023-08-30 03:02:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-30 03:02:18,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:02:18,529 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-30 03:02:18,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-30 03:02:18,535 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-30 03:02:18,535 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-30 03:02:18,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:18,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:18,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:02:18,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:02:18,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:18,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 34153930, now seen corresponding path program 1 times [2023-08-30 03:02:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882096788] [2023-08-30 03:02:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:18,828 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 03:02:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882096788] [2023-08-30 03:02:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882096788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:18,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643421121] [2023-08-30 03:02:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:18,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:18,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-30 03:02:18,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:18,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:18,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-30 03:02:18,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:22,892 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-30 03:02:22,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:02:22,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3098. Compared 303028 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-30 03:02:23,318 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-30 03:02:23,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-30 03:02:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-30 03:02:23,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2023-08-30 03:02:23,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-30 03:02:23,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-30 03:02:23,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:23,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-30 03:02:23,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:23,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:23,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:23,329 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-30 03:02:23,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-30 03:02:23,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:02:23,333 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-30 03:02:23,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-30 03:02:23,334 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-30 03:02:23,335 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-30 03:02:23,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:23,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:23,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:02:23,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:02:23,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:23,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772752, now seen corresponding path program 1 times [2023-08-30 03:02:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13006199] [2023-08-30 03:02:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:02:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13006199] [2023-08-30 03:02:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13006199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:23,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:02:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166849840] [2023-08-30 03:02:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:23,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:23,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-30 03:02:23,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:23,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:23,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-30 03:02:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:28,755 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-30 03:02:28,756 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-30 03:02:28,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4126. Compared 381706 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-30 03:02:29,298 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-30 03:02:29,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-30 03:02:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-30 03:02:29,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-30 03:02:29,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-30 03:02:29,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-30 03:02:29,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:29,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-30 03:02:29,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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 03:02:29,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:29,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:29,309 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 450 transitions. [2023-08-30 03:02:29,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-30 03:02:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:29,314 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-30 03:02:29,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-30 03:02:29,316 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-30 03:02:29,319 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-30 03:02:29,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:29,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:29,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:02:29,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:02:29,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:29,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772754, now seen corresponding path program 1 times [2023-08-30 03:02:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997258422] [2023-08-30 03:02:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:29,515 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 03:02:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997258422] [2023-08-30 03:02:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997258422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:02:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059159157] [2023-08-30 03:02:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:29,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:02:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:02:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:02:29,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:02:29,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 03:02:29,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:29,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:02:29,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:32,097 INFO L130 PetriNetUnfolder]: 17391/24493 cut-off events. [2023-08-30 03:02:32,098 INFO L131 PetriNetUnfolder]: For 5061/5135 co-relation queries the response was YES. [2023-08-30 03:02:32,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56528 conditions, 24493 events. 17391/24493 cut-off events. For 5061/5135 co-relation queries the response was YES. Maximal size of possible extension queue 1782. Compared 164969 event pairs, 5107 based on Foata normal form. 24/16740 useless extension candidates. Maximal degree in co-relation 56523. Up to 13571 conditions per place. [2023-08-30 03:02:32,229 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 89 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2023-08-30 03:02:32,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 451 flow [2023-08-30 03:02:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:02:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:02:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2023-08-30 03:02:32,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2023-08-30 03:02:32,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2023-08-30 03:02:32,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2023-08-30 03:02:32,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:32,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2023-08-30 03:02:32,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 03:02:32,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:32,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:32,236 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 4 states and 575 transitions. [2023-08-30 03:02:32,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 451 flow [2023-08-30 03:02:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:32,265 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 185 flow [2023-08-30 03:02:32,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-30 03:02:32,267 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-30 03:02:32,267 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 185 flow [2023-08-30 03:02:32,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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 03:02:32,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:32,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:02:32,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:02:32,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:32,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1058772755, now seen corresponding path program 1 times [2023-08-30 03:02:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082844698] [2023-08-30 03:02:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:32,435 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 03:02:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082844698] [2023-08-30 03:02:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082844698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252318647] [2023-08-30 03:02:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:32,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:32,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-30 03:02:32,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:32,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:32,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-30 03:02:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:33,467 INFO L130 PetriNetUnfolder]: 5199/7513 cut-off events. [2023-08-30 03:02:33,467 INFO L131 PetriNetUnfolder]: For 5247/5288 co-relation queries the response was YES. [2023-08-30 03:02:33,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20817 conditions, 7513 events. 5199/7513 cut-off events. For 5247/5288 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42772 event pairs, 4471 based on Foata normal form. 2609/8960 useless extension candidates. Maximal degree in co-relation 20810. Up to 7464 conditions per place. [2023-08-30 03:02:33,518 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 03:02:33,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 243 flow [2023-08-30 03:02:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-30 03:02:33,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2023-08-30 03:02:33,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-30 03:02:33,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-30 03:02:33,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:33,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-30 03:02:33,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 03:02:33,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:33,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:33,530 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 185 flow. Second operand 3 states and 413 transitions. [2023-08-30 03:02:33,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 243 flow [2023-08-30 03:02:33,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:33,533 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 158 flow [2023-08-30 03:02:33,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-30 03:02:33,537 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-30 03:02:33,537 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 158 flow [2023-08-30 03:02:33,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:33,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:33,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:02:33,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:33,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1089620560, now seen corresponding path program 1 times [2023-08-30 03:02:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731637510] [2023-08-30 03:02:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:33,848 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 03:02:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731637510] [2023-08-30 03:02:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731637510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:33,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:33,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850690479] [2023-08-30 03:02:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:33,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:33,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:33,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-30 03:02:33,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:33,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:33,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-30 03:02:33,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:35,153 INFO L130 PetriNetUnfolder]: 5159/7423 cut-off events. [2023-08-30 03:02:35,154 INFO L131 PetriNetUnfolder]: For 4422/4431 co-relation queries the response was YES. [2023-08-30 03:02:35,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20564 conditions, 7423 events. 5159/7423 cut-off events. For 4422/4431 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 42057 event pairs, 2953 based on Foata normal form. 0/6299 useless extension candidates. Maximal degree in co-relation 20557. Up to 6733 conditions per place. [2023-08-30 03:02:35,182 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 66 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-30 03:02:35,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 380 flow [2023-08-30 03:02:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 03:02:35,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-30 03:02:35,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 03:02:35,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 03:02:35,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:35,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 03:02:35,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:35,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:35,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:35,188 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 158 flow. Second operand 3 states and 425 transitions. [2023-08-30 03:02:35,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 380 flow [2023-08-30 03:02:35,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:35,191 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 165 flow [2023-08-30 03:02:35,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-30 03:02:35,192 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-30 03:02:35,192 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 165 flow [2023-08-30 03:02:35,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:35,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:35,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:35,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:02:35,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:35,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1089620814, now seen corresponding path program 1 times [2023-08-30 03:02:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:35,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366952008] [2023-08-30 03:02:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:35,276 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 03:02:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366952008] [2023-08-30 03:02:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366952008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320709240] [2023-08-30 03:02:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:35,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:35,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:35,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-30 03:02:35,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:35,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:35,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-30 03:02:35,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:36,124 INFO L130 PetriNetUnfolder]: 5035/7525 cut-off events. [2023-08-30 03:02:36,124 INFO L131 PetriNetUnfolder]: For 4551/4587 co-relation queries the response was YES. [2023-08-30 03:02:36,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21018 conditions, 7525 events. 5035/7525 cut-off events. For 4551/4587 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 46127 event pairs, 1342 based on Foata normal form. 4/6535 useless extension candidates. Maximal degree in co-relation 21010. Up to 5610 conditions per place. [2023-08-30 03:02:36,160 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 66 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-30 03:02:36,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 404 flow [2023-08-30 03:02:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 03:02:36,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-30 03:02:36,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 03:02:36,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 03:02:36,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:36,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 03:02:36,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:36,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:36,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:36,165 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 165 flow. Second operand 3 states and 425 transitions. [2023-08-30 03:02:36,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 404 flow [2023-08-30 03:02:36,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:36,169 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 174 flow [2023-08-30 03:02:36,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-30 03:02:36,170 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-30 03:02:36,170 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 174 flow [2023-08-30 03:02:36,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:36,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:36,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:36,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:02:36,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:36,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1109862484, now seen corresponding path program 1 times [2023-08-30 03:02:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318033707] [2023-08-30 03:02:36,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:36,371 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 03:02:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318033707] [2023-08-30 03:02:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318033707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104598953] [2023-08-30 03:02:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:36,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-30 03:02:36,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:36,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:36,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-30 03:02:36,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:37,697 INFO L130 PetriNetUnfolder]: 7192/10250 cut-off events. [2023-08-30 03:02:37,697 INFO L131 PetriNetUnfolder]: For 5444/5444 co-relation queries the response was YES. [2023-08-30 03:02:37,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29087 conditions, 10250 events. 7192/10250 cut-off events. For 5444/5444 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 54455 event pairs, 1822 based on Foata normal form. 20/9106 useless extension candidates. Maximal degree in co-relation 29078. Up to 9227 conditions per place. [2023-08-30 03:02:37,745 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 69 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-30 03:02:37,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 423 flow [2023-08-30 03:02:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-30 03:02:37,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455026455026455 [2023-08-30 03:02:37,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-30 03:02:37,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-30 03:02:37,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:37,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-30 03:02:37,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:37,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:37,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:37,749 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 174 flow. Second operand 3 states and 421 transitions. [2023-08-30 03:02:37,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 423 flow [2023-08-30 03:02:37,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:37,753 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 187 flow [2023-08-30 03:02:37,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-30 03:02:37,753 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-30 03:02:37,754 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 187 flow [2023-08-30 03:02:37,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:37,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:37,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:37,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:02:37,754 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:37,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash -538304897, now seen corresponding path program 1 times [2023-08-30 03:02:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111124937] [2023-08-30 03:02:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:37,987 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 03:02:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111124937] [2023-08-30 03:02:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111124937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:37,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:02:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088556654] [2023-08-30 03:02:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:37,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:02:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:37,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:02:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:02:38,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 315 [2023-08-30 03:02:38,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 03:02:38,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:38,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 315 [2023-08-30 03:02:38,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:39,193 INFO L130 PetriNetUnfolder]: 6385/9602 cut-off events. [2023-08-30 03:02:39,193 INFO L131 PetriNetUnfolder]: For 6122/6367 co-relation queries the response was YES. [2023-08-30 03:02:39,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26927 conditions, 9602 events. 6385/9602 cut-off events. For 6122/6367 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 60569 event pairs, 2121 based on Foata normal form. 585/9000 useless extension candidates. Maximal degree in co-relation 26917. Up to 4835 conditions per place. [2023-08-30 03:02:39,256 INFO L137 encePairwiseOnDemand]: 301/315 looper letters, 91 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2023-08-30 03:02:39,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 617 flow [2023-08-30 03:02:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:02:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:02:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-30 03:02:39,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-30 03:02:39,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-30 03:02:39,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-30 03:02:39,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:39,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-30 03:02:39,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:39,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:39,264 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:39,265 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 187 flow. Second operand 5 states and 693 transitions. [2023-08-30 03:02:39,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 617 flow [2023-08-30 03:02:39,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:39,273 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 302 flow [2023-08-30 03:02:39,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-30 03:02:39,274 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-30 03:02:39,274 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 302 flow [2023-08-30 03:02:39,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 03:02:39,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:39,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:39,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:02:39,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:39,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 581498804, now seen corresponding path program 1 times [2023-08-30 03:02:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:39,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870463008] [2023-08-30 03:02:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:39,552 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 03:02:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870463008] [2023-08-30 03:02:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870463008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:02:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114882116] [2023-08-30 03:02:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:39,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:02:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:02:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:02:39,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-30 03:02:39,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 03:02:39,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:39,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-30 03:02:39,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:41,097 INFO L130 PetriNetUnfolder]: 6324/9463 cut-off events. [2023-08-30 03:02:41,097 INFO L131 PetriNetUnfolder]: For 9257/9559 co-relation queries the response was YES. [2023-08-30 03:02:41,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33768 conditions, 9463 events. 6324/9463 cut-off events. For 9257/9559 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 59148 event pairs, 2440 based on Foata normal form. 96/8320 useless extension candidates. Maximal degree in co-relation 33756. Up to 7455 conditions per place. [2023-08-30 03:02:41,142 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 71 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2023-08-30 03:02:41,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 559 flow [2023-08-30 03:02:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:02:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:02:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-30 03:02:41,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-30 03:02:41,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-30 03:02:41,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-30 03:02:41,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:41,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-30 03:02:41,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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 03:02:41,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:41,149 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:41,149 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 302 flow. Second operand 4 states and 540 transitions. [2023-08-30 03:02:41,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 559 flow [2023-08-30 03:02:41,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:41,159 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 302 flow [2023-08-30 03:02:41,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-30 03:02:41,160 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -18 predicate places. [2023-08-30 03:02:41,160 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 302 flow [2023-08-30 03:02:41,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 03:02:41,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:41,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:41,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:02:41,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:41,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash 846633140, now seen corresponding path program 1 times [2023-08-30 03:02:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219810411] [2023-08-30 03:02:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:41,346 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 03:02:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219810411] [2023-08-30 03:02:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219810411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:41,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:02:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126645040] [2023-08-30 03:02:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:41,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:02:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:41,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:02:41,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:02:41,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 315 [2023-08-30 03:02:41,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:41,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:41,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 315 [2023-08-30 03:02:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:42,290 INFO L130 PetriNetUnfolder]: 5240/7963 cut-off events. [2023-08-30 03:02:42,290 INFO L131 PetriNetUnfolder]: For 8591/8706 co-relation queries the response was YES. [2023-08-30 03:02:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 7963 events. 5240/7963 cut-off events. For 8591/8706 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 48725 event pairs, 2324 based on Foata normal form. 132/7045 useless extension candidates. Maximal degree in co-relation 27761. Up to 5322 conditions per place. [2023-08-30 03:02:42,335 INFO L137 encePairwiseOnDemand]: 306/315 looper letters, 63 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-30 03:02:42,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 516 flow [2023-08-30 03:02:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-30 03:02:42,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2023-08-30 03:02:42,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-30 03:02:42,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-30 03:02:42,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:42,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-30 03:02:42,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 03:02:42,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:42,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:42,340 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 302 flow. Second operand 3 states and 395 transitions. [2023-08-30 03:02:42,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 516 flow [2023-08-30 03:02:42,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:42,346 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 323 flow [2023-08-30 03:02:42,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 03:02:42,347 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-08-30 03:02:42,347 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 323 flow [2023-08-30 03:02:42,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:42,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:42,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:42,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:02:42,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:42,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash -868746358, now seen corresponding path program 1 times [2023-08-30 03:02:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848207992] [2023-08-30 03:02:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:42,623 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 03:02:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:42,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848207992] [2023-08-30 03:02:42,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848207992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:42,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:42,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:02:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013850582] [2023-08-30 03:02:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:42,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:42,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-30 03:02:42,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:42,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:42,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-30 03:02:42,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:43,559 INFO L130 PetriNetUnfolder]: 5224/8306 cut-off events. [2023-08-30 03:02:43,559 INFO L131 PetriNetUnfolder]: For 13638/13638 co-relation queries the response was YES. [2023-08-30 03:02:43,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30146 conditions, 8306 events. 5224/8306 cut-off events. For 13638/13638 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 53452 event pairs, 637 based on Foata normal form. 15/7367 useless extension candidates. Maximal degree in co-relation 30133. Up to 6473 conditions per place. [2023-08-30 03:02:43,612 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 85 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-30 03:02:43,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 729 flow [2023-08-30 03:02:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:02:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:02:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-30 03:02:43,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4402116402116402 [2023-08-30 03:02:43,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-30 03:02:43,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-30 03:02:43,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:43,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-30 03:02:43,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:43,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:43,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:43,617 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 323 flow. Second operand 3 states and 416 transitions. [2023-08-30 03:02:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 729 flow [2023-08-30 03:02:43,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 683 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:02:43,636 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow [2023-08-30 03:02:43,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 03:02:43,636 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-08-30 03:02:43,637 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow [2023-08-30 03:02:43,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:43,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:43,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:43,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:02:43,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:43,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1425931802, now seen corresponding path program 1 times [2023-08-30 03:02:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264412462] [2023-08-30 03:02:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:43,822 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 03:02:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264412462] [2023-08-30 03:02:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264412462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:02:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814200642] [2023-08-30 03:02:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:43,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:02:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:43,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:02:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:02:43,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:02:43,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:43,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:43,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:02:43,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:45,437 INFO L130 PetriNetUnfolder]: 10160/14901 cut-off events. [2023-08-30 03:02:45,437 INFO L131 PetriNetUnfolder]: For 17311/17311 co-relation queries the response was YES. [2023-08-30 03:02:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53575 conditions, 14901 events. 10160/14901 cut-off events. For 17311/17311 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 90008 event pairs, 1632 based on Foata normal form. 90/13195 useless extension candidates. Maximal degree in co-relation 53562. Up to 8641 conditions per place. [2023-08-30 03:02:45,555 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 121 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-08-30 03:02:45,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 946 flow [2023-08-30 03:02:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:02:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:02:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-30 03:02:45,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373015873015873 [2023-08-30 03:02:45,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-30 03:02:45,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-30 03:02:45,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:45,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-30 03:02:45,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:45,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:45,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:45,561 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 4 states and 551 transitions. [2023-08-30 03:02:45,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 946 flow [2023-08-30 03:02:45,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 125 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:45,577 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 319 flow [2023-08-30 03:02:45,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-08-30 03:02:45,578 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -15 predicate places. [2023-08-30 03:02:45,578 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 319 flow [2023-08-30 03:02:45,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:45,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:45,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:45,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:02:45,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:45,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1865659524, now seen corresponding path program 1 times [2023-08-30 03:02:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950437532] [2023-08-30 03:02:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:46,283 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 03:02:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950437532] [2023-08-30 03:02:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950437532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:46,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:02:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468019141] [2023-08-30 03:02:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:46,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:02:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:02:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:02:46,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-30 03:02:46,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:46,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:46,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-30 03:02:46,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:48,546 INFO L130 PetriNetUnfolder]: 10061/15080 cut-off events. [2023-08-30 03:02:48,546 INFO L131 PetriNetUnfolder]: For 13728/13934 co-relation queries the response was YES. [2023-08-30 03:02:48,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54484 conditions, 15080 events. 10061/15080 cut-off events. For 13728/13934 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 100040 event pairs, 3937 based on Foata normal form. 19/13570 useless extension candidates. Maximal degree in co-relation 54470. Up to 9136 conditions per place. [2023-08-30 03:02:48,640 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 131 selfloop transitions, 23 changer transitions 0/158 dead transitions. [2023-08-30 03:02:48,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 1133 flow [2023-08-30 03:02:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:02:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:02:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2023-08-30 03:02:48,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37883597883597886 [2023-08-30 03:02:48,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2023-08-30 03:02:48,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2023-08-30 03:02:48,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:48,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2023-08-30 03:02:48,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states 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 03:02:48,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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 03:02:48,650 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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 03:02:48,650 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 319 flow. Second operand 9 states and 1074 transitions. [2023-08-30 03:02:48,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 1133 flow [2023-08-30 03:02:48,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 158 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:02:48,672 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 522 flow [2023-08-30 03:02:48,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2023-08-30 03:02:48,673 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-30 03:02:48,673 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 522 flow [2023-08-30 03:02:48,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:48,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:48,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:48,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:02:48,674 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:48,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash 475825609, now seen corresponding path program 1 times [2023-08-30 03:02:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022602440] [2023-08-30 03:02:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:49,057 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 03:02:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022602440] [2023-08-30 03:02:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022602440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:02:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052116465] [2023-08-30 03:02:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:49,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:02:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:02:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:02:49,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-30 03:02:49,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:49,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:49,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-30 03:02:49,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:51,044 INFO L130 PetriNetUnfolder]: 11328/17210 cut-off events. [2023-08-30 03:02:51,044 INFO L131 PetriNetUnfolder]: For 18453/18794 co-relation queries the response was YES. [2023-08-30 03:02:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62642 conditions, 17210 events. 11328/17210 cut-off events. For 18453/18794 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 117567 event pairs, 3456 based on Foata normal form. 425/16341 useless extension candidates. Maximal degree in co-relation 62625. Up to 7662 conditions per place. [2023-08-30 03:02:51,208 INFO L137 encePairwiseOnDemand]: 301/315 looper letters, 124 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2023-08-30 03:02:51,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1255 flow [2023-08-30 03:02:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:02:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:02:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-08-30 03:02:51,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3986394557823129 [2023-08-30 03:02:51,211 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-08-30 03:02:51,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-08-30 03:02:51,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:51,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-08-30 03:02:51,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 03:02:51,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:51,217 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:51,217 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 522 flow. Second operand 7 states and 879 transitions. [2023-08-30 03:02:51,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1255 flow [2023-08-30 03:02:51,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 152 transitions, 1234 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-30 03:02:51,352 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 779 flow [2023-08-30 03:02:51,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=779, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2023-08-30 03:02:51,352 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2023-08-30 03:02:51,352 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 779 flow [2023-08-30 03:02:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:51,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:51,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:51,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:02:51,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:51,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1131168354, now seen corresponding path program 1 times [2023-08-30 03:02:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209246843] [2023-08-30 03:02:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:02:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209246843] [2023-08-30 03:02:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209246843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:51,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:51,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:02:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359180015] [2023-08-30 03:02:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:51,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:02:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:02:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:02:51,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:02:51,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:51,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:51,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:02:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:02:55,166 INFO L130 PetriNetUnfolder]: 22415/33142 cut-off events. [2023-08-30 03:02:55,167 INFO L131 PetriNetUnfolder]: For 77461/77461 co-relation queries the response was YES. [2023-08-30 03:02:55,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133569 conditions, 33142 events. 22415/33142 cut-off events. For 77461/77461 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 226574 event pairs, 4958 based on Foata normal form. 192/31532 useless extension candidates. Maximal degree in co-relation 133548. Up to 19909 conditions per place. [2023-08-30 03:02:55,528 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 210 selfloop transitions, 4 changer transitions 1/215 dead transitions. [2023-08-30 03:02:55,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 215 transitions, 2339 flow [2023-08-30 03:02:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:02:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:02:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-30 03:02:55,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44206349206349205 [2023-08-30 03:02:55,531 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-30 03:02:55,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-30 03:02:55,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:02:55,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-30 03:02:55,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 03:02:55,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:55,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:55,535 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 779 flow. Second operand 4 states and 557 transitions. [2023-08-30 03:02:55,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 215 transitions, 2339 flow [2023-08-30 03:02:55,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 215 transitions, 2315 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-30 03:02:55,938 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 789 flow [2023-08-30 03:02:55,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2023-08-30 03:02:55,939 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-30 03:02:55,939 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 789 flow [2023-08-30 03:02:55,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:55,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:02:55,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:02:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:02:55,940 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:02:55,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:02:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1239144996, now seen corresponding path program 2 times [2023-08-30 03:02:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:02:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867673289] [2023-08-30 03:02:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:02:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:02:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:02:56,191 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 03:02:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:02:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867673289] [2023-08-30 03:02:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867673289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:02:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:02:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:02:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816573323] [2023-08-30 03:02:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:02:56,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:02:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:02:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:02:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:02:56,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-30 03:02:56,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:02:56,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:02:56,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-30 03:02:56,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:01,436 INFO L130 PetriNetUnfolder]: 28179/41814 cut-off events. [2023-08-30 03:03:01,436 INFO L131 PetriNetUnfolder]: For 89425/89425 co-relation queries the response was YES. [2023-08-30 03:03:01,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170362 conditions, 41814 events. 28179/41814 cut-off events. For 89425/89425 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 298199 event pairs, 8809 based on Foata normal form. 30/39378 useless extension candidates. Maximal degree in co-relation 170339. Up to 24501 conditions per place. [2023-08-30 03:03:01,760 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 140 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2023-08-30 03:03:01,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 143 transitions, 1528 flow [2023-08-30 03:03:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:03:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:03:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-30 03:03:01,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44656084656084655 [2023-08-30 03:03:01,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-30 03:03:01,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-30 03:03:01,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:01,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-30 03:03:01,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:01,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:01,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:01,764 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 789 flow. Second operand 3 states and 422 transitions. [2023-08-30 03:03:01,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 143 transitions, 1528 flow [2023-08-30 03:03:02,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 143 transitions, 1522 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:03:02,397 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 795 flow [2023-08-30 03:03:02,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2023-08-30 03:03:02,398 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2023-08-30 03:03:02,398 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 795 flow [2023-08-30 03:03:02,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:02,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:02,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:02,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:03:02,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:02,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1865696175, now seen corresponding path program 1 times [2023-08-30 03:03:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64057820] [2023-08-30 03:03:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:03:02,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64057820] [2023-08-30 03:03:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64057820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:03:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417146461] [2023-08-30 03:03:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:02,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:03:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:02,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:03:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:03:02,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-30 03:03:02,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 795 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:02,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:02,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-30 03:03:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:06,960 INFO L130 PetriNetUnfolder]: 24362/37562 cut-off events. [2023-08-30 03:03:06,960 INFO L131 PetriNetUnfolder]: For 89487/90149 co-relation queries the response was YES. [2023-08-30 03:03:07,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151312 conditions, 37562 events. 24362/37562 cut-off events. For 89487/90149 co-relation queries the response was YES. Maximal size of possible extension queue 2294. Compared 289504 event pairs, 10577 based on Foata normal form. 1671/36581 useless extension candidates. Maximal degree in co-relation 151288. Up to 26643 conditions per place. [2023-08-30 03:03:07,236 INFO L137 encePairwiseOnDemand]: 299/315 looper letters, 67 selfloop transitions, 24 changer transitions 32/127 dead transitions. [2023-08-30 03:03:07,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 1335 flow [2023-08-30 03:03:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:03:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:03:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-30 03:03:07,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103174603174603 [2023-08-30 03:03:07,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-30 03:03:07,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-30 03:03:07,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:07,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-30 03:03:07,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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 03:03:07,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:07,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:07,242 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 795 flow. Second operand 4 states and 517 transitions. [2023-08-30 03:03:07,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 1335 flow [2023-08-30 03:03:08,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1330 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 03:03:08,248 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 837 flow [2023-08-30 03:03:08,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=837, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2023-08-30 03:03:08,249 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2023-08-30 03:03:08,249 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 837 flow [2023-08-30 03:03:08,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:08,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:08,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:08,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:03:08,250 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:08,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 204004246, now seen corresponding path program 2 times [2023-08-30 03:03:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:08,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655790710] [2023-08-30 03:03:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:08,822 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 03:03:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655790710] [2023-08-30 03:03:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655790710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:03:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560051358] [2023-08-30 03:03:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:08,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:03:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:03:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:03:09,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-30 03:03:09,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 837 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:09,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:09,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-30 03:03:09,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:12,257 INFO L130 PetriNetUnfolder]: 15826/24795 cut-off events. [2023-08-30 03:03:12,257 INFO L131 PetriNetUnfolder]: For 76994/77621 co-relation queries the response was YES. [2023-08-30 03:03:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108225 conditions, 24795 events. 15826/24795 cut-off events. For 76994/77621 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 183924 event pairs, 8611 based on Foata normal form. 645/24591 useless extension candidates. Maximal degree in co-relation 108199. Up to 11747 conditions per place. [2023-08-30 03:03:12,691 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 90 selfloop transitions, 7 changer transitions 59/160 dead transitions. [2023-08-30 03:03:12,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 160 transitions, 1534 flow [2023-08-30 03:03:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:03:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:03:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 942 transitions. [2023-08-30 03:03:12,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738095238095238 [2023-08-30 03:03:12,693 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 942 transitions. [2023-08-30 03:03:12,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 942 transitions. [2023-08-30 03:03:12,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:12,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 942 transitions. [2023-08-30 03:03:12,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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 03:03:12,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:12,699 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:12,700 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 837 flow. Second operand 8 states and 942 transitions. [2023-08-30 03:03:12,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 160 transitions, 1534 flow [2023-08-30 03:03:12,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 160 transitions, 1466 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-30 03:03:12,991 INFO L231 Difference]: Finished difference. Result has 98 places, 76 transitions, 666 flow [2023-08-30 03:03:12,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=98, PETRI_TRANSITIONS=76} [2023-08-30 03:03:12,991 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2023-08-30 03:03:12,992 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 76 transitions, 666 flow [2023-08-30 03:03:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:12,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:12,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:12,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:03:12,993 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:12,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1666258254, now seen corresponding path program 1 times [2023-08-30 03:03:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141294587] [2023-08-30 03:03:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:13,286 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 03:03:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141294587] [2023-08-30 03:03:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141294587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:13,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:13,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:03:13,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28617161] [2023-08-30 03:03:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:13,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:03:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:03:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:03:13,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:03:13,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 76 transitions, 666 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:13,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:13,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:03:13,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:17,047 INFO L130 PetriNetUnfolder]: 19298/29607 cut-off events. [2023-08-30 03:03:17,047 INFO L131 PetriNetUnfolder]: For 76963/76963 co-relation queries the response was YES. [2023-08-30 03:03:17,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117649 conditions, 29607 events. 19298/29607 cut-off events. For 76963/76963 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 211333 event pairs, 5303 based on Foata normal form. 90/29177 useless extension candidates. Maximal degree in co-relation 117622. Up to 15184 conditions per place. [2023-08-30 03:03:17,290 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 107 selfloop transitions, 3 changer transitions 45/155 dead transitions. [2023-08-30 03:03:17,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 155 transitions, 1528 flow [2023-08-30 03:03:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:03:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:03:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-30 03:03:17,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42984126984126986 [2023-08-30 03:03:17,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-30 03:03:17,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-30 03:03:17,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:17,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-30 03:03:17,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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 03:03:17,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:17,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:17,296 INFO L175 Difference]: Start difference. First operand has 98 places, 76 transitions, 666 flow. Second operand 5 states and 677 transitions. [2023-08-30 03:03:17,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 155 transitions, 1528 flow [2023-08-30 03:03:17,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 155 transitions, 1329 flow, removed 64 selfloop flow, removed 9 redundant places. [2023-08-30 03:03:17,822 INFO L231 Difference]: Finished difference. Result has 93 places, 74 transitions, 569 flow [2023-08-30 03:03:17,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=569, PETRI_PLACES=93, PETRI_TRANSITIONS=74} [2023-08-30 03:03:17,822 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2023-08-30 03:03:17,822 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 74 transitions, 569 flow [2023-08-30 03:03:17,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:17,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:17,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:17,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:03:17,824 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:17,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1730808728, now seen corresponding path program 2 times [2023-08-30 03:03:17,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508646780] [2023-08-30 03:03:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:03:19,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508646780] [2023-08-30 03:03:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508646780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:19,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:19,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:03:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138446159] [2023-08-30 03:03:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:19,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:03:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:19,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:03:19,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:03:19,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-30 03:03:19,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 569 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states 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 03:03:19,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:19,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-30 03:03:19,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:22,089 INFO L130 PetriNetUnfolder]: 12635/19954 cut-off events. [2023-08-30 03:03:22,089 INFO L131 PetriNetUnfolder]: For 37030/37608 co-relation queries the response was YES. [2023-08-30 03:03:22,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72550 conditions, 19954 events. 12635/19954 cut-off events. For 37030/37608 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 147272 event pairs, 5970 based on Foata normal form. 104/19138 useless extension candidates. Maximal degree in co-relation 72525. Up to 19267 conditions per place. [2023-08-30 03:03:22,253 INFO L137 encePairwiseOnDemand]: 304/315 looper letters, 77 selfloop transitions, 15 changer transitions 16/112 dead transitions. [2023-08-30 03:03:22,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 112 transitions, 955 flow [2023-08-30 03:03:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:03:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:03:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 930 transitions. [2023-08-30 03:03:22,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2023-08-30 03:03:22,256 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 930 transitions. [2023-08-30 03:03:22,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 930 transitions. [2023-08-30 03:03:22,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:22,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 930 transitions. [2023-08-30 03:03:22,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.25) internal successors, (930), 8 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:22,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:22,260 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:22,260 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 569 flow. Second operand 8 states and 930 transitions. [2023-08-30 03:03:22,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 112 transitions, 955 flow [2023-08-30 03:03:22,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 112 transitions, 935 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 03:03:22,388 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 669 flow [2023-08-30 03:03:22,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2023-08-30 03:03:22,389 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 17 predicate places. [2023-08-30 03:03:22,389 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 669 flow [2023-08-30 03:03:22,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states 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 03:03:22,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:22,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:22,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 03:03:22,390 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:22,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash 60636385, now seen corresponding path program 1 times [2023-08-30 03:03:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394488638] [2023-08-30 03:03:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:22,611 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 03:03:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394488638] [2023-08-30 03:03:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394488638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:22,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:22,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:03:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463715941] [2023-08-30 03:03:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:22,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:03:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:03:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:03:22,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-30 03:03:22,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 669 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states 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 03:03:22,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:22,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-30 03:03:22,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:24,575 INFO L130 PetriNetUnfolder]: 9664/15173 cut-off events. [2023-08-30 03:03:24,575 INFO L131 PetriNetUnfolder]: For 37636/38239 co-relation queries the response was YES. [2023-08-30 03:03:24,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56597 conditions, 15173 events. 9664/15173 cut-off events. For 37636/38239 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 105881 event pairs, 4937 based on Foata normal form. 222/14929 useless extension candidates. Maximal degree in co-relation 56570. Up to 11113 conditions per place. [2023-08-30 03:03:24,646 INFO L137 encePairwiseOnDemand]: 303/315 looper letters, 75 selfloop transitions, 7 changer transitions 21/107 dead transitions. [2023-08-30 03:03:24,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 998 flow [2023-08-30 03:03:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:03:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:03:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-30 03:03:24,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39301587301587304 [2023-08-30 03:03:24,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-30 03:03:24,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-30 03:03:24,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:24,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-30 03:03:24,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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 03:03:24,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:24,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:24,650 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 669 flow. Second operand 5 states and 619 transitions. [2023-08-30 03:03:24,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 998 flow [2023-08-30 03:03:24,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 977 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 03:03:24,712 INFO L231 Difference]: Finished difference. Result has 99 places, 62 transitions, 470 flow [2023-08-30 03:03:24,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=99, PETRI_TRANSITIONS=62} [2023-08-30 03:03:24,713 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2023-08-30 03:03:24,713 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 62 transitions, 470 flow [2023-08-30 03:03:24,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states 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 03:03:24,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:24,713 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 03:03:24,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 03:03:24,714 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:24,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1629313202, now seen corresponding path program 1 times [2023-08-30 03:03:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:24,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735840651] [2023-08-30 03:03:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:25,033 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 03:03:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735840651] [2023-08-30 03:03:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735840651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:03:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698424237] [2023-08-30 03:03:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:03:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:03:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:03:25,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 315 [2023-08-30 03:03:25,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 62 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 03:03:25,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:25,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 315 [2023-08-30 03:03:25,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:26,227 INFO L130 PetriNetUnfolder]: 4948/8469 cut-off events. [2023-08-30 03:03:26,227 INFO L131 PetriNetUnfolder]: For 24173/24381 co-relation queries the response was YES. [2023-08-30 03:03:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31084 conditions, 8469 events. 4948/8469 cut-off events. For 24173/24381 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 62002 event pairs, 838 based on Foata normal form. 752/9098 useless extension candidates. Maximal degree in co-relation 31055. Up to 6066 conditions per place. [2023-08-30 03:03:26,259 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 74 selfloop transitions, 4 changer transitions 35/117 dead transitions. [2023-08-30 03:03:26,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 1035 flow [2023-08-30 03:03:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:03:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:03:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-30 03:03:26,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42158730158730157 [2023-08-30 03:03:26,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-30 03:03:26,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-30 03:03:26,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:26,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-30 03:03:26,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:26,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:26,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:26,265 INFO L175 Difference]: Start difference. First operand has 99 places, 62 transitions, 470 flow. Second operand 5 states and 664 transitions. [2023-08-30 03:03:26,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 1035 flow [2023-08-30 03:03:26,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 117 transitions, 973 flow, removed 13 selfloop flow, removed 9 redundant places. [2023-08-30 03:03:26,289 INFO L231 Difference]: Finished difference. Result has 93 places, 64 transitions, 457 flow [2023-08-30 03:03:26,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=93, PETRI_TRANSITIONS=64} [2023-08-30 03:03:26,290 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2023-08-30 03:03:26,290 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 457 flow [2023-08-30 03:03:26,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 03:03:26,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:26,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:03:26,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 03:03:26,291 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:26,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -445731318, now seen corresponding path program 1 times [2023-08-30 03:03:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092495280] [2023-08-30 03:03:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:03:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092495280] [2023-08-30 03:03:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092495280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:03:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427338419] [2023-08-30 03:03:28,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:28,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:03:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:28,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:03:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:03:28,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-30 03:03:28,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 108.77777777777777) internal successors, (979), 9 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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 03:03:28,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:28,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-30 03:03:28,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:29,422 INFO L130 PetriNetUnfolder]: 3885/6713 cut-off events. [2023-08-30 03:03:29,423 INFO L131 PetriNetUnfolder]: For 18093/18250 co-relation queries the response was YES. [2023-08-30 03:03:29,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29120 conditions, 6713 events. 3885/6713 cut-off events. For 18093/18250 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 47692 event pairs, 1169 based on Foata normal form. 97/6690 useless extension candidates. Maximal degree in co-relation 29092. Up to 5086 conditions per place. [2023-08-30 03:03:29,455 INFO L137 encePairwiseOnDemand]: 304/315 looper letters, 65 selfloop transitions, 17 changer transitions 15/101 dead transitions. [2023-08-30 03:03:29,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 842 flow [2023-08-30 03:03:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:03:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:03:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 927 transitions. [2023-08-30 03:03:29,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2023-08-30 03:03:29,457 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 927 transitions. [2023-08-30 03:03:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 927 transitions. [2023-08-30 03:03:29,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:29,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 927 transitions. [2023-08-30 03:03:29,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 03:03:29,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:29,460 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:29,460 INFO L175 Difference]: Start difference. First operand has 93 places, 64 transitions, 457 flow. Second operand 8 states and 927 transitions. [2023-08-30 03:03:29,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 842 flow [2023-08-30 03:03:29,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 101 transitions, 825 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 03:03:29,511 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 511 flow [2023-08-30 03:03:29,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2023-08-30 03:03:29,511 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2023-08-30 03:03:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 511 flow [2023-08-30 03:03:29,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.77777777777777) internal successors, (979), 9 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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 03:03:29,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:29,512 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 03:03:29,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 03:03:29,512 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:29,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1461929675, now seen corresponding path program 1 times [2023-08-30 03:03:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729747076] [2023-08-30 03:03:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:30,004 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 03:03:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:30,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729747076] [2023-08-30 03:03:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729747076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:03:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487773340] [2023-08-30 03:03:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:30,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:03:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:03:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:03:30,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-30 03:03:30,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 65 transitions, 511 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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 03:03:30,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:30,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-30 03:03:30,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:31,319 INFO L130 PetriNetUnfolder]: 3580/6230 cut-off events. [2023-08-30 03:03:31,320 INFO L131 PetriNetUnfolder]: For 21208/21250 co-relation queries the response was YES. [2023-08-30 03:03:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27842 conditions, 6230 events. 3580/6230 cut-off events. For 21208/21250 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 43715 event pairs, 1034 based on Foata normal form. 122/6346 useless extension candidates. Maximal degree in co-relation 27813. Up to 5051 conditions per place. [2023-08-30 03:03:31,350 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 37 selfloop transitions, 6 changer transitions 66/111 dead transitions. [2023-08-30 03:03:31,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 111 transitions, 1028 flow [2023-08-30 03:03:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:03:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:03:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2023-08-30 03:03:31,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36261022927689596 [2023-08-30 03:03:31,352 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1028 transitions. [2023-08-30 03:03:31,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1028 transitions. [2023-08-30 03:03:31,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:31,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1028 transitions. [2023-08-30 03:03:31,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states 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 03:03:31,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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 03:03:31,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 315.0) internal successors, (3150), 10 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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 03:03:31,355 INFO L175 Difference]: Start difference. First operand has 98 places, 65 transitions, 511 flow. Second operand 9 states and 1028 transitions. [2023-08-30 03:03:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 111 transitions, 1028 flow [2023-08-30 03:03:31,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 968 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-08-30 03:03:31,376 INFO L231 Difference]: Finished difference. Result has 90 places, 40 transitions, 310 flow [2023-08-30 03:03:31,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=90, PETRI_TRANSITIONS=40} [2023-08-30 03:03:31,377 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places. [2023-08-30 03:03:31,377 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 40 transitions, 310 flow [2023-08-30 03:03:31,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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 03:03:31,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:31,378 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 03:03:31,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 03:03:31,378 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:31,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2080176668, now seen corresponding path program 1 times [2023-08-30 03:03:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541970616] [2023-08-30 03:03:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:33,132 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 03:03:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541970616] [2023-08-30 03:03:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541970616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:03:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032223701] [2023-08-30 03:03:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:33,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:03:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:03:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:03:33,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 315 [2023-08-30 03:03:33,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 40 transitions, 310 flow. Second operand has 11 states, 11 states have (on average 104.54545454545455) internal successors, (1150), 11 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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 03:03:33,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:33,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 315 [2023-08-30 03:03:33,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:33,768 INFO L130 PetriNetUnfolder]: 440/773 cut-off events. [2023-08-30 03:03:33,768 INFO L131 PetriNetUnfolder]: For 3610/3614 co-relation queries the response was YES. [2023-08-30 03:03:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 773 events. 440/773 cut-off events. For 3610/3614 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3333 event pairs, 80 based on Foata normal form. 14/787 useless extension candidates. Maximal degree in co-relation 3725. Up to 469 conditions per place. [2023-08-30 03:03:33,771 INFO L137 encePairwiseOnDemand]: 306/315 looper letters, 39 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2023-08-30 03:03:33,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 59 transitions, 532 flow [2023-08-30 03:03:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:03:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:03:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2023-08-30 03:03:33,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34325396825396826 [2023-08-30 03:03:33,773 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2023-08-30 03:03:33,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2023-08-30 03:03:33,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:33,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2023-08-30 03:03:33,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 03:03:33,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:33,776 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:33,776 INFO L175 Difference]: Start difference. First operand has 90 places, 40 transitions, 310 flow. Second operand 8 states and 865 transitions. [2023-08-30 03:03:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 59 transitions, 532 flow [2023-08-30 03:03:33,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 442 flow, removed 18 selfloop flow, removed 22 redundant places. [2023-08-30 03:03:33,780 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 307 flow [2023-08-30 03:03:33,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-08-30 03:03:33,781 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -13 predicate places. [2023-08-30 03:03:33,781 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 307 flow [2023-08-30 03:03:33,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.54545454545455) internal successors, (1150), 11 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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 03:03:33,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:33,781 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 03:03:33,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 03:03:33,781 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:33,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1754386111, now seen corresponding path program 1 times [2023-08-30 03:03:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332859895] [2023-08-30 03:03:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:34,086 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 03:03:34,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:34,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332859895] [2023-08-30 03:03:34,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332859895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:34,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:34,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:03:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618632656] [2023-08-30 03:03:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:34,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:03:34,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:34,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:03:34,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:03:34,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:03:34,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:34,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:34,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:03:34,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:34,289 INFO L130 PetriNetUnfolder]: 284/552 cut-off events. [2023-08-30 03:03:34,289 INFO L131 PetriNetUnfolder]: For 1604/1608 co-relation queries the response was YES. [2023-08-30 03:03:34,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 552 events. 284/552 cut-off events. For 1604/1608 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2494 event pairs, 22 based on Foata normal form. 74/626 useless extension candidates. Maximal degree in co-relation 2478. Up to 228 conditions per place. [2023-08-30 03:03:34,292 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 53 selfloop transitions, 7 changer transitions 22/84 dead transitions. [2023-08-30 03:03:34,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 774 flow [2023-08-30 03:03:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:03:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:03:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-30 03:03:34,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068783068783069 [2023-08-30 03:03:34,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-30 03:03:34,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-30 03:03:34,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:34,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-30 03:03:34,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states 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 03:03:34,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:34,300 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:34,300 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 307 flow. Second operand 6 states and 769 transitions. [2023-08-30 03:03:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 774 flow [2023-08-30 03:03:34,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 714 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-08-30 03:03:34,304 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 315 flow [2023-08-30 03:03:34,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-30 03:03:34,304 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2023-08-30 03:03:34,305 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 315 flow [2023-08-30 03:03:34,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:34,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:34,305 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 03:03:34,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 03:03:34,305 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:34,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash -243486213, now seen corresponding path program 1 times [2023-08-30 03:03:34,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:34,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216584810] [2023-08-30 03:03:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:03:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216584810] [2023-08-30 03:03:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216584810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:36,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:03:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139781917] [2023-08-30 03:03:36,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:36,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:03:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:03:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:03:37,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 315 [2023-08-30 03:03:37,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 315 flow. Second operand has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 03:03:37,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:37,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 315 [2023-08-30 03:03:37,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:37,399 INFO L130 PetriNetUnfolder]: 200/413 cut-off events. [2023-08-30 03:03:37,399 INFO L131 PetriNetUnfolder]: For 1215/1219 co-relation queries the response was YES. [2023-08-30 03:03:37,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 413 events. 200/413 cut-off events. For 1215/1219 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1659 event pairs, 34 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 2011. Up to 221 conditions per place. [2023-08-30 03:03:37,400 INFO L137 encePairwiseOnDemand]: 307/315 looper letters, 45 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2023-08-30 03:03:37,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 576 flow [2023-08-30 03:03:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:03:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:03:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2023-08-30 03:03:37,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34325396825396826 [2023-08-30 03:03:37,402 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2023-08-30 03:03:37,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2023-08-30 03:03:37,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:37,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2023-08-30 03:03:37,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 03:03:37,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,405 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,405 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 315 flow. Second operand 8 states and 865 transitions. [2023-08-30 03:03:37,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 576 flow [2023-08-30 03:03:37,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 509 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-30 03:03:37,410 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 342 flow [2023-08-30 03:03:37,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=342, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2023-08-30 03:03:37,410 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-30 03:03:37,410 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 342 flow [2023-08-30 03:03:37,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 03:03:37,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:37,411 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 03:03:37,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 03:03:37,411 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:37,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash 830080289, now seen corresponding path program 1 times [2023-08-30 03:03:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607891720] [2023-08-30 03:03:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:03:37,749 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 03:03:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:03:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607891720] [2023-08-30 03:03:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607891720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:03:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:03:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:03:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62562925] [2023-08-30 03:03:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:03:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:03:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:03:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:03:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:03:37,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-30 03:03:37,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:03:37,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-30 03:03:37,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:03:37,913 INFO L130 PetriNetUnfolder]: 166/344 cut-off events. [2023-08-30 03:03:37,913 INFO L131 PetriNetUnfolder]: For 1116/1120 co-relation queries the response was YES. [2023-08-30 03:03:37,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 344 events. 166/344 cut-off events. For 1116/1120 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1363 event pairs, 16 based on Foata normal form. 26/370 useless extension candidates. Maximal degree in co-relation 1651. Up to 130 conditions per place. [2023-08-30 03:03:37,914 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 53 selfloop transitions, 10 changer transitions 11/76 dead transitions. [2023-08-30 03:03:37,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 76 transitions, 747 flow [2023-08-30 03:03:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:03:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:03:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-30 03:03:37,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3981859410430839 [2023-08-30 03:03:37,916 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-30 03:03:37,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-30 03:03:37,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:03:37,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-30 03:03:37,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,918 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,918 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 342 flow. Second operand 7 states and 878 transitions. [2023-08-30 03:03:37,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 76 transitions, 747 flow [2023-08-30 03:03:37,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 660 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-08-30 03:03:37,921 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 304 flow [2023-08-30 03:03:37,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-08-30 03:03:37,921 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-30 03:03:37,921 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 304 flow [2023-08-30 03:03:37,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:03:37,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:03:37,922 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 03:03:37,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 03:03:37,922 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:03:37,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:03:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2098302538, now seen corresponding path program 1 times [2023-08-30 03:03:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:03:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080292347] [2023-08-30 03:03:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:03:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:03:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:03:38,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:03:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:03:38,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:03:38,187 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:03:38,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-30 03:03:38,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-30 03:03:38,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-30 03:03:38,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-30 03:03:38,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-30 03:03:38,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-30 03:03:38,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-30 03:03:38,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-30 03:03:38,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-30 03:03:38,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-30 03:03:38,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-30 03:03:38,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-30 03:03:38,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-30 03:03:38,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-30 03:03:38,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-30 03:03:38,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-30 03:03:38,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-30 03:03:38,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-30 03:03:38,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-30 03:03:38,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-30 03:03:38,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-30 03:03:38,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-30 03:03:38,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-30 03:03:38,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 03:03:38,204 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 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 03:03:38,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:03:38,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:03:38,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:03:38 BasicIcfg [2023-08-30 03:03:38,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:03:38,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:03:38,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:03:38,307 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:03:38,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:02:00" (3/4) ... [2023-08-30 03:03:38,310 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:03:38,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:03:38,311 INFO L158 Benchmark]: Toolchain (without parser) took 100233.25ms. Allocated memory was 77.6MB in the beginning and 11.7GB in the end (delta: 11.7GB). Free memory was 53.6MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2023-08-30 03:03:38,311 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:03:38,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.18ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 47.2MB in the end (delta: 6.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-08-30 03:03:38,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.78ms. Allocated memory is still 77.6MB. Free memory was 47.2MB in the beginning and 44.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:03:38,312 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 77.6MB. Free memory was 44.7MB in the beginning and 42.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:03:38,312 INFO L158 Benchmark]: RCFGBuilder took 1446.62ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.3MB in the end (delta: -14.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2023-08-30 03:03:38,312 INFO L158 Benchmark]: TraceAbstraction took 98020.48ms. Allocated memory was 100.7MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 55.8MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2023-08-30 03:03:38,313 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 11.7GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:03:38,317 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.20ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.18ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 47.2MB in the end (delta: 6.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.78ms. Allocated memory is still 77.6MB. Free memory was 47.2MB in the beginning and 44.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 77.6MB. Free memory was 44.7MB in the beginning and 42.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1446.62ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.3MB in the end (delta: -14.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 98020.48ms. Allocated memory was 100.7MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 55.8MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 11.7GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 176 PlacesBefore, 80 PlacesAfterwards, 168 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 31207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8750, independent: 8192, independent conditional: 0, independent unconditional: 8192, dependent: 558, dependent conditional: 0, dependent unconditional: 558, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2782, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8750, independent: 5511, independent conditional: 0, independent unconditional: 5511, dependent: 457, dependent conditional: 0, dependent unconditional: 457, unknown: 2782, unknown conditional: 0, unknown unconditional: 2782] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 487, Positive conditional cache size: 0, Positive unconditional cache size: 487, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-2, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=-1, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 97.7s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 71.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3068 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2408 mSDsluCounter, 1226 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7743 IncrementalHoareTripleChecker+Invalid, 8273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 101 mSDtfsCounter, 7743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=18, InterpolantAutomatonStates: 147, 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, 1.1s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 5510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 03:03:38,359 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/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --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 03:03:41,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:03:41,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:03:41,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:03:41,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:03:41,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:03:41,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:03:41,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:03:41,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:03:41,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:03:41,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:03:41,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:03:41,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:03:41,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:03:41,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:03:41,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:03:41,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:03:41,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:03:41,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:03:41,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:03:41,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:03:41,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:03:41,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:03:41,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:03:41,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:03:41,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:03:41,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:03:41,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:03:41,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:03:41,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:03:41,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:03:41,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:03:41,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:03:41,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:03:41,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:03:41,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:03:41,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:03:41,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:03:41,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:03:41,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:03:41,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:03:41,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:03:41,272 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:03:41,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:03:41,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:03:41,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:03:41,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:03:41,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:03:41,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:03:41,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:03:41,277 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:03:41,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:03:41,278 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:03:41,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:03:41,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:03:41,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:03:41,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:03:41,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:03:41,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:03:41,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:03:41,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:03:41,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:03:41,280 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:03:41,280 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:03:41,280 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:03:41,280 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:03:41,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:03:41,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:03:41,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:03:41,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:03:41,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:03:41,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:03:41,282 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:03:41,282 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:03:41,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:03:41,283 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:03:41,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:03:41,283 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:03:41,283 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:03:41,283 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 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 03:03:41,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:03:41,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:03:41,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:03:41,632 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:03:41,632 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:03:41,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 03:03:42,895 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:03:43,153 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:03:43,154 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2023-08-30 03:03:43,175 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584cb4b50/a22fd7e9eceb4d6ea8f08809ce93e0ae/FLAGd0e4e0e71 [2023-08-30 03:03:43,192 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584cb4b50/a22fd7e9eceb4d6ea8f08809ce93e0ae [2023-08-30 03:03:43,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:03:43,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:03:43,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:03:43,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:03:43,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:03:43,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1051b07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43, skipping insertion in model container [2023-08-30 03:03:43,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:03:43,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:03:43,381 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/safe000_power.opt.i[951,964] [2023-08-30 03:03:43,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:03:43,619 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:03:43,630 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/safe000_power.opt.i[951,964] [2023-08-30 03:03:43,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:03:43,753 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:03:43,753 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:03:43,759 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:03:43,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43 WrapperNode [2023-08-30 03:03:43,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:03:43,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:03:43,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:03:43,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:03:43,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,842 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-08-30 03:03:43,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:03:43,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:03:43,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:03:43,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:03:43,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:03:43,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:03:43,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:03:43,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:03:43,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (1/1) ... [2023-08-30 03:03:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:03:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:03:43,950 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 03:03:43,966 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 03:03:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:03:43,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:03:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:03:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:03:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:03:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:03:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:03:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:03:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:03:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:03:43,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:03:43,998 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 03:03:44,238 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:03:44,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:03:44,915 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:03:45,438 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:03:45,439 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:03:45,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:03:45 BoogieIcfgContainer [2023-08-30 03:03:45,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:03:45,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:03:45,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:03:45,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:03:45,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:03:43" (1/3) ... [2023-08-30 03:03:45,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7bbe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:03:45, skipping insertion in model container [2023-08-30 03:03:45,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:03:43" (2/3) ... [2023-08-30 03:03:45,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7bbe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:03:45, skipping insertion in model container [2023-08-30 03:03:45,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:03:45" (3/3) ... [2023-08-30 03:03:45,449 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-08-30 03:03:45,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:03:45,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-30 03:03:45,466 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:03:45,599 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:03:45,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-30 03:03:45,700 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-30 03:03:45,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:03:45,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 03:03:45,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-30 03:03:45,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-30 03:03:45,716 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:03:45,724 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-30 03:03:45,727 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-30 03:03:45,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-30 03:03:45,762 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-30 03:03:45,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:03:45,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 03:03:45,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-30 03:04:05,997 INFO L134 LiptonReduction]: Checked pairs total: 30947 [2023-08-30 03:04:05,997 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-08-30 03:04:06,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:04:06,019 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;@7673ebe1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:04:06,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-30 03:04:06,020 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:04:06,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:04:06,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:06,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:04:06,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:06,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1123, now seen corresponding path program 1 times [2023-08-30 03:04:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735667936] [2023-08-30 03:04:06,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:06,035 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 03:04:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:06,038 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 03:04:06,040 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 03:04:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:06,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:04:06,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:06,146 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 03:04:06,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:06,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735667936] [2023-08-30 03:04:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735667936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:04:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823921864] [2023-08-30 03:04:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:06,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:04:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:04:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:04:06,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-30 03:04:06,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:06,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:06,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-30 03:04:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:12,322 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-30 03:04:12,323 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 03:04:12,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3439. Compared 317009 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-30 03:04:12,600 INFO L137 encePairwiseOnDemand]: 300/321 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-30 03:04:12,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-30 03:04:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:04:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:04:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2023-08-30 03:04:12,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49221183800623053 [2023-08-30 03:04:12,616 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2023-08-30 03:04:12,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2023-08-30 03:04:12,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:12,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2023-08-30 03:04:12,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:12,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states 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 03:04:12,634 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states 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 03:04:12,635 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 316 transitions. [2023-08-30 03:04:12,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-30 03:04:12,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:04:12,649 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-30 03:04:12,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-30 03:04:12,656 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-30 03:04:12,656 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-30 03:04:12,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:12,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:12,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:04:12,673 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 03:04:12,869 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 03:04:12,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:12,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 34424004, now seen corresponding path program 1 times [2023-08-30 03:04:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:12,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250537085] [2023-08-30 03:04:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:12,872 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 03:04:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:12,873 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 03:04:12,879 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 03:04:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:12,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:04:12,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:04:12,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:12,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250537085] [2023-08-30 03:04:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250537085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:04:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606660739] [2023-08-30 03:04:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:04:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:04:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:04:12,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:04:12,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:13,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:13,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:04:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:17,515 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-30 03:04:17,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:04:17,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3081. Compared 302963 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-30 03:04:17,721 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-30 03:04:17,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-30 03:04:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:04:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:04:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-30 03:04:17,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936656282450673 [2023-08-30 03:04:17,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-30 03:04:17,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-30 03:04:17,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:17,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-30 03:04:17,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:17,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:17,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:17,735 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 452 transitions. [2023-08-30 03:04:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-30 03:04:17,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:04:17,737 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-30 03:04:17,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-30 03:04:17,738 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-30 03:04:17,739 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-30 03:04:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:17,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:17,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:04:17,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-30 03:04:17,950 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 03:04:17,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:17,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145048, now seen corresponding path program 1 times [2023-08-30 03:04:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510719708] [2023-08-30 03:04:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:17,952 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 03:04:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:17,953 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 03:04:17,957 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 03:04:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:18,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 03:04:18,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:18,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 03:04:18,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:18,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510719708] [2023-08-30 03:04:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510719708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:18,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:18,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:04:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097864181] [2023-08-30 03:04:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:18,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:04:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:04:18,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:04:18,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-30 03:04:18,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:18,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:18,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-30 03:04:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:23,340 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-30 03:04:23,340 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-30 03:04:23,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4161. Compared 381975 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-30 03:04:23,803 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-30 03:04:23,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-30 03:04:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:04:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:04:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-30 03:04:23,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2023-08-30 03:04:23,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-30 03:04:23,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-30 03:04:23,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:23,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-30 03:04:23,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:23,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:23,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:23,811 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 453 transitions. [2023-08-30 03:04:23,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-30 03:04:23,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:04:23,814 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-30 03:04:23,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-30 03:04:23,816 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-30 03:04:23,816 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-30 03:04:23,816 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 03:04:23,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:23,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:04:23,834 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 03:04:24,031 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 03:04:24,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:24,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145050, now seen corresponding path program 1 times [2023-08-30 03:04:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059041504] [2023-08-30 03:04:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:24,033 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 03:04:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:24,034 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 03:04:24,036 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 03:04:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:24,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:04:24,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:24,469 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:04:24,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:04:24,535 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 03:04:24,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:24,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059041504] [2023-08-30 03:04:24,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059041504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:24,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:24,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:04:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105052960] [2023-08-30 03:04:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:24,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:04:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:04:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:04:24,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-30 03:04:24,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:24,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:24,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-30 03:04:24,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:28,011 INFO L130 PetriNetUnfolder]: 18173/25645 cut-off events. [2023-08-30 03:04:28,012 INFO L131 PetriNetUnfolder]: For 6146/6261 co-relation queries the response was YES. [2023-08-30 03:04:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 25645 events. 18173/25645 cut-off events. For 6146/6261 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 173052 event pairs, 10086 based on Foata normal form. 0/17231 useless extension candidates. Maximal degree in co-relation 58994. Up to 13595 conditions per place. [2023-08-30 03:04:28,159 INFO L137 encePairwiseOnDemand]: 310/321 looper letters, 68 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-30 03:04:28,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 347 flow [2023-08-30 03:04:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:04:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:04:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-30 03:04:28,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44963655244029077 [2023-08-30 03:04:28,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-30 03:04:28,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-30 03:04:28,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:28,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-30 03:04:28,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:28,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:28,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:28,167 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 3 states and 433 transitions. [2023-08-30 03:04:28,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 347 flow [2023-08-30 03:04:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:04:28,194 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 154 flow [2023-08-30 03:04:28,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-30 03:04:28,195 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-30 03:04:28,196 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 154 flow [2023-08-30 03:04:28,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:28,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:28,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:04:28,208 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 03:04:28,405 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 03:04:28,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:28,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1067145051, now seen corresponding path program 1 times [2023-08-30 03:04:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337205177] [2023-08-30 03:04:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:28,406 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 03:04:28,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:28,407 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 03:04:28,408 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 03:04:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:28,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:04:28,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:28,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:04:28,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:04:28,596 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 03:04:28,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:28,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337205177] [2023-08-30 03:04:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337205177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:28,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:04:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801339761] [2023-08-30 03:04:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:28,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:04:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:28,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:04:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:04:28,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-30 03:04:28,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:28,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:28,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-30 03:04:28,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:29,621 INFO L130 PetriNetUnfolder]: 5199/7521 cut-off events. [2023-08-30 03:04:29,621 INFO L131 PetriNetUnfolder]: For 2867/2902 co-relation queries the response was YES. [2023-08-30 03:04:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19250 conditions, 7521 events. 5199/7521 cut-off events. For 2867/2902 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42931 event pairs, 4639 based on Foata normal form. 1868/8235 useless extension candidates. Maximal degree in co-relation 19244. Up to 7464 conditions per place. [2023-08-30 03:04:29,657 INFO L137 encePairwiseOnDemand]: 311/321 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-30 03:04:29,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 214 flow [2023-08-30 03:04:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:04:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:04:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-30 03:04:29,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43198338525441327 [2023-08-30 03:04:29,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-30 03:04:29,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-30 03:04:29,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:29,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-30 03:04:29,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:29,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:29,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 03:04:29,665 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 154 flow. Second operand 3 states and 416 transitions. [2023-08-30 03:04:29,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 214 flow [2023-08-30 03:04:29,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:04:29,669 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 132 flow [2023-08-30 03:04:29,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-30 03:04:29,671 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -30 predicate places. [2023-08-30 03:04:29,671 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 132 flow [2023-08-30 03:04:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:29,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:29,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:04:29,687 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 03:04:29,881 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 03:04:29,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:29,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1568269816, now seen corresponding path program 1 times [2023-08-30 03:04:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964224324] [2023-08-30 03:04:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:29,882 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 03:04:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:29,883 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 03:04:29,885 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 03:04:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:29,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:04:29,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:30,021 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 03:04:30,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:30,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964224324] [2023-08-30 03:04:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964224324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:04:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419235533] [2023-08-30 03:04:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:04:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:04:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:04:30,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:30,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:30,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:30,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:30,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:30,707 INFO L130 PetriNetUnfolder]: 1879/3031 cut-off events. [2023-08-30 03:04:30,708 INFO L131 PetriNetUnfolder]: For 1141/1144 co-relation queries the response was YES. [2023-08-30 03:04:30,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 3031 events. 1879/3031 cut-off events. For 1141/1144 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17105 event pairs, 680 based on Foata normal form. 94/2714 useless extension candidates. Maximal degree in co-relation 7588. Up to 2535 conditions per place. [2023-08-30 03:04:30,720 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 56 selfloop transitions, 4 changer transitions 29/91 dead transitions. [2023-08-30 03:04:30,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 466 flow [2023-08-30 03:04:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:04:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:04:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-30 03:04:30,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41682242990654206 [2023-08-30 03:04:30,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-30 03:04:30,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-30 03:04:30,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:30,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-30 03:04:30,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:30,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:30,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:30,730 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 132 flow. Second operand 5 states and 669 transitions. [2023-08-30 03:04:30,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 466 flow [2023-08-30 03:04:30,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:04:30,733 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 171 flow [2023-08-30 03:04:30,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-30 03:04:30,734 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-30 03:04:30,734 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 171 flow [2023-08-30 03:04:30,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:30,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:30,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:04:30,751 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 03:04:30,945 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 03:04:30,945 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:30,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1325306276, now seen corresponding path program 1 times [2023-08-30 03:04:30,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:30,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869097929] [2023-08-30 03:04:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:30,946 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 03:04:30,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:30,948 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 03:04:30,950 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 03:04:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:31,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:04:31,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:04:31,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:31,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869097929] [2023-08-30 03:04:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869097929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:31,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:31,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:04:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995653326] [2023-08-30 03:04:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:31,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:04:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:04:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:04:31,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:31,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:31,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:31,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:31,600 INFO L130 PetriNetUnfolder]: 456/859 cut-off events. [2023-08-30 03:04:31,600 INFO L131 PetriNetUnfolder]: For 640/643 co-relation queries the response was YES. [2023-08-30 03:04:31,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 859 events. 456/859 cut-off events. For 640/643 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3968 event pairs, 137 based on Foata normal form. 51/842 useless extension candidates. Maximal degree in co-relation 2491. Up to 329 conditions per place. [2023-08-30 03:04:31,603 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 67 selfloop transitions, 7 changer transitions 26/102 dead transitions. [2023-08-30 03:04:31,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 589 flow [2023-08-30 03:04:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:04:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:04:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-30 03:04:31,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158878504672897 [2023-08-30 03:04:31,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-30 03:04:31,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-30 03:04:31,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:31,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-30 03:04:31,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:31,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states 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 03:04:31,612 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states 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 03:04:31,612 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 171 flow. Second operand 6 states and 801 transitions. [2023-08-30 03:04:31,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 589 flow [2023-08-30 03:04:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 581 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 03:04:31,616 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 223 flow [2023-08-30 03:04:31,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-30 03:04:31,617 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-30 03:04:31,617 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 223 flow [2023-08-30 03:04:31,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:31,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:31,618 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 03:04:31,632 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 03:04:31,830 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 03:04:31,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:31,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -768589693, now seen corresponding path program 1 times [2023-08-30 03:04:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:31,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959493390] [2023-08-30 03:04:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:31,832 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 03:04:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:31,833 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 03:04:31,836 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 03:04:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:31,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:04:31,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:32,041 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 03:04:32,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:32,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959493390] [2023-08-30 03:04:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959493390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:32,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:32,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:04:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540191017] [2023-08-30 03:04:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:32,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:04:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:04:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:04:32,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:32,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:32,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:32,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:32,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:32,488 INFO L130 PetriNetUnfolder]: 255/477 cut-off events. [2023-08-30 03:04:32,488 INFO L131 PetriNetUnfolder]: For 605/608 co-relation queries the response was YES. [2023-08-30 03:04:32,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 477 events. 255/477 cut-off events. For 605/608 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1919 event pairs, 95 based on Foata normal form. 12/481 useless extension candidates. Maximal degree in co-relation 1484. Up to 215 conditions per place. [2023-08-30 03:04:32,490 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 55 selfloop transitions, 10 changer transitions 13/80 dead transitions. [2023-08-30 03:04:32,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 495 flow [2023-08-30 03:04:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:04:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:04:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-30 03:04:32,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40186915887850466 [2023-08-30 03:04:32,493 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-30 03:04:32,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-30 03:04:32,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:32,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-30 03:04:32,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:32,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 03:04:32,499 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 03:04:32,500 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 223 flow. Second operand 7 states and 903 transitions. [2023-08-30 03:04:32,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 495 flow [2023-08-30 03:04:32,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 457 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-30 03:04:32,504 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 181 flow [2023-08-30 03:04:32,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-30 03:04:32,505 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-30 03:04:32,505 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 181 flow [2023-08-30 03:04:32,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:32,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:32,506 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 03:04:32,518 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 03:04:32,717 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 03:04:32,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:32,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash -505335550, now seen corresponding path program 1 times [2023-08-30 03:04:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968346632] [2023-08-30 03:04:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:32,719 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 03:04:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:32,721 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 03:04:32,724 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 03:04:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:32,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 03:04:32,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:33,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 03:04:35,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-30 03:04:35,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:04:35,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-08-30 03:04:35,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:04:35,312 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 03:04:35,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:35,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968346632] [2023-08-30 03:04:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968346632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:35,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:35,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:04:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304661603] [2023-08-30 03:04:35,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:35,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:04:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:04:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:04:35,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 321 [2023-08-30 03:04:35,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:35,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:35,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 321 [2023-08-30 03:04:35,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:36,015 INFO L130 PetriNetUnfolder]: 296/574 cut-off events. [2023-08-30 03:04:36,015 INFO L131 PetriNetUnfolder]: For 655/667 co-relation queries the response was YES. [2023-08-30 03:04:36,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 574 events. 296/574 cut-off events. For 655/667 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2646 event pairs, 47 based on Foata normal form. 3/574 useless extension candidates. Maximal degree in co-relation 1804. Up to 229 conditions per place. [2023-08-30 03:04:36,018 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 76 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2023-08-30 03:04:36,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 617 flow [2023-08-30 03:04:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:04:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:04:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-30 03:04:36,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3965287049399199 [2023-08-30 03:04:36,021 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-30 03:04:36,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-30 03:04:36,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:36,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-30 03:04:36,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:36,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 03:04:36,027 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 03:04:36,027 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 181 flow. Second operand 7 states and 891 transitions. [2023-08-30 03:04:36,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 617 flow [2023-08-30 03:04:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 525 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-30 03:04:36,031 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-08-30 03:04:36,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 03:04:36,032 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-30 03:04:36,032 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-08-30 03:04:36,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:36,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:36,033 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 03:04:36,045 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 03:04:36,245 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 03:04:36,245 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:36,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash -602864835, now seen corresponding path program 1 times [2023-08-30 03:04:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621969914] [2023-08-30 03:04:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:36,246 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 03:04:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:36,247 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 03:04:36,249 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 03:04:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:36,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:04:36,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:36,482 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 03:04:36,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:36,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621969914] [2023-08-30 03:04:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621969914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:36,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:04:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506701580] [2023-08-30 03:04:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:04:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:04:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:04:36,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:36,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:36,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:36,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:36,858 INFO L130 PetriNetUnfolder]: 692/1232 cut-off events. [2023-08-30 03:04:36,859 INFO L131 PetriNetUnfolder]: For 1607/1607 co-relation queries the response was YES. [2023-08-30 03:04:36,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1232 events. 692/1232 cut-off events. For 1607/1607 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6026 event pairs, 134 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 4250. Up to 592 conditions per place. [2023-08-30 03:04:36,864 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 94 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-30 03:04:36,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 660 flow [2023-08-30 03:04:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:04:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:04:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-30 03:04:36,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182242990654206 [2023-08-30 03:04:36,867 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-30 03:04:36,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-30 03:04:36,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:36,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-30 03:04:36,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 03:04:36,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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 03:04:36,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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 03:04:36,871 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 4 states and 537 transitions. [2023-08-30 03:04:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 660 flow [2023-08-30 03:04:36,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:04:36,877 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 236 flow [2023-08-30 03:04:36,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-30 03:04:36,878 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-30 03:04:36,878 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 236 flow [2023-08-30 03:04:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:36,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:36,878 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 03:04:36,887 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 03:04:37,079 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 03:04:37,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:37,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash 845313555, now seen corresponding path program 1 times [2023-08-30 03:04:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:37,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354433295] [2023-08-30 03:04:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:04:37,080 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 03:04:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:37,081 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 03:04:37,082 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 03:04:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:04:37,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:04:37,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:39,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 133 [2023-08-30 03:04:39,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-08-30 03:04:39,240 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 03:04:39,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:39,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354433295] [2023-08-30 03:04:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354433295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:39,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:39,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:04:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822518023] [2023-08-30 03:04:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:39,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:04:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:04:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:04:39,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:39,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 03:04:39,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:39,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:39,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:39,563 INFO L130 PetriNetUnfolder]: 540/1023 cut-off events. [2023-08-30 03:04:39,563 INFO L131 PetriNetUnfolder]: For 1372/1409 co-relation queries the response was YES. [2023-08-30 03:04:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 1023 events. 540/1023 cut-off events. For 1372/1409 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5461 event pairs, 123 based on Foata normal form. 7/1019 useless extension candidates. Maximal degree in co-relation 3708. Up to 753 conditions per place. [2023-08-30 03:04:39,567 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 59 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2023-08-30 03:04:39,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 483 flow [2023-08-30 03:04:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:04:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:04:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-30 03:04:39,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405607476635514 [2023-08-30 03:04:39,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-30 03:04:39,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-30 03:04:39,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:39,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-30 03:04:39,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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 03:04:39,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:39,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:39,573 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 236 flow. Second operand 5 states and 651 transitions. [2023-08-30 03:04:39,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 483 flow [2023-08-30 03:04:39,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:04:39,580 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 258 flow [2023-08-30 03:04:39,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-30 03:04:39,580 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-30 03:04:39,580 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 258 flow [2023-08-30 03:04:39,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 03:04:39,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:39,581 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 03:04:39,594 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 03:04:39,794 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 03:04:39,794 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:39,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1704153217, now seen corresponding path program 2 times [2023-08-30 03:04:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847062350] [2023-08-30 03:04:39,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:04:39,795 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 03:04:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:39,797 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 03:04:39,798 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 03:04:39,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:04:39,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:04:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:04:39,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:39,992 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 03:04:39,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:39,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847062350] [2023-08-30 03:04:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847062350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:04:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053286587] [2023-08-30 03:04:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:39,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:04:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:04:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:04:40,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:40,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:40,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:40,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:40,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:40,294 INFO L130 PetriNetUnfolder]: 898/1634 cut-off events. [2023-08-30 03:04:40,294 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2023-08-30 03:04:40,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 1634 events. 898/1634 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8649 event pairs, 252 based on Foata normal form. 2/1636 useless extension candidates. Maximal degree in co-relation 6343. Up to 1030 conditions per place. [2023-08-30 03:04:40,302 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 83 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2023-08-30 03:04:40,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 658 flow [2023-08-30 03:04:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:04:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:04:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-30 03:04:40,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127725856697819 [2023-08-30 03:04:40,304 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-30 03:04:40,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-30 03:04:40,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:40,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-30 03:04:40,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 03:04:40,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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 03:04:40,308 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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 03:04:40,308 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 258 flow. Second operand 4 states and 530 transitions. [2023-08-30 03:04:40,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 658 flow [2023-08-30 03:04:40,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:04:40,317 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 258 flow [2023-08-30 03:04:40,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-30 03:04:40,317 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -19 predicate places. [2023-08-30 03:04:40,317 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 258 flow [2023-08-30 03:04:40,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:40,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:40,318 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 03:04:40,326 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 03:04:40,518 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 03:04:40,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:40,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1521279165, now seen corresponding path program 3 times [2023-08-30 03:04:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683274114] [2023-08-30 03:04:40,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:04:40,520 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 03:04:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:40,521 INFO L229 MonitoredProcess]: Starting monitored process 14 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 03:04:40,522 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 (14)] Waiting until timeout for monitored process [2023-08-30 03:04:40,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:04:40,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:04:40,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:04:40,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:04:40,732 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 03:04:40,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:04:40,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:04:40,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683274114] [2023-08-30 03:04:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683274114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:04:40,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:04:40,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:04:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346812595] [2023-08-30 03:04:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:04:40,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:04:40,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:04:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:04:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:04:40,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:04:40,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:40,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:04:40,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:04:40,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:04:41,155 INFO L130 PetriNetUnfolder]: 1232/2331 cut-off events. [2023-08-30 03:04:41,156 INFO L131 PetriNetUnfolder]: For 4365/4365 co-relation queries the response was YES. [2023-08-30 03:04:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 2331 events. 1232/2331 cut-off events. For 4365/4365 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14290 event pairs, 269 based on Foata normal form. 2/2333 useless extension candidates. Maximal degree in co-relation 8975. Up to 973 conditions per place. [2023-08-30 03:04:41,166 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 128 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2023-08-30 03:04:41,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 133 transitions, 952 flow [2023-08-30 03:04:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:04:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:04:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-30 03:04:41,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4193146417445483 [2023-08-30 03:04:41,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-30 03:04:41,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-30 03:04:41,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:04:41,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-30 03:04:41,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:04:41,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:41,173 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 03:04:41,173 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 258 flow. Second operand 5 states and 673 transitions. [2023-08-30 03:04:41,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 133 transitions, 952 flow [2023-08-30 03:04:41,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 133 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:04:41,187 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 280 flow [2023-08-30 03:04:41,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-30 03:04:41,188 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -15 predicate places. [2023-08-30 03:04:41,188 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 280 flow [2023-08-30 03:04:41,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 03:04:41,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:04:41,189 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 03:04:41,200 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 (14)] Forceful destruction successful, exit code 0 [2023-08-30 03:04:41,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 03:04:41,397 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 03:04:41,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:04:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -225051505, now seen corresponding path program 4 times [2023-08-30 03:04:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:04:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849440243] [2023-08-30 03:04:41,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:04:41,398 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 03:04:41,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:04:41,399 INFO L229 MonitoredProcess]: Starting monitored process 15 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 03:04:41,400 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 (15)] Waiting until timeout for monitored process [2023-08-30 03:04:41,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:04:41,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:04:41,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:04:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:04:41,862 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:04:41,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:04:41,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-30 03:04:41,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-30 03:04:41,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-30 03:04:41,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-30 03:04:41,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-30 03:04:41,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-30 03:04:41,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-30 03:04:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-30 03:04:41,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-30 03:04:41,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-30 03:04:41,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-30 03:04:41,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-30 03:04:41,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-30 03:04:41,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-30 03:04:41,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-30 03:04:41,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-30 03:04:41,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-30 03:04:41,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-30 03:04:41,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-30 03:04:41,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-30 03:04:41,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-30 03:04:41,894 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 (15)] Forceful destruction successful, exit code 0 [2023-08-30 03:04:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 03:04:42,090 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:04:42,095 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:04:42,095 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:04:42,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:04:42 BasicIcfg [2023-08-30 03:04:42,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:04:42,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:04:42,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:04:42,188 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:04:42,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:03:45" (3/4) ... [2023-08-30 03:04:42,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:04:42,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:04:42,191 INFO L158 Benchmark]: Toolchain (without parser) took 58996.78ms. Allocated memory was 71.3MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 46.9MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-08-30 03:04:42,192 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:04:42,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.82ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 70.7MB in the end (delta: -24.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-08-30 03:04:42,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.57ms. Allocated memory is still 98.6MB. Free memory was 70.7MB in the beginning and 68.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:04:42,193 INFO L158 Benchmark]: Boogie Preprocessor took 72.42ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 65.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:04:42,193 INFO L158 Benchmark]: RCFGBuilder took 1521.88ms. Allocated memory was 98.6MB in the beginning and 134.2MB in the end (delta: 35.7MB). Free memory was 65.6MB in the beginning and 73.2MB in the end (delta: -7.5MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2023-08-30 03:04:42,193 INFO L158 Benchmark]: TraceAbstraction took 56744.21ms. Allocated memory was 134.2MB in the beginning and 9.0GB in the end (delta: 8.8GB). Free memory was 73.2MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 03:04:42,193 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 9.0GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:04:42,195 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.23ms. Allocated memory is still 71.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.82ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.6MB in the beginning and 70.7MB in the end (delta: -24.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.57ms. Allocated memory is still 98.6MB. Free memory was 70.7MB in the beginning and 68.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.42ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 65.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1521.88ms. Allocated memory was 98.6MB in the beginning and 134.2MB in the end (delta: 35.7MB). Free memory was 65.6MB in the beginning and 73.2MB in the end (delta: -7.5MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 56744.21ms. Allocated memory was 134.2MB in the beginning and 9.0GB in the end (delta: 8.8GB). Free memory was 73.2MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 9.0GB. Free memory was 7.4GB in the beginning and 7.4GB 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: 20.3s, 177 PlacesBefore, 80 PlacesAfterwards, 169 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 30947 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7532, independent: 6978, independent conditional: 0, independent unconditional: 6978, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2555, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7532, independent: 4506, independent conditional: 0, independent unconditional: 4506, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 2555, unknown conditional: 0, unknown unconditional: 2555] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=0, t1780={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=1, t1780={15:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=2, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={15:0}, t1781={5:0}, t1782={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 227 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2027 IncrementalHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 30 mSDtfsCounter, 2027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=13, InterpolantAutomatonStates: 57, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 833 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1789 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 03:04:42,226 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