./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053.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/mix053.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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:58:07,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:58:07,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:58:07,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:58:07,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:58:07,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:58:08,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:58:08,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:58:08,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:58:08,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:58:08,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:58:08,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:58:08,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:58:08,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:58:08,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:58:08,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:58:08,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:58:08,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:58:08,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:58:08,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:58:08,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:58:08,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:58:08,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:58:08,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:58:08,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:58:08,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:58:08,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:58:08,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:58:08,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:58:08,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:58:08,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:58:08,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:58:08,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:58:08,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:58:08,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:58:08,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:58:08,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:58:08,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:58:08,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:58:08,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:58:08,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:58:08,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:58:08,073 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:58:08,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:58:08,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:58:08,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:58:08,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:58:08,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:58:08,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:58:08,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:58:08,075 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:58:08,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:58:08,076 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:58:08,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:58:08,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:58:08,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:58:08,078 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:58:08,078 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:58:08,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:58:08,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:58:08,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:58:08,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:08,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:58:08,079 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:58:08,080 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:58:08,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:58:08,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:58:08,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:58:08,344 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:58:08,345 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:58:08,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-30 02:58:09,257 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:09,468 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:09,468 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-30 02:58:09,478 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfcefaa0/29068c37790a49bc83bd3a8d5666ec9d/FLAGc4e2aa2da [2023-08-30 02:58:09,490 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfcefaa0/29068c37790a49bc83bd3a8d5666ec9d [2023-08-30 02:58:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:09,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:09,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:09,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:09,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:09,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:09,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2767c7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09, skipping insertion in model container [2023-08-30 02:58:09,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:09,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:09,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:09,644 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/mix053.opt.i[944,957] [2023-08-30 02:58:09,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:09,841 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:09,850 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/mix053.opt.i[944,957] [2023-08-30 02:58:09,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:09,937 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:09,937 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:09,942 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:09,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09 WrapperNode [2023-08-30 02:58:09,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:09,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:09,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:09,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:09,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:09,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,001 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-30 02:58:10,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:10,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:10,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:10,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:10,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:10,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:10,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:10,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:10,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (1/1) ... [2023-08-30 02:58:10,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:10,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:58:10,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:58:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:58:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:58:10,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:58:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:58:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:10,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:10,122 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:10,264 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:10,279 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:10,574 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:10,655 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:10,655 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:10,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:10 BoogieIcfgContainer [2023-08-30 02:58:10,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:10,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:10,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:10,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:10,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:09" (1/3) ... [2023-08-30 02:58:10,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcab827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:10, skipping insertion in model container [2023-08-30 02:58:10,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:09" (2/3) ... [2023-08-30 02:58:10,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcab827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:10, skipping insertion in model container [2023-08-30 02:58:10,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:10" (3/3) ... [2023-08-30 02:58:10,663 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-08-30 02:58:10,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:10,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:58:10,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:10,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:10,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2023-08-30 02:58:10,791 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-30 02:58:10,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:10,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 02:58:10,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2023-08-30 02:58:10,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2023-08-30 02:58:10,801 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:10,807 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2023-08-30 02:58:10,808 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2023-08-30 02:58:10,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2023-08-30 02:58:10,826 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-30 02:58:10,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:10,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 02:58:10,834 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2023-08-30 02:58:14,605 INFO L134 LiptonReduction]: Checked pairs total: 7403 [2023-08-30 02:58:14,605 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-30 02:58:14,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:14,618 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;@1db5b663, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:14,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:58:14,619 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:58:14,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:14,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:14,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:14,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:14,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2023-08-30 02:58:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820875432] [2023-08-30 02:58:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820875432] [2023-08-30 02:58:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820875432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:14,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:14,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588998297] [2023-08-30 02:58:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:14,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:14,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:14,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 265 [2023-08-30 02:58:14,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:14,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 265 [2023-08-30 02:58:14,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:15,213 INFO L130 PetriNetUnfolder]: 3632/5068 cut-off events. [2023-08-30 02:58:15,213 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 02:58:15,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10161 conditions, 5068 events. 3632/5068 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 25401 event pairs, 3632 based on Foata normal form. 0/4416 useless extension candidates. Maximal degree in co-relation 10149. Up to 4990 conditions per place. [2023-08-30 02:58:15,237 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-30 02:58:15,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 118 flow [2023-08-30 02:58:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 284 transitions. [2023-08-30 02:58:15,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358490566037736 [2023-08-30 02:58:15,259 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 284 transitions. [2023-08-30 02:58:15,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 284 transitions. [2023-08-30 02:58:15,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:15,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 284 transitions. [2023-08-30 02:58:15,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,270 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,271 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 2 states and 284 transitions. [2023-08-30 02:58:15,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 118 flow [2023-08-30 02:58:15,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:15,275 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-30 02:58:15,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-30 02:58:15,278 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-30 02:58:15,279 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-30 02:58:15,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:15,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:15,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:58:15,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:15,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1113197595, now seen corresponding path program 1 times [2023-08-30 02:58:15,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:15,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053706249] [2023-08-30 02:58:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053706249] [2023-08-30 02:58:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053706249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:15,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663296938] [2023-08-30 02:58:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:15,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:15,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:15,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:15,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 265 [2023-08-30 02:58:15,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:15,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 265 [2023-08-30 02:58:15,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:15,996 INFO L130 PetriNetUnfolder]: 2891/4255 cut-off events. [2023-08-30 02:58:15,997 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:16,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 4255 events. 2891/4255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23015 event pairs, 668 based on Foata normal form. 0/3963 useless extension candidates. Maximal degree in co-relation 8349. Up to 2980 conditions per place. [2023-08-30 02:58:16,013 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-30 02:58:16,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 162 flow [2023-08-30 02:58:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 02:58:16,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157232704402516 [2023-08-30 02:58:16,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 02:58:16,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 02:58:16,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:16,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 02:58:16,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,021 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 410 transitions. [2023-08-30 02:58:16,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 162 flow [2023-08-30 02:58:16,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:16,022 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-30 02:58:16,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 02:58:16,023 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-30 02:58:16,023 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-30 02:58:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:16,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:16,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:58:16,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:16,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1825769827, now seen corresponding path program 1 times [2023-08-30 02:58:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870325054] [2023-08-30 02:58:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870325054] [2023-08-30 02:58:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870325054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:16,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:16,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162512988] [2023-08-30 02:58:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:16,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:16,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2023-08-30 02:58:16,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:16,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2023-08-30 02:58:16,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:16,949 INFO L130 PetriNetUnfolder]: 2075/2968 cut-off events. [2023-08-30 02:58:16,950 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-30 02:58:16,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6143 conditions, 2968 events. 2075/2968 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14199 event pairs, 435 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6139. Up to 2763 conditions per place. [2023-08-30 02:58:16,965 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-30 02:58:16,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 158 flow [2023-08-30 02:58:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-30 02:58:16,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226415094339623 [2023-08-30 02:58:16,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-30 02:58:16,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-30 02:58:16,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:16,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-30 02:58:16,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,972 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 6 states and 672 transitions. [2023-08-30 02:58:16,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 158 flow [2023-08-30 02:58:16,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:16,975 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 66 flow [2023-08-30 02:58:16,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-08-30 02:58:16,976 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -9 predicate places. [2023-08-30 02:58:16,976 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 66 flow [2023-08-30 02:58:16,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:16,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:58:16,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:16,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1825769880, now seen corresponding path program 1 times [2023-08-30 02:58:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180840241] [2023-08-30 02:58:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180840241] [2023-08-30 02:58:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180840241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:17,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:58:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907857551] [2023-08-30 02:58:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:17,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:17,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 265 [2023-08-30 02:58:17,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:17,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 265 [2023-08-30 02:58:17,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:17,914 INFO L130 PetriNetUnfolder]: 8983/12456 cut-off events. [2023-08-30 02:58:17,915 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-08-30 02:58:17,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25291 conditions, 12456 events. 8983/12456 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 64985 event pairs, 2787 based on Foata normal form. 540/12996 useless extension candidates. Maximal degree in co-relation 25287. Up to 6303 conditions per place. [2023-08-30 02:58:17,959 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 38 selfloop transitions, 7 changer transitions 27/72 dead transitions. [2023-08-30 02:58:17,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 312 flow [2023-08-30 02:58:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-30 02:58:17,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489811320754717 [2023-08-30 02:58:17,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-30 02:58:17,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-30 02:58:17,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:17,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-30 02:58:17,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,965 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 66 flow. Second operand 5 states and 649 transitions. [2023-08-30 02:58:17,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 312 flow [2023-08-30 02:58:17,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:17,967 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 129 flow [2023-08-30 02:58:17,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:58:17,967 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2023-08-30 02:58:17,968 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 129 flow [2023-08-30 02:58:17,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:17,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:58:17,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:17,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash -764283212, now seen corresponding path program 1 times [2023-08-30 02:58:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777269636] [2023-08-30 02:58:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777269636] [2023-08-30 02:58:18,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777269636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:18,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:18,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128511319] [2023-08-30 02:58:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:18,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:18,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:18,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 265 [2023-08-30 02:58:18,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 129 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 02:58:18,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:18,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 265 [2023-08-30 02:58:18,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:19,019 INFO L130 PetriNetUnfolder]: 8201/11478 cut-off events. [2023-08-30 02:58:19,019 INFO L131 PetriNetUnfolder]: For 8774/8774 co-relation queries the response was YES. [2023-08-30 02:58:19,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32709 conditions, 11478 events. 8201/11478 cut-off events. For 8774/8774 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 61085 event pairs, 767 based on Foata normal form. 496/11974 useless extension candidates. Maximal degree in co-relation 32702. Up to 5631 conditions per place. [2023-08-30 02:58:19,072 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 53 selfloop transitions, 11 changer transitions 41/105 dead transitions. [2023-08-30 02:58:19,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 625 flow [2023-08-30 02:58:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2023-08-30 02:58:19,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48733153638814014 [2023-08-30 02:58:19,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2023-08-30 02:58:19,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2023-08-30 02:58:19,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:19,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2023-08-30 02:58:19,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,080 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 129 flow. Second operand 7 states and 904 transitions. [2023-08-30 02:58:19,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 625 flow [2023-08-30 02:58:19,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 105 transitions, 579 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:19,096 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 219 flow [2023-08-30 02:58:19,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-30 02:58:19,097 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-30 02:58:19,097 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 219 flow [2023-08-30 02:58:19,098 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 02:58:19,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:19,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:19,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:58:19,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:19,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -764294744, now seen corresponding path program 1 times [2023-08-30 02:58:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224661084] [2023-08-30 02:58:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:19,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224661084] [2023-08-30 02:58:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224661084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:19,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:19,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229273318] [2023-08-30 02:58:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:19,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 265 [2023-08-30 02:58:19,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 219 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 02:58:19,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:19,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 265 [2023-08-30 02:58:19,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:20,027 INFO L130 PetriNetUnfolder]: 7637/10698 cut-off events. [2023-08-30 02:58:20,028 INFO L131 PetriNetUnfolder]: For 23534/23534 co-relation queries the response was YES. [2023-08-30 02:58:20,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34519 conditions, 10698 events. 7637/10698 cut-off events. For 23534/23534 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 55616 event pairs, 1367 based on Foata normal form. 400/11098 useless extension candidates. Maximal degree in co-relation 34507. Up to 5285 conditions per place. [2023-08-30 02:58:20,081 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 58 selfloop transitions, 17 changer transitions 34/109 dead transitions. [2023-08-30 02:58:20,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 109 transitions, 731 flow [2023-08-30 02:58:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 905 transitions. [2023-08-30 02:58:20,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48787061994609165 [2023-08-30 02:58:20,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 905 transitions. [2023-08-30 02:58:20,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 905 transitions. [2023-08-30 02:58:20,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:20,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 905 transitions. [2023-08-30 02:58:20,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,087 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,088 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 219 flow. Second operand 7 states and 905 transitions. [2023-08-30 02:58:20,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 109 transitions, 731 flow [2023-08-30 02:58:20,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 723 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:20,136 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 339 flow [2023-08-30 02:58:20,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-30 02:58:20,137 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-30 02:58:20,137 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 339 flow [2023-08-30 02:58:20,137 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 02:58:20,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:20,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:20,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:58:20,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:20,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2077020892, now seen corresponding path program 1 times [2023-08-30 02:58:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:20,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929896802] [2023-08-30 02:58:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929896802] [2023-08-30 02:58:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929896802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:20,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:20,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:20,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777350760] [2023-08-30 02:58:20,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:20,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:20,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:20,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:20,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-30 02:58:20,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:20,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-30 02:58:20,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:20,740 INFO L130 PetriNetUnfolder]: 4475/6672 cut-off events. [2023-08-30 02:58:20,741 INFO L131 PetriNetUnfolder]: For 18439/19225 co-relation queries the response was YES. [2023-08-30 02:58:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22757 conditions, 6672 events. 4475/6672 cut-off events. For 18439/19225 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 38556 event pairs, 851 based on Foata normal form. 764/7321 useless extension candidates. Maximal degree in co-relation 22739. Up to 4699 conditions per place. [2023-08-30 02:58:20,780 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 81 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-30 02:58:20,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 905 flow [2023-08-30 02:58:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-30 02:58:20,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950943396226415 [2023-08-30 02:58:20,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-30 02:58:20,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-30 02:58:20,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:20,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-30 02:58:20,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,786 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 339 flow. Second operand 5 states and 656 transitions. [2023-08-30 02:58:20,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 905 flow [2023-08-30 02:58:20,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 869 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-30 02:58:20,812 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 392 flow [2023-08-30 02:58:20,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=317, 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=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-30 02:58:20,812 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-30 02:58:20,812 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 392 flow [2023-08-30 02:58:20,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:20,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:20,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:58:20,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:20,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash -701042788, now seen corresponding path program 1 times [2023-08-30 02:58:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:20,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291708691] [2023-08-30 02:58:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:20,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291708691] [2023-08-30 02:58:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291708691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:20,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623093451] [2023-08-30 02:58:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:20,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:20,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 265 [2023-08-30 02:58:20,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:20,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:20,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 265 [2023-08-30 02:58:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:21,656 INFO L130 PetriNetUnfolder]: 6745/10201 cut-off events. [2023-08-30 02:58:21,656 INFO L131 PetriNetUnfolder]: For 29290/29740 co-relation queries the response was YES. [2023-08-30 02:58:21,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42345 conditions, 10201 events. 6745/10201 cut-off events. For 29290/29740 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 63190 event pairs, 2758 based on Foata normal form. 551/10620 useless extension candidates. Maximal degree in co-relation 42328. Up to 5156 conditions per place. [2023-08-30 02:58:21,702 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 56 selfloop transitions, 8 changer transitions 31/102 dead transitions. [2023-08-30 02:58:21,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 859 flow [2023-08-30 02:58:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-30 02:58:21,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018867924528302 [2023-08-30 02:58:21,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-30 02:58:21,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-30 02:58:21,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:21,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-30 02:58:21,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:21,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:21,708 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:21,708 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 392 flow. Second operand 5 states and 665 transitions. [2023-08-30 02:58:21,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 859 flow [2023-08-30 02:58:21,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 848 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 02:58:21,746 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 374 flow [2023-08-30 02:58:21,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-08-30 02:58:21,746 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2023-08-30 02:58:21,746 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 374 flow [2023-08-30 02:58:21,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:21,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:21,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:21,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:58:21,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:21,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1276682744, now seen corresponding path program 1 times [2023-08-30 02:58:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:21,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147323991] [2023-08-30 02:58:21,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:21,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147323991] [2023-08-30 02:58:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147323991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:21,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033552706] [2023-08-30 02:58:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:21,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-30 02:58:21,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 374 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 02:58:21,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:21,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-30 02:58:21,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:22,504 INFO L130 PetriNetUnfolder]: 3377/5371 cut-off events. [2023-08-30 02:58:22,504 INFO L131 PetriNetUnfolder]: For 15547/16152 co-relation queries the response was YES. [2023-08-30 02:58:22,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22240 conditions, 5371 events. 3377/5371 cut-off events. For 15547/16152 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 33146 event pairs, 356 based on Foata normal form. 782/6062 useless extension candidates. Maximal degree in co-relation 22220. Up to 2335 conditions per place. [2023-08-30 02:58:22,534 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 105 selfloop transitions, 15 changer transitions 6/138 dead transitions. [2023-08-30 02:58:22,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 138 transitions, 1308 flow [2023-08-30 02:58:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2023-08-30 02:58:22,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49326145552560646 [2023-08-30 02:58:22,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2023-08-30 02:58:22,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2023-08-30 02:58:22,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:22,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2023-08-30 02:58:22,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:22,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:22,541 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:22,541 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 374 flow. Second operand 7 states and 915 transitions. [2023-08-30 02:58:22,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 138 transitions, 1308 flow [2023-08-30 02:58:22,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 138 transitions, 1267 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:22,569 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 480 flow [2023-08-30 02:58:22,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=480, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-08-30 02:58:22,570 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2023-08-30 02:58:22,570 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 480 flow [2023-08-30 02:58:22,571 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 02:58:22,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:22,572 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 02:58:22,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:58:22,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:22,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -494587991, now seen corresponding path program 1 times [2023-08-30 02:58:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855341791] [2023-08-30 02:58:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855341791] [2023-08-30 02:58:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855341791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755664470] [2023-08-30 02:58:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:22,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:22,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-30 02:58:22,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:22,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:22,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-30 02:58:22,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:23,201 INFO L130 PetriNetUnfolder]: 2845/4559 cut-off events. [2023-08-30 02:58:23,201 INFO L131 PetriNetUnfolder]: For 15878/16663 co-relation queries the response was YES. [2023-08-30 02:58:23,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21916 conditions, 4559 events. 2845/4559 cut-off events. For 15878/16663 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27992 event pairs, 176 based on Foata normal form. 629/5102 useless extension candidates. Maximal degree in co-relation 21896. Up to 2083 conditions per place. [2023-08-30 02:58:23,222 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 114 selfloop transitions, 24 changer transitions 17/167 dead transitions. [2023-08-30 02:58:23,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 167 transitions, 1634 flow [2023-08-30 02:58:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:58:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:58:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1176 transitions. [2023-08-30 02:58:23,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930817610062893 [2023-08-30 02:58:23,225 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1176 transitions. [2023-08-30 02:58:23,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1176 transitions. [2023-08-30 02:58:23,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:23,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1176 transitions. [2023-08-30 02:58:23,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.66666666666666) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:23,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:23,230 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:23,230 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 480 flow. Second operand 9 states and 1176 transitions. [2023-08-30 02:58:23,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 167 transitions, 1634 flow [2023-08-30 02:58:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 167 transitions, 1587 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:23,351 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 603 flow [2023-08-30 02:58:23,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2023-08-30 02:58:23,352 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2023-08-30 02:58:23,352 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 603 flow [2023-08-30 02:58:23,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:23,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:23,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:23,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:58:23,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:23,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1230966517, now seen corresponding path program 1 times [2023-08-30 02:58:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828456309] [2023-08-30 02:58:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828456309] [2023-08-30 02:58:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828456309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:58:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658063490] [2023-08-30 02:58:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:23,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-30 02:58:23,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:23,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:23,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-30 02:58:23,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:23,982 INFO L130 PetriNetUnfolder]: 2759/4396 cut-off events. [2023-08-30 02:58:23,982 INFO L131 PetriNetUnfolder]: For 17874/18447 co-relation queries the response was YES. [2023-08-30 02:58:23,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21537 conditions, 4396 events. 2759/4396 cut-off events. For 17874/18447 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27060 event pairs, 162 based on Foata normal form. 389/4699 useless extension candidates. Maximal degree in co-relation 21514. Up to 1296 conditions per place. [2023-08-30 02:58:24,002 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 93 selfloop transitions, 27 changer transitions 39/168 dead transitions. [2023-08-30 02:58:24,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 168 transitions, 1689 flow [2023-08-30 02:58:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:58:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:58:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1415 transitions. [2023-08-30 02:58:24,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854202401372213 [2023-08-30 02:58:24,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1415 transitions. [2023-08-30 02:58:24,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1415 transitions. [2023-08-30 02:58:24,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:24,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1415 transitions. [2023-08-30 02:58:24,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.63636363636363) internal successors, (1415), 11 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,011 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,011 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 603 flow. Second operand 11 states and 1415 transitions. [2023-08-30 02:58:24,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 168 transitions, 1689 flow [2023-08-30 02:58:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 168 transitions, 1571 flow, removed 49 selfloop flow, removed 5 redundant places. [2023-08-30 02:58:24,203 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 521 flow [2023-08-30 02:58:24,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=521, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-08-30 02:58:24,204 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2023-08-30 02:58:24,204 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 521 flow [2023-08-30 02:58:24,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:24,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:24,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:58:24,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:24,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash -461247984, now seen corresponding path program 1 times [2023-08-30 02:58:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282071300] [2023-08-30 02:58:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282071300] [2023-08-30 02:58:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282071300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431152819] [2023-08-30 02:58:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:24,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 265 [2023-08-30 02:58:24,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:24,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 265 [2023-08-30 02:58:24,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:24,680 INFO L130 PetriNetUnfolder]: 1752/2923 cut-off events. [2023-08-30 02:58:24,681 INFO L131 PetriNetUnfolder]: For 12650/12795 co-relation queries the response was YES. [2023-08-30 02:58:24,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 2923 events. 1752/2923 cut-off events. For 12650/12795 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17003 event pairs, 226 based on Foata normal form. 120/3040 useless extension candidates. Maximal degree in co-relation 14733. Up to 1655 conditions per place. [2023-08-30 02:58:24,690 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 44 selfloop transitions, 1 changer transitions 70/119 dead transitions. [2023-08-30 02:58:24,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 1246 flow [2023-08-30 02:58:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-30 02:58:24,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489811320754717 [2023-08-30 02:58:24,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-30 02:58:24,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-30 02:58:24,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:24,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-30 02:58:24,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,700 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 521 flow. Second operand 5 states and 649 transitions. [2023-08-30 02:58:24,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 1246 flow [2023-08-30 02:58:24,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 976 flow, removed 65 selfloop flow, removed 14 redundant places. [2023-08-30 02:58:24,741 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 293 flow [2023-08-30 02:58:24,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2023-08-30 02:58:24,741 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2023-08-30 02:58:24,741 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 293 flow [2023-08-30 02:58:24,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:24,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:24,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:24,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:58:24,742 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:24,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 969202464, now seen corresponding path program 2 times [2023-08-30 02:58:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336414710] [2023-08-30 02:58:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336414710] [2023-08-30 02:58:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336414710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714605400] [2023-08-30 02:58:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:25,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:25,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-30 02:58:25,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 293 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:25,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-30 02:58:25,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:25,376 INFO L130 PetriNetUnfolder]: 519/894 cut-off events. [2023-08-30 02:58:25,376 INFO L131 PetriNetUnfolder]: For 2450/2512 co-relation queries the response was YES. [2023-08-30 02:58:25,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 894 events. 519/894 cut-off events. For 2450/2512 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4154 event pairs, 123 based on Foata normal form. 36/920 useless extension candidates. Maximal degree in co-relation 3538. Up to 276 conditions per place. [2023-08-30 02:58:25,379 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 46 selfloop transitions, 4 changer transitions 45/101 dead transitions. [2023-08-30 02:58:25,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 845 flow [2023-08-30 02:58:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:58:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:58:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 998 transitions. [2023-08-30 02:58:25,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707547169811321 [2023-08-30 02:58:25,381 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 998 transitions. [2023-08-30 02:58:25,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 998 transitions. [2023-08-30 02:58:25,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:25,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 998 transitions. [2023-08-30 02:58:25,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.75) internal successors, (998), 8 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,386 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,386 INFO L175 Difference]: Start difference. First operand has 76 places, 46 transitions, 293 flow. Second operand 8 states and 998 transitions. [2023-08-30 02:58:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 845 flow [2023-08-30 02:58:25,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 101 transitions, 796 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-30 02:58:25,392 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 287 flow [2023-08-30 02:58:25,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-08-30 02:58:25,393 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2023-08-30 02:58:25,393 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 287 flow [2023-08-30 02:58:25,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:25,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:25,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:58:25,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:25,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 176724070, now seen corresponding path program 3 times [2023-08-30 02:58:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108850890] [2023-08-30 02:58:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108850890] [2023-08-30 02:58:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108850890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:25,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137055888] [2023-08-30 02:58:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:25,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:25,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 265 [2023-08-30 02:58:25,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:25,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 265 [2023-08-30 02:58:25,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:25,706 INFO L130 PetriNetUnfolder]: 552/944 cut-off events. [2023-08-30 02:58:25,706 INFO L131 PetriNetUnfolder]: For 2178/2178 co-relation queries the response was YES. [2023-08-30 02:58:25,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 944 events. 552/944 cut-off events. For 2178/2178 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4039 event pairs, 98 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 3920. Up to 436 conditions per place. [2023-08-30 02:58:25,710 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 36 selfloop transitions, 6 changer transitions 42/84 dead transitions. [2023-08-30 02:58:25,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 666 flow [2023-08-30 02:58:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-30 02:58:25,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47245283018867923 [2023-08-30 02:58:25,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-30 02:58:25,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-30 02:58:25,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:25,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-30 02:58:25,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,718 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 287 flow. Second operand 5 states and 626 transitions. [2023-08-30 02:58:25,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 666 flow [2023-08-30 02:58:25,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 642 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 02:58:25,727 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 215 flow [2023-08-30 02:58:25,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2023-08-30 02:58:25,728 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-30 02:58:25,729 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 215 flow [2023-08-30 02:58:25,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:25,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:25,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:58:25,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:25,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 623683308, now seen corresponding path program 4 times [2023-08-30 02:58:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388165383] [2023-08-30 02:58:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:25,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:25,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:58:25,815 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:25,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:58:25,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:58:25,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:58:25,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:58:25,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:58:25,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:58:25,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:58:25,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:58:25,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:58:25,822 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:25,826 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:25,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:25,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:25 BasicIcfg [2023-08-30 02:58:25,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:25,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:25,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:25,895 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:25,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:10" (3/4) ... [2023-08-30 02:58:25,897 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:25,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:25,898 INFO L158 Benchmark]: Toolchain (without parser) took 16405.52ms. Allocated memory was 65.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 36.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 401.9MB. Max. memory is 16.1GB. [2023-08-30 02:58:25,898 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 42.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:25,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.83ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 48.6MB in the end (delta: -12.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-30 02:58:25,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.81ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 46.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:25,899 INFO L158 Benchmark]: Boogie Preprocessor took 41.69ms. Allocated memory is still 79.7MB. Free memory was 46.1MB in the beginning and 44.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:25,899 INFO L158 Benchmark]: RCFGBuilder took 612.98ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 35.0MB in the end (delta: 9.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2023-08-30 02:58:25,899 INFO L158 Benchmark]: TraceAbstraction took 15235.89ms. Allocated memory was 79.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 34.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 385.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:25,899 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:25,900 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.15ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 42.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.83ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 48.6MB in the end (delta: -12.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.81ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 46.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.69ms. Allocated memory is still 79.7MB. Free memory was 46.1MB in the beginning and 44.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 612.98ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 35.0MB in the end (delta: 9.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15235.89ms. Allocated memory was 79.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 34.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 385.2MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 144 PlacesBefore, 49 PlacesAfterwards, 133 TransitionsBefore, 37 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 7403 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3784, independent: 3601, independent conditional: 0, independent unconditional: 3601, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1585, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3784, independent: 2054, independent conditional: 0, independent unconditional: 2054, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1585, unknown conditional: 0, unknown unconditional: 1585] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-3, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-2, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 838 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2063 IncrementalHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 126 mSDtfsCounter, 2063 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=603occurred in iteration=10, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:58:25,928 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/mix053.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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:58:27,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:58:27,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:58:27,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:58:27,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:58:27,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:58:27,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:58:27,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:58:27,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:58:27,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:58:27,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:58:27,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:58:27,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:58:27,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:58:27,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:58:27,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:58:27,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:58:27,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:58:27,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:58:27,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:58:27,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:58:27,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:58:27,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:58:27,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:58:27,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:58:27,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:58:27,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:58:27,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:58:27,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:58:27,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:58:27,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:58:27,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:58:27,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:58:27,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:58:27,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:58:27,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:58:27,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:58:27,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:58:27,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:58:27,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:58:27,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:58:27,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:58:27,722 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:58:27,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:58:27,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:58:27,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:58:27,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:58:27,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:58:27,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:58:27,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:58:27,724 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:58:27,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:58:27,725 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:58:27,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:58:27,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:58:27,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:58:27,727 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:58:27,727 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:58:27,727 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:58:27,727 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:58:27,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:27,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:58:27,728 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:58:27,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:58:27,729 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:58:27,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:58:27,729 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:58:27,729 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:58:27,729 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:58:27,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:58:27,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:58:28,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:58:28,000 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:58:28,000 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:58:28,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-30 02:58:28,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:29,212 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:29,212 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-30 02:58:29,235 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab77ba9a/53a6ecb20ed8473291c414602509f3b4/FLAGaebefcb42 [2023-08-30 02:58:29,244 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab77ba9a/53a6ecb20ed8473291c414602509f3b4 [2023-08-30 02:58:29,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:29,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:29,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:29,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:29,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:29,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470331d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29, skipping insertion in model container [2023-08-30 02:58:29,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:29,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:29,384 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/mix053.opt.i[944,957] [2023-08-30 02:58:29,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:29,560 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:29,568 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/mix053.opt.i[944,957] [2023-08-30 02:58:29,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:29,647 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:29,647 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:29,651 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:29,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29 WrapperNode [2023-08-30 02:58:29,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:29,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:29,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:29,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:29,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,710 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 02:58:29,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:29,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:29,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:29,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:29,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:29,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:29,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:29,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:29,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (1/1) ... [2023-08-30 02:58:29,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:29,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:29,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:58:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:58:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:58:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:58:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:58:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:58:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:29,801 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:29,965 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:29,966 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:30,314 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:30,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:30,397 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:30,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:30 BoogieIcfgContainer [2023-08-30 02:58:30,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:30,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:30,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:30,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:30,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:29" (1/3) ... [2023-08-30 02:58:30,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cddbe0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:30, skipping insertion in model container [2023-08-30 02:58:30,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:29" (2/3) ... [2023-08-30 02:58:30,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cddbe0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:30, skipping insertion in model container [2023-08-30 02:58:30,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:30" (3/3) ... [2023-08-30 02:58:30,408 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-08-30 02:58:30,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:30,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:58:30,428 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:30,492 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2023-08-30 02:58:30,575 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-30 02:58:30,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 02:58:30,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2023-08-30 02:58:30,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2023-08-30 02:58:30,589 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:30,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-30 02:58:30,604 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-30 02:58:30,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2023-08-30 02:58:30,640 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-30 02:58:30,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:30,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 02:58:30,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2023-08-30 02:58:36,207 INFO L134 LiptonReduction]: Checked pairs total: 6991 [2023-08-30 02:58:36,207 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-30 02:58:36,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:36,220 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;@79b50c64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:36,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:58:36,221 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:58:36,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:36,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:36,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:36,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:36,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash 564, now seen corresponding path program 1 times [2023-08-30 02:58:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404320859] [2023-08-30 02:58:36,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:36,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:58:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:36,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:58:36,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:36,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:36,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404320859] [2023-08-30 02:58:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404320859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105718772] [2023-08-30 02:58:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:36,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:36,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:36,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-30 02:58:36,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:36,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-30 02:58:36,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:36,833 INFO L130 PetriNetUnfolder]: 3632/5068 cut-off events. [2023-08-30 02:58:36,834 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 02:58:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10161 conditions, 5068 events. 3632/5068 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25436 event pairs, 3632 based on Foata normal form. 0/4416 useless extension candidates. Maximal degree in co-relation 10149. Up to 4990 conditions per place. [2023-08-30 02:58:36,857 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-30 02:58:36,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 118 flow [2023-08-30 02:58:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-30 02:58:36,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315985130111525 [2023-08-30 02:58:36,870 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-30 02:58:36,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-30 02:58:36,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:36,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-30 02:58:36,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,881 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,882 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 2 states and 286 transitions. [2023-08-30 02:58:36,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 118 flow [2023-08-30 02:58:36,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:36,888 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-30 02:58:36,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-30 02:58:36,891 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-30 02:58:36,891 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-30 02:58:36,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:36,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:36,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:37,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:37,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1566685981, now seen corresponding path program 1 times [2023-08-30 02:58:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:37,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586649060] [2023-08-30 02:58:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:37,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:37,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:58:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:37,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:37,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:37,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:37,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586649060] [2023-08-30 02:58:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586649060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:37,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537778923] [2023-08-30 02:58:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:37,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:37,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:37,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:37,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-30 02:58:37,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:37,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-30 02:58:37,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:37,571 INFO L130 PetriNetUnfolder]: 2891/4255 cut-off events. [2023-08-30 02:58:37,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:37,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 4255 events. 2891/4255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 22943 event pairs, 668 based on Foata normal form. 0/3963 useless extension candidates. Maximal degree in co-relation 8349. Up to 2980 conditions per place. [2023-08-30 02:58:37,586 INFO L137 encePairwiseOnDemand]: 266/269 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-30 02:58:37,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 162 flow [2023-08-30 02:58:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-30 02:58:37,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117719950433705 [2023-08-30 02:58:37,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-30 02:58:37,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-30 02:58:37,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:37,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-30 02:58:37,589 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 02:58:37,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,591 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 413 transitions. [2023-08-30 02:58:37,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 162 flow [2023-08-30 02:58:37,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:37,592 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-30 02:58:37,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 02:58:37,611 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-30 02:58:37,611 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-30 02:58:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:37,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:37,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:37,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:37,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:37,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1948353810, now seen corresponding path program 1 times [2023-08-30 02:58:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94945957] [2023-08-30 02:58:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:37,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:37,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:58:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:37,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:37,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:37,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:37,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94945957] [2023-08-30 02:58:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94945957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979737763] [2023-08-30 02:58:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:37,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:37,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 269 [2023-08-30 02:58:37,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 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 02:58:37,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:37,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 269 [2023-08-30 02:58:37,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:38,267 INFO L130 PetriNetUnfolder]: 2063/3005 cut-off events. [2023-08-30 02:58:38,267 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-30 02:58:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 3005 events. 2063/3005 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14786 event pairs, 425 based on Foata normal form. 144/3038 useless extension candidates. Maximal degree in co-relation 6284. Up to 2373 conditions per place. [2023-08-30 02:58:38,278 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 34 selfloop transitions, 5 changer transitions 21/63 dead transitions. [2023-08-30 02:58:38,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 270 flow [2023-08-30 02:58:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-30 02:58:38,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48104089219330853 [2023-08-30 02:58:38,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-30 02:58:38,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-30 02:58:38,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:38,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-30 02:58:38,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,285 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 647 transitions. [2023-08-30 02:58:38,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 270 flow [2023-08-30 02:58:38,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:38,287 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 105 flow [2023-08-30 02:58:38,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:58:38,288 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-08-30 02:58:38,288 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 105 flow [2023-08-30 02:58:38,289 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 02:58:38,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:38,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:38,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:38,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:38,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:38,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1808737512, now seen corresponding path program 1 times [2023-08-30 02:58:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834091790] [2023-08-30 02:58:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:38,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:38,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:58:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:38,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:38,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:38,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:38,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834091790] [2023-08-30 02:58:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834091790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885815531] [2023-08-30 02:58:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:38,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:38,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:38,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 269 [2023-08-30 02:58:38,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:38,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 269 [2023-08-30 02:58:38,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:38,910 INFO L130 PetriNetUnfolder]: 1079/1685 cut-off events. [2023-08-30 02:58:38,910 INFO L131 PetriNetUnfolder]: For 768/768 co-relation queries the response was YES. [2023-08-30 02:58:38,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 1685 events. 1079/1685 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7929 event pairs, 161 based on Foata normal form. 108/1742 useless extension candidates. Maximal degree in co-relation 4708. Up to 883 conditions per place. [2023-08-30 02:58:38,917 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 44 selfloop transitions, 9 changer transitions 21/77 dead transitions. [2023-08-30 02:58:38,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 407 flow [2023-08-30 02:58:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2023-08-30 02:58:38,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48203221809169766 [2023-08-30 02:58:38,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2023-08-30 02:58:38,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2023-08-30 02:58:38,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:38,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2023-08-30 02:58:38,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,924 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 105 flow. Second operand 6 states and 778 transitions. [2023-08-30 02:58:38,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 407 flow [2023-08-30 02:58:38,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 400 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:38,927 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 170 flow [2023-08-30 02:58:38,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 02:58:38,928 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-30 02:58:38,928 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 170 flow [2023-08-30 02:58:38,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:38,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:38,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:39,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:39,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:39,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash 224038797, now seen corresponding path program 1 times [2023-08-30 02:58:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854852016] [2023-08-30 02:58:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:39,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:39,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:58:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:39,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:58:39,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:39,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:39,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854852016] [2023-08-30 02:58:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854852016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793956280] [2023-08-30 02:58:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:39,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:39,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:39,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 269 [2023-08-30 02:58:39,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:39,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 269 [2023-08-30 02:58:39,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:39,526 INFO L130 PetriNetUnfolder]: 566/927 cut-off events. [2023-08-30 02:58:39,527 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2023-08-30 02:58:39,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 927 events. 566/927 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3877 event pairs, 104 based on Foata normal form. 48/961 useless extension candidates. Maximal degree in co-relation 3070. Up to 351 conditions per place. [2023-08-30 02:58:39,531 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 52 selfloop transitions, 13 changer transitions 21/89 dead transitions. [2023-08-30 02:58:39,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 564 flow [2023-08-30 02:58:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2023-08-30 02:58:39,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816781731279873 [2023-08-30 02:58:39,534 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2023-08-30 02:58:39,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2023-08-30 02:58:39,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:39,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2023-08-30 02:58:39,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,540 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 170 flow. Second operand 7 states and 907 transitions. [2023-08-30 02:58:39,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 564 flow [2023-08-30 02:58:39,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 502 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:39,545 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 220 flow [2023-08-30 02:58:39,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-30 02:58:39,546 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 02:58:39,546 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 220 flow [2023-08-30 02:58:39,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:39,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:39,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:39,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:39,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:39,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1499619751, now seen corresponding path program 1 times [2023-08-30 02:58:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:39,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082993225] [2023-08-30 02:58:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:39,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:39,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:39,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:39,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:58:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:39,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:58:39,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:39,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:39,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:39,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082993225] [2023-08-30 02:58:39,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082993225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:39,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:58:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923430807] [2023-08-30 02:58:39,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:39,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:39,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:39,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 269 [2023-08-30 02:58:39,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:39,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 269 [2023-08-30 02:58:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:40,249 INFO L130 PetriNetUnfolder]: 452/726 cut-off events. [2023-08-30 02:58:40,249 INFO L131 PetriNetUnfolder]: For 816/816 co-relation queries the response was YES. [2023-08-30 02:58:40,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 726 events. 452/726 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2892 event pairs, 99 based on Foata normal form. 11/733 useless extension candidates. Maximal degree in co-relation 2309. Up to 290 conditions per place. [2023-08-30 02:58:40,254 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 48 selfloop transitions, 17 changer transitions 11/79 dead transitions. [2023-08-30 02:58:40,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 512 flow [2023-08-30 02:58:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:58:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:58:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2023-08-30 02:58:40,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711895910780669 [2023-08-30 02:58:40,258 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2023-08-30 02:58:40,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2023-08-30 02:58:40,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:40,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2023-08-30 02:58:40,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.75) internal successors, (1014), 8 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,263 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,263 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 220 flow. Second operand 8 states and 1014 transitions. [2023-08-30 02:58:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 512 flow [2023-08-30 02:58:40,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 450 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:58:40,270 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 214 flow [2023-08-30 02:58:40,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-30 02:58:40,271 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-30 02:58:40,271 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 214 flow [2023-08-30 02:58:40,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:40,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:40,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:40,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:40,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -288965480, now seen corresponding path program 1 times [2023-08-30 02:58:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171632441] [2023-08-30 02:58:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:40,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:40,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:58:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:40,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:40,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:40,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:40,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171632441] [2023-08-30 02:58:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171632441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:58:40,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505917639] [2023-08-30 02:58:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:40,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 02:58:40,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:40,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 02:58:40,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:40,720 INFO L130 PetriNetUnfolder]: 795/1268 cut-off events. [2023-08-30 02:58:40,720 INFO L131 PetriNetUnfolder]: For 1712/1712 co-relation queries the response was YES. [2023-08-30 02:58:40,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 1268 events. 795/1268 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6050 event pairs, 373 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 3978. Up to 764 conditions per place. [2023-08-30 02:58:40,727 INFO L137 encePairwiseOnDemand]: 266/269 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-30 02:58:40,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 532 flow [2023-08-30 02:58:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-30 02:58:40,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092936802973977 [2023-08-30 02:58:40,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-30 02:58:40,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-30 02:58:40,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:40,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-30 02:58:40,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,731 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 214 flow. Second operand 3 states and 411 transitions. [2023-08-30 02:58:40,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 532 flow [2023-08-30 02:58:40,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 406 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:58:40,737 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 162 flow [2023-08-30 02:58:40,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 02:58:40,738 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-30 02:58:40,738 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 162 flow [2023-08-30 02:58:40,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:40,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:40,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:40,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:40,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1310180932, now seen corresponding path program 2 times [2023-08-30 02:58:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512420347] [2023-08-30 02:58:40,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:58:40,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:40,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:40,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:40,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 (9)] Waiting until timeout for monitored process [2023-08-30 02:58:41,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:58:41,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:41,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:41,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:41,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:41,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512420347] [2023-08-30 02:58:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512420347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732721120] [2023-08-30 02:58:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:41,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:41,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:41,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 269 [2023-08-30 02:58:41,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:41,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 269 [2023-08-30 02:58:41,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:41,252 INFO L130 PetriNetUnfolder]: 920/1563 cut-off events. [2023-08-30 02:58:41,252 INFO L131 PetriNetUnfolder]: For 1428/1430 co-relation queries the response was YES. [2023-08-30 02:58:41,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1563 events. 920/1563 cut-off events. For 1428/1430 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8546 event pairs, 138 based on Foata normal form. 2/1564 useless extension candidates. Maximal degree in co-relation 4528. Up to 831 conditions per place. [2023-08-30 02:58:41,263 INFO L137 encePairwiseOnDemand]: 266/269 looper letters, 82 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-30 02:58:41,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 540 flow [2023-08-30 02:58:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:58:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:58:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-30 02:58:41,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018587360594795 [2023-08-30 02:58:41,265 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-30 02:58:41,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-30 02:58:41,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:41,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-30 02:58:41,266 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 02:58:41,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,268 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,268 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 162 flow. Second operand 4 states and 540 transitions. [2023-08-30 02:58:41,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 540 flow [2023-08-30 02:58:41,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:58:41,276 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 173 flow [2023-08-30 02:58:41,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-30 02:58:41,277 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-30 02:58:41,278 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 173 flow [2023-08-30 02:58:41,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:41,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:41,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:41,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -335117710, now seen corresponding path program 3 times [2023-08-30 02:58:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762369959] [2023-08-30 02:58:41,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:58:41,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:41,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:41,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:58:41,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:58:41,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:41,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:41,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:41,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:41,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762369959] [2023-08-30 02:58:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762369959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:58:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246184339] [2023-08-30 02:58:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:41,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 02:58:41,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:41,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 02:58:41,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:41,805 INFO L130 PetriNetUnfolder]: 1592/2597 cut-off events. [2023-08-30 02:58:41,805 INFO L131 PetriNetUnfolder]: For 2649/2652 co-relation queries the response was YES. [2023-08-30 02:58:41,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7985 conditions, 2597 events. 1592/2597 cut-off events. For 2649/2652 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14771 event pairs, 659 based on Foata normal form. 2/2593 useless extension candidates. Maximal degree in co-relation 7974. Up to 1507 conditions per place. [2023-08-30 02:58:41,815 INFO L137 encePairwiseOnDemand]: 266/269 looper letters, 67 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-30 02:58:41,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 449 flow [2023-08-30 02:58:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-30 02:58:41,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117719950433705 [2023-08-30 02:58:41,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-30 02:58:41,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-30 02:58:41,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:41,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-30 02:58:41,818 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 02:58:41,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,819 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 173 flow. Second operand 3 states and 413 transitions. [2023-08-30 02:58:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 449 flow [2023-08-30 02:58:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:58:41,836 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 184 flow [2023-08-30 02:58:41,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-30 02:58:41,836 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-30 02:58:41,836 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 184 flow [2023-08-30 02:58:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:41,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:41,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-30 02:58:42,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:42,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:42,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2032175458, now seen corresponding path program 4 times [2023-08-30 02:58:42,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:42,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386162893] [2023-08-30 02:58:42,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:58:42,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:42,047 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:58:42,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:58:42,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:58:42,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:58:42,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:42,259 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:58:42,260 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:42,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:58:42,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:58:42,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:58:42,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:58:42,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:42,464 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:42,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:42,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:42,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:42 BasicIcfg [2023-08-30 02:58:42,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:42,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:42,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:42,526 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:42,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:30" (3/4) ... [2023-08-30 02:58:42,528 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:42,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:42,528 INFO L158 Benchmark]: Toolchain (without parser) took 13282.29ms. Allocated memory was 79.7MB in the beginning and 302.0MB in the end (delta: 222.3MB). Free memory was 56.0MB in the beginning and 71.2MB in the end (delta: -15.2MB). Peak memory consumption was 208.3MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,528 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.05ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 51.9MB in the end (delta: 3.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.81ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 79.7MB. Free memory was 49.4MB in the beginning and 47.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: RCFGBuilder took 646.44ms. Allocated memory is still 79.7MB. Free memory was 47.4MB in the beginning and 34.8MB in the end (delta: 12.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: TraceAbstraction took 12123.98ms. Allocated memory was 79.7MB in the beginning and 302.0MB in the end (delta: 222.3MB). Free memory was 34.4MB in the beginning and 72.3MB in the end (delta: -37.9MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,529 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 302.0MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:42,530 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.09ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.05ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 51.9MB in the end (delta: 3.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.81ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 79.7MB. Free memory was 49.4MB in the beginning and 47.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.44ms. Allocated memory is still 79.7MB. Free memory was 47.4MB in the beginning and 34.8MB in the end (delta: 12.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12123.98ms. Allocated memory was 79.7MB in the beginning and 302.0MB in the end (delta: 222.3MB). Free memory was 34.4MB in the beginning and 72.3MB in the end (delta: -37.9MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 302.0MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 145 PlacesBefore, 49 PlacesAfterwards, 134 TransitionsBefore, 37 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 6991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3274, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1585, independent: 1543, independent conditional: 0, independent unconditional: 1543, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3274, independent: 1564, independent conditional: 0, independent unconditional: 1564, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1585, unknown conditional: 0, unknown unconditional: 1585] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=0, t1413={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=1, t1413={11:0}, t1414={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=2, t1413={11:0}, t1414={15:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=3, t1413={11:0}, t1414={15:0}, t1415={7:0}, t1416={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={11:0}, t1414={15:0}, t1415={7:0}, t1416={-2147483637:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 19 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1244 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:58:42,553 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