./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.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 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:16:11,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:16:11,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:16:11,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:16:11,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:16:11,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:16:11,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:16:11,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:16:11,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:16:11,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:16:11,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:16:11,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:16:11,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:16:11,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:16:11,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:16:11,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:16:11,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:16:11,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:16:11,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:16:11,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:16:11,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:16:11,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:16:11,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:16:11,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:16:11,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:16:11,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:16:11,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:16:11,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:16:11,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:16:11,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:16:11,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:16:11,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:16:11,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:16:11,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:16:11,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:16:11,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:16:11,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:16:11,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:16:11,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:16:11,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:16:11,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:16:11,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:16:11,171 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:16:11,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:16:11,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:16:11,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:16:11,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:16:11,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:16:11,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:16:11,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:16:11,174 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:16:11,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:16:11,174 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:16:11,175 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:16:11,176 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:16:11,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:16:11,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:16:11,176 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:16:11,176 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:16:11,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:16:11,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:16:11,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:16:11,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:11,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:16:11,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:16:11,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:16:11,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:16:11,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:16:11,178 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:16:11,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:16:11,179 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:16:11,179 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 -> 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:16:11,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:16:11,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:16:11,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:16:11,484 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:16:11,484 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:16:11,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:12,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:16:12,902 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:16:12,902 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:12,916 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d65d4e1/cea18fa647774c74b02e581fb0f89c8c/FLAGa1dc72d9e [2023-08-31 23:16:12,931 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d65d4e1/cea18fa647774c74b02e581fb0f89c8c [2023-08-31 23:16:12,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:16:12,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:16:12,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:12,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:16:12,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:16:12,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:12" (1/1) ... [2023-08-31 23:16:12,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7770eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:12, skipping insertion in model container [2023-08-31 23:16:12,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:12" (1/1) ... [2023-08-31 23:16:12,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:16:12,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:16:13,132 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-31 23:16:13,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:13,357 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:16:13,369 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-31 23:16:13,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:13,473 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:13,473 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:13,479 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:16:13,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13 WrapperNode [2023-08-31 23:16:13,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:13,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:13,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:16:13,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:16:13,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,547 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-31 23:16:13,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:13,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:16:13,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:16:13,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:16:13,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,596 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:16:13,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:16:13,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:16:13,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:16:13,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (1/1) ... [2023-08-31 23:16:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:16:13,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:16:13,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:16:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:16:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:16:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:16:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:16:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:16:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:16:13,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:16:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:16:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:16:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:16:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:16:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:16:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:16:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:16:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:16:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:16:13,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:16:13,681 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:16:13,837 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:16:13,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:16:14,163 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:16:14,295 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:16:14,295 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:16:14,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:14 BoogieIcfgContainer [2023-08-31 23:16:14,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:16:14,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:16:14,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:16:14,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:16:14,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:16:12" (1/3) ... [2023-08-31 23:16:14,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673e3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:14, skipping insertion in model container [2023-08-31 23:16:14,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:13" (2/3) ... [2023-08-31 23:16:14,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673e3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:14, skipping insertion in model container [2023-08-31 23:16:14,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:14" (3/3) ... [2023-08-31 23:16:14,306 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:14,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:16:14,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:16:14,320 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:16:14,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:16:14,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:16:14,471 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:16:14,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:14,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:16:14,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:16:14,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-31 23:16:14,483 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:16:14,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:16:14,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:16:14,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-31 23:16:14,560 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:16:14,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:16:14,564 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-31 23:16:19,055 INFO L134 LiptonReduction]: Checked pairs total: 9032 [2023-08-31 23:16:19,058 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-31 23:16:19,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:16:19,074 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;@23960abf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:16:19,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:16:19,076 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:16:19,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:19,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:19,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:16:19,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:19,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash 589, now seen corresponding path program 1 times [2023-08-31 23:16:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040121713] [2023-08-31 23:16:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040121713] [2023-08-31 23:16:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040121713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:16:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121322578] [2023-08-31 23:16:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:19,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:16:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:16:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:16:19,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-31 23:16:19,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:19,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:19,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-31 23:16:19,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:20,235 INFO L130 PetriNetUnfolder]: 5761/8131 cut-off events. [2023-08-31 23:16:20,235 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-31 23:16:20,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16121 conditions, 8131 events. 5761/8131 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 44026 event pairs, 5761 based on Foata normal form. 240/7086 useless extension candidates. Maximal degree in co-relation 16109. Up to 7833 conditions per place. [2023-08-31 23:16:20,284 INFO L137 encePairwiseOnDemand]: 272/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:16:20,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-31 23:16:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:16:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:16:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-08-31 23:16:20,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160142348754448 [2023-08-31 23:16:20,303 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-08-31 23:16:20,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-08-31 23:16:20,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:20,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-08-31 23:16:20,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,316 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,317 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 290 transitions. [2023-08-31 23:16:20,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-31 23:16:20,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:20,325 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:16:20,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:16:20,330 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:16:20,330 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:16:20,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:20,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:16:20,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:20,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 774811446, now seen corresponding path program 1 times [2023-08-31 23:16:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461324912] [2023-08-31 23:16:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461324912] [2023-08-31 23:16:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461324912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:16:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432574811] [2023-08-31 23:16:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:20,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:16:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:16:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:16:20,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 281 [2023-08-31 23:16:20,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 281 [2023-08-31 23:16:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:21,432 INFO L130 PetriNetUnfolder]: 4535/6488 cut-off events. [2023-08-31 23:16:21,433 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:21,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12817 conditions, 6488 events. 4535/6488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 34958 event pairs, 1241 based on Foata normal form. 0/5875 useless extension candidates. Maximal degree in co-relation 12814. Up to 4903 conditions per place. [2023-08-31 23:16:21,465 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 37 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-08-31 23:16:21,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 190 flow [2023-08-31 23:16:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:16:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:16:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:16:21,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005931198102017 [2023-08-31 23:16:21,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:16:21,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:16:21,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:21,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:16:21,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:21,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:21,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:21,472 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:16:21,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 190 flow [2023-08-31 23:16:21,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:16:21,474 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-31 23:16:21,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:16:21,474 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:16:21,475 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-31 23:16:21,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:21,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:21,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:21,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:16:21,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:21,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 252821229, now seen corresponding path program 1 times [2023-08-31 23:16:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141396224] [2023-08-31 23:16:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141396224] [2023-08-31 23:16:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141396224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:16:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350327235] [2023-08-31 23:16:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:21,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:21,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-31 23:16:21,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 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-31 23:16:21,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:21,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-31 23:16:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:23,990 INFO L130 PetriNetUnfolder]: 17912/24117 cut-off events. [2023-08-31 23:16:23,991 INFO L131 PetriNetUnfolder]: For 1020/1020 co-relation queries the response was YES. [2023-08-31 23:16:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49579 conditions, 24117 events. 17912/24117 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 126045 event pairs, 4259 based on Foata normal form. 0/23289 useless extension candidates. Maximal degree in co-relation 49575. Up to 10319 conditions per place. [2023-08-31 23:16:24,147 INFO L137 encePairwiseOnDemand]: 270/281 looper letters, 66 selfloop transitions, 18 changer transitions 0/84 dead transitions. [2023-08-31 23:16:24,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 84 transitions, 358 flow [2023-08-31 23:16:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-31 23:16:24,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47046263345195727 [2023-08-31 23:16:24,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-31 23:16:24,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-31 23:16:24,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:24,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-31 23:16:24,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:24,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:24,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:24,156 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 5 states and 661 transitions. [2023-08-31 23:16:24,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 84 transitions, 358 flow [2023-08-31 23:16:24,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 84 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:24,163 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 208 flow [2023-08-31 23:16:24,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-31 23:16:24,164 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-31 23:16:24,167 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 208 flow [2023-08-31 23:16:24,167 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-31 23:16:24,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:24,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:24,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:16:24,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:24,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -752477647, now seen corresponding path program 1 times [2023-08-31 23:16:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751942682] [2023-08-31 23:16:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751942682] [2023-08-31 23:16:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751942682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:24,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505858962] [2023-08-31 23:16:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:24,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:24,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:25,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 281 [2023-08-31 23:16:25,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:25,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:25,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 281 [2023-08-31 23:16:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:26,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([478] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][29], [154#true, 88#L830true, 63#P2EXITtrue, Black: 161#true, 80#P0EXITtrue, Black: 164#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 86#L872true, Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 177#(and (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t719~0#1.base| 0) |ULTIMATE.start_main_~#t720~0#1.base| 0) |ULTIMATE.start_main_~#t717~0#1.base| 0) |ULTIMATE.start_main_~#t718~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t718~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t719~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 21#L766true, 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-31 23:16:26,526 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L766-->L782: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_48 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_54 256) 0))) (let ((.cse7 (not .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_106 256) 0)) (.cse3 (and .cse6 .cse8)) (.cse4 (and (= (mod v_~y$w_buff1_used~0_101 256) 0) .cse6))) (let ((.cse10 (or .cse12 .cse3 .cse4)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_105 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_100 256) 0)) (.cse0 (ite .cse10 v_~y~0_57 (ite .cse11 v_~y$w_buff0~0_53 v_~y$w_buff1~0_48))) (.cse1 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= .cse0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$flush_delayed~0_19) (= v_~y~0_57 v_~y$mem_tmp~0_18) (= (ite .cse1 v_~y$w_buff1_used~0_101 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_101 0)) v_~y$w_buff1_used~0_100) (= v_~y$w_buff1~0_48 v_~y$w_buff1~0_47) (= (ite .cse1 v_~y$r_buff0_thd2~0_54 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~y$r_buff0_thd2~0_54 (ite (and .cse7 (not .cse2)) 0 v_~y$r_buff0_thd2~0_54))) v_~y$r_buff0_thd2~0_53) (= (ite .cse1 v_~y$r_buff1_thd2~0_48 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_53 256) 0))) (or (and .cse8 .cse9) .cse2 (and .cse5 .cse9))) v_~y$r_buff1_thd2~0_48 0)) v_~y$r_buff1_thd2~0_47) (= v_~y~0_56 (ite .cse1 v_~y$mem_tmp~0_18 .cse0)) (= v_~y$w_buff0~0_53 v_~y$w_buff0~0_52) (= v_~y$w_buff0_used~0_105 (ite .cse1 v_~y$w_buff0_used~0_106 (ite .cse10 v_~y$w_buff0_used~0_106 (ite .cse11 0 v_~y$w_buff0_used~0_106))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_101} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_52, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, ~y~0=v_~y~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_100} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][36], [154#true, 37#L754true, 161#true, 29#L782true, 88#L830true, 63#P2EXITtrue, Black: 164#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 86#L872true, Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 177#(and (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t719~0#1.base| 0) |ULTIMATE.start_main_~#t720~0#1.base| 0) |ULTIMATE.start_main_~#t717~0#1.base| 0) |ULTIMATE.start_main_~#t718~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t718~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t719~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse]) [2023-08-31 23:16:26,527 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,528 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,528 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,528 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:26,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([478] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][29], [154#true, 29#L782true, 88#L830true, Black: 161#true, 63#P2EXITtrue, 80#P0EXITtrue, Black: 164#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 86#L872true, Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 177#(and (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t719~0#1.base| 0) |ULTIMATE.start_main_~#t720~0#1.base| 0) |ULTIMATE.start_main_~#t717~0#1.base| 0) |ULTIMATE.start_main_~#t718~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t718~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t719~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-31 23:16:26,724 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:16:26,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:16:26,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:16:26,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:16:26,747 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([478] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][29], [154#true, 88#L830true, 63#P2EXITtrue, 80#P0EXITtrue, Black: 161#true, Black: 164#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 86#L872true, Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 38#P1EXITtrue, 177#(and (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t718~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t719~0#1.base| 0) |ULTIMATE.start_main_~#t720~0#1.base| 0) |ULTIMATE.start_main_~#t717~0#1.base| 0) |ULTIMATE.start_main_~#t718~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t718~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t719~0#1.base|)) (not (= |ULTIMATE.start_main_~#t719~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|)) (not (= |ULTIMATE.start_main_~#t720~0#1.base| |ULTIMATE.start_main_~#t717~0#1.base|))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-31 23:16:26,747 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:16:26,747 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:16:26,747 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:16:26,747 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:16:26,861 INFO L130 PetriNetUnfolder]: 11335/16068 cut-off events. [2023-08-31 23:16:26,861 INFO L131 PetriNetUnfolder]: For 15471/16057 co-relation queries the response was YES. [2023-08-31 23:16:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44351 conditions, 16068 events. 11335/16068 cut-off events. For 15471/16057 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 95279 event pairs, 3684 based on Foata normal form. 1553/16629 useless extension candidates. Maximal degree in co-relation 44344. Up to 13968 conditions per place. [2023-08-31 23:16:26,967 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 42 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2023-08-31 23:16:26,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 342 flow [2023-08-31 23:16:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-31 23:16:26,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40747330960854095 [2023-08-31 23:16:26,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-31 23:16:26,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-31 23:16:26,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:26,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-31 23:16:26,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:26,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:26,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:26,976 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 208 flow. Second operand 6 states and 687 transitions. [2023-08-31 23:16:26,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 342 flow [2023-08-31 23:16:26,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:16:26,984 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 192 flow [2023-08-31 23:16:26,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-31 23:16:26,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:16:26,986 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 192 flow [2023-08-31 23:16:26,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:26,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:26,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:26,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:16:26,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:26,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash 511153480, now seen corresponding path program 1 times [2023-08-31 23:16:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327753060] [2023-08-31 23:16:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327753060] [2023-08-31 23:16:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327753060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088115332] [2023-08-31 23:16:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:27,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:27,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-31 23:16:27,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 192 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-31 23:16:27,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:27,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-31 23:16:27,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:28,954 INFO L130 PetriNetUnfolder]: 15340/21225 cut-off events. [2023-08-31 23:16:28,955 INFO L131 PetriNetUnfolder]: For 16747/16747 co-relation queries the response was YES. [2023-08-31 23:16:28,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60875 conditions, 21225 events. 15340/21225 cut-off events. For 16747/16747 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 116400 event pairs, 1115 based on Foata normal form. 636/21861 useless extension candidates. Maximal degree in co-relation 60867. Up to 9643 conditions per place. [2023-08-31 23:16:29,060 INFO L137 encePairwiseOnDemand]: 271/281 looper letters, 52 selfloop transitions, 12 changer transitions 54/118 dead transitions. [2023-08-31 23:16:29,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 118 transitions, 736 flow [2023-08-31 23:16:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-31 23:16:29,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621250635485511 [2023-08-31 23:16:29,064 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-31 23:16:29,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-31 23:16:29,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:29,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-31 23:16:29,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:29,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:29,071 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:29,072 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 192 flow. Second operand 7 states and 909 transitions. [2023-08-31 23:16:29,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 118 transitions, 736 flow [2023-08-31 23:16:29,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 118 transitions, 727 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:29,083 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 259 flow [2023-08-31 23:16:29,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-31 23:16:29,083 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2023-08-31 23:16:29,084 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 259 flow [2023-08-31 23:16:29,084 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-31 23:16:29,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:29,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:29,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:16:29,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:29,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -752524209, now seen corresponding path program 1 times [2023-08-31 23:16:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986452804] [2023-08-31 23:16:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986452804] [2023-08-31 23:16:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986452804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:29,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:29,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139154774] [2023-08-31 23:16:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:29,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:29,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:29,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-31 23:16:29,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 259 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-31 23:16:29,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:29,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-31 23:16:29,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:30,766 INFO L130 PetriNetUnfolder]: 12518/17297 cut-off events. [2023-08-31 23:16:30,766 INFO L131 PetriNetUnfolder]: For 47482/47482 co-relation queries the response was YES. [2023-08-31 23:16:30,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58069 conditions, 17297 events. 12518/17297 cut-off events. For 47482/47482 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 90029 event pairs, 2539 based on Foata normal form. 774/18071 useless extension candidates. Maximal degree in co-relation 58056. Up to 6833 conditions per place. [2023-08-31 23:16:30,862 INFO L137 encePairwiseOnDemand]: 272/281 looper letters, 60 selfloop transitions, 8 changer transitions 45/113 dead transitions. [2023-08-31 23:16:30,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 839 flow [2023-08-31 23:16:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-31 23:16:30,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45856634468734114 [2023-08-31 23:16:30,866 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-31 23:16:30,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-31 23:16:30,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:30,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-31 23:16:30,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:30,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:30,872 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:30,873 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 259 flow. Second operand 7 states and 902 transitions. [2023-08-31 23:16:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 839 flow [2023-08-31 23:16:31,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 771 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:31,095 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 315 flow [2023-08-31 23:16:31,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-31 23:16:31,096 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-31 23:16:31,096 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 315 flow [2023-08-31 23:16:31,097 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-31 23:16:31,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:31,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:31,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:16:31,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:31,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1890133475, now seen corresponding path program 1 times [2023-08-31 23:16:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:31,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095585903] [2023-08-31 23:16:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095585903] [2023-08-31 23:16:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095585903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:16:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528764374] [2023-08-31 23:16:31,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:31,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:31,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 281 [2023-08-31 23:16:31,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:31,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 281 [2023-08-31 23:16:31,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:32,507 INFO L130 PetriNetUnfolder]: 9411/13658 cut-off events. [2023-08-31 23:16:32,508 INFO L131 PetriNetUnfolder]: For 46793/47211 co-relation queries the response was YES. [2023-08-31 23:16:32,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46406 conditions, 13658 events. 9411/13658 cut-off events. For 46793/47211 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 78871 event pairs, 3678 based on Foata normal form. 876/14341 useless extension candidates. Maximal degree in co-relation 46388. Up to 10540 conditions per place. [2023-08-31 23:16:32,634 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 51 selfloop transitions, 8 changer transitions 25/93 dead transitions. [2023-08-31 23:16:32,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 726 flow [2023-08-31 23:16:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-31 23:16:32,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825622775800712 [2023-08-31 23:16:32,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-31 23:16:32,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-31 23:16:32,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:32,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-31 23:16:32,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,642 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,642 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 315 flow. Second operand 5 states and 678 transitions. [2023-08-31 23:16:32,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 726 flow [2023-08-31 23:16:32,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 709 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-31 23:16:32,888 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 416 flow [2023-08-31 23:16:32,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=416, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-08-31 23:16:32,888 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-08-31 23:16:32,889 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 416 flow [2023-08-31 23:16:32,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:32,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:32,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:16:32,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:32,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:32,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1596032754, now seen corresponding path program 1 times [2023-08-31 23:16:32,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:32,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960538234] [2023-08-31 23:16:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:33,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960538234] [2023-08-31 23:16:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960538234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:33,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697220818] [2023-08-31 23:16:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:33,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:33,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-31 23:16:33,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:33,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-31 23:16:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:33,908 INFO L130 PetriNetUnfolder]: 6650/9807 cut-off events. [2023-08-31 23:16:33,908 INFO L131 PetriNetUnfolder]: For 30197/31387 co-relation queries the response was YES. [2023-08-31 23:16:33,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32656 conditions, 9807 events. 6650/9807 cut-off events. For 30197/31387 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 58589 event pairs, 1289 based on Foata normal form. 1014/10475 useless extension candidates. Maximal degree in co-relation 32638. Up to 6520 conditions per place. [2023-08-31 23:16:33,965 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 103 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2023-08-31 23:16:33,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 1191 flow [2023-08-31 23:16:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-31 23:16:33,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46619217081850534 [2023-08-31 23:16:33,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-31 23:16:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-31 23:16:33,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:33,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-31 23:16:33,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,976 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,976 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 416 flow. Second operand 5 states and 655 transitions. [2023-08-31 23:16:33,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 1191 flow [2023-08-31 23:16:34,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 1141 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:34,012 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 469 flow [2023-08-31 23:16:34,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-08-31 23:16:34,014 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-31 23:16:34,014 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 469 flow [2023-08-31 23:16:34,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:34,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:34,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:34,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:16:34,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:34,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash 760528670, now seen corresponding path program 1 times [2023-08-31 23:16:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158140955] [2023-08-31 23:16:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158140955] [2023-08-31 23:16:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158140955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:34,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:34,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323168384] [2023-08-31 23:16:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:34,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:34,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-31 23:16:34,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:34,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:34,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-31 23:16:34,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:35,573 INFO L130 PetriNetUnfolder]: 11716/17007 cut-off events. [2023-08-31 23:16:35,573 INFO L131 PetriNetUnfolder]: For 57408/57408 co-relation queries the response was YES. [2023-08-31 23:16:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71751 conditions, 17007 events. 11716/17007 cut-off events. For 57408/57408 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 99794 event pairs, 2911 based on Foata normal form. 322/17329 useless extension candidates. Maximal degree in co-relation 71733. Up to 6675 conditions per place. [2023-08-31 23:16:35,662 INFO L137 encePairwiseOnDemand]: 271/281 looper letters, 80 selfloop transitions, 22 changer transitions 56/158 dead transitions. [2023-08-31 23:16:35,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 158 transitions, 1375 flow [2023-08-31 23:16:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-31 23:16:35,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621250635485511 [2023-08-31 23:16:35,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-31 23:16:35,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-31 23:16:35,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:35,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-31 23:16:35,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,671 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 469 flow. Second operand 7 states and 909 transitions. [2023-08-31 23:16:35,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 158 transitions, 1375 flow [2023-08-31 23:16:35,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 158 transitions, 1354 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-31 23:16:35,808 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 595 flow [2023-08-31 23:16:35,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-08-31 23:16:35,809 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-31 23:16:35,809 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 595 flow [2023-08-31 23:16:35,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:35,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:35,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:16:35,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:35,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1875486739, now seen corresponding path program 1 times [2023-08-31 23:16:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707995568] [2023-08-31 23:16:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707995568] [2023-08-31 23:16:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707995568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:36,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:36,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688192578] [2023-08-31 23:16:36,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:36,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:36,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:36,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-31 23:16:36,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 595 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:36,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-31 23:16:36,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:36,744 INFO L130 PetriNetUnfolder]: 4186/6631 cut-off events. [2023-08-31 23:16:36,744 INFO L131 PetriNetUnfolder]: For 28327/29193 co-relation queries the response was YES. [2023-08-31 23:16:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27053 conditions, 6631 events. 4186/6631 cut-off events. For 28327/29193 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 41641 event pairs, 556 based on Foata normal form. 814/7282 useless extension candidates. Maximal degree in co-relation 27030. Up to 2746 conditions per place. [2023-08-31 23:16:36,777 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 114 selfloop transitions, 14 changer transitions 11/157 dead transitions. [2023-08-31 23:16:36,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 157 transitions, 1745 flow [2023-08-31 23:16:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-08-31 23:16:36,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46737841043890865 [2023-08-31 23:16:36,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-08-31 23:16:36,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-08-31 23:16:36,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:36,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-08-31 23:16:36,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,784 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,784 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 595 flow. Second operand 6 states and 788 transitions. [2023-08-31 23:16:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 157 transitions, 1745 flow [2023-08-31 23:16:36,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 157 transitions, 1639 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-08-31 23:16:36,842 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 677 flow [2023-08-31 23:16:36,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-31 23:16:36,843 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-31 23:16:36,843 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 677 flow [2023-08-31 23:16:36,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:36,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:36,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:16:36,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:36,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1396520134, now seen corresponding path program 1 times [2023-08-31 23:16:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763035089] [2023-08-31 23:16:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:37,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763035089] [2023-08-31 23:16:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763035089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:16:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016100066] [2023-08-31 23:16:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:37,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:37,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:37,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:37,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-31 23:16:37,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 677 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:37,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-31 23:16:37,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:37,670 INFO L130 PetriNetUnfolder]: 3519/5626 cut-off events. [2023-08-31 23:16:37,671 INFO L131 PetriNetUnfolder]: For 21732/22903 co-relation queries the response was YES. [2023-08-31 23:16:37,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26272 conditions, 5626 events. 3519/5626 cut-off events. For 21732/22903 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 35378 event pairs, 341 based on Foata normal form. 563/6059 useless extension candidates. Maximal degree in co-relation 26247. Up to 2383 conditions per place. [2023-08-31 23:16:37,698 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 126 selfloop transitions, 23 changer transitions 25/192 dead transitions. [2023-08-31 23:16:37,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 192 transitions, 2080 flow [2023-08-31 23:16:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:16:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:16:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1049 transitions. [2023-08-31 23:16:37,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666370106761566 [2023-08-31 23:16:37,702 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1049 transitions. [2023-08-31 23:16:37,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1049 transitions. [2023-08-31 23:16:37,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:37,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1049 transitions. [2023-08-31 23:16:37,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.125) internal successors, (1049), 8 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,708 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,708 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 677 flow. Second operand 8 states and 1049 transitions. [2023-08-31 23:16:37,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 192 transitions, 2080 flow [2023-08-31 23:16:37,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 192 transitions, 2030 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-31 23:16:37,902 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 795 flow [2023-08-31 23:16:37,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=795, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2023-08-31 23:16:37,903 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-31 23:16:37,903 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 795 flow [2023-08-31 23:16:37,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:37,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:37,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:16:37,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:37,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1680210500, now seen corresponding path program 1 times [2023-08-31 23:16:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288906365] [2023-08-31 23:16:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288906365] [2023-08-31 23:16:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288906365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061820801] [2023-08-31 23:16:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:38,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:38,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-08-31 23:16:38,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 795 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:38,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:38,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-08-31 23:16:38,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:38,975 INFO L130 PetriNetUnfolder]: 5141/8274 cut-off events. [2023-08-31 23:16:38,975 INFO L131 PetriNetUnfolder]: For 44932/45690 co-relation queries the response was YES. [2023-08-31 23:16:39,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41080 conditions, 8274 events. 5141/8274 cut-off events. For 44932/45690 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 54609 event pairs, 1059 based on Foata normal form. 185/8303 useless extension candidates. Maximal degree in co-relation 41053. Up to 4306 conditions per place. [2023-08-31 23:16:39,018 INFO L137 encePairwiseOnDemand]: 277/281 looper letters, 104 selfloop transitions, 2 changer transitions 48/169 dead transitions. [2023-08-31 23:16:39,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 1943 flow [2023-08-31 23:16:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2023-08-31 23:16:39,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811387900355872 [2023-08-31 23:16:39,020 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2023-08-31 23:16:39,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2023-08-31 23:16:39,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:39,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2023-08-31 23:16:39,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,025 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 795 flow. Second operand 5 states and 676 transitions. [2023-08-31 23:16:39,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 1943 flow [2023-08-31 23:16:39,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1660 flow, removed 116 selfloop flow, removed 6 redundant places. [2023-08-31 23:16:39,551 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 694 flow [2023-08-31 23:16:39,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=694, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-08-31 23:16:39,552 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-31 23:16:39,552 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 694 flow [2023-08-31 23:16:39,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:39,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:39,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:16:39,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:39,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1165892532, now seen corresponding path program 2 times [2023-08-31 23:16:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378102751] [2023-08-31 23:16:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378102751] [2023-08-31 23:16:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378102751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:16:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106451899] [2023-08-31 23:16:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:39,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:16:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:16:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:16:39,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-31 23:16:39,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:39,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-31 23:16:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:40,625 INFO L130 PetriNetUnfolder]: 4598/7394 cut-off events. [2023-08-31 23:16:40,626 INFO L131 PetriNetUnfolder]: For 26302/27256 co-relation queries the response was YES. [2023-08-31 23:16:40,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31082 conditions, 7394 events. 4598/7394 cut-off events. For 26302/27256 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 49919 event pairs, 376 based on Foata normal form. 428/7658 useless extension candidates. Maximal degree in co-relation 31054. Up to 1633 conditions per place. [2023-08-31 23:16:40,660 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 49 selfloop transitions, 22 changer transitions 112/193 dead transitions. [2023-08-31 23:16:40,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 193 transitions, 2027 flow [2023-08-31 23:16:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:16:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:16:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1286 transitions. [2023-08-31 23:16:40,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576512455516014 [2023-08-31 23:16:40,664 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1286 transitions. [2023-08-31 23:16:40,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1286 transitions. [2023-08-31 23:16:40,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:40,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1286 transitions. [2023-08-31 23:16:40,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.6) internal successors, (1286), 10 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,671 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,671 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 694 flow. Second operand 10 states and 1286 transitions. [2023-08-31 23:16:40,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 193 transitions, 2027 flow [2023-08-31 23:16:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 193 transitions, 2000 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:40,964 INFO L231 Difference]: Finished difference. Result has 89 places, 52 transitions, 454 flow [2023-08-31 23:16:40,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=454, PETRI_PLACES=89, PETRI_TRANSITIONS=52} [2023-08-31 23:16:40,965 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-31 23:16:40,965 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 52 transitions, 454 flow [2023-08-31 23:16:40,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:40,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:40,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:16:40,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:40,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1461538110, now seen corresponding path program 1 times [2023-08-31 23:16:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:40,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145498542] [2023-08-31 23:16:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145498542] [2023-08-31 23:16:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145498542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214700074] [2023-08-31 23:16:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:41,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-31 23:16:41,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 52 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:41,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-31 23:16:41,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:41,440 INFO L130 PetriNetUnfolder]: 1215/2129 cut-off events. [2023-08-31 23:16:41,440 INFO L131 PetriNetUnfolder]: For 10493/10493 co-relation queries the response was YES. [2023-08-31 23:16:41,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10146 conditions, 2129 events. 1215/2129 cut-off events. For 10493/10493 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11748 event pairs, 317 based on Foata normal form. 1/2130 useless extension candidates. Maximal degree in co-relation 10118. Up to 1155 conditions per place. [2023-08-31 23:16:41,448 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 49 selfloop transitions, 5 changer transitions 50/104 dead transitions. [2023-08-31 23:16:41,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 104 transitions, 1087 flow [2023-08-31 23:16:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-08-31 23:16:41,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491103202846975 [2023-08-31 23:16:41,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-08-31 23:16:41,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-08-31 23:16:41,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:41,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-08-31 23:16:41,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,454 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,454 INFO L175 Difference]: Start difference. First operand has 89 places, 52 transitions, 454 flow. Second operand 5 states and 631 transitions. [2023-08-31 23:16:41,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 104 transitions, 1087 flow [2023-08-31 23:16:41,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 805 flow, removed 49 selfloop flow, removed 21 redundant places. [2023-08-31 23:16:41,486 INFO L231 Difference]: Finished difference. Result has 70 places, 39 transitions, 217 flow [2023-08-31 23:16:41,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=70, PETRI_TRANSITIONS=39} [2023-08-31 23:16:41,486 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-31 23:16:41,487 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 39 transitions, 217 flow [2023-08-31 23:16:41,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:41,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:41,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:16:41,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:41,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1000746590, now seen corresponding path program 2 times [2023-08-31 23:16:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781828839] [2023-08-31 23:16:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781828839] [2023-08-31 23:16:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781828839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:16:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683818050] [2023-08-31 23:16:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:42,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:16:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:16:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:16:42,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 281 [2023-08-31 23:16:42,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 39 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:42,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:42,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 281 [2023-08-31 23:16:42,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:42,277 INFO L130 PetriNetUnfolder]: 216/404 cut-off events. [2023-08-31 23:16:42,278 INFO L131 PetriNetUnfolder]: For 866/869 co-relation queries the response was YES. [2023-08-31 23:16:42,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 404 events. 216/404 cut-off events. For 866/869 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1469 event pairs, 52 based on Foata normal form. 2/403 useless extension candidates. Maximal degree in co-relation 1422. Up to 209 conditions per place. [2023-08-31 23:16:42,280 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 43 selfloop transitions, 4 changer transitions 27/78 dead transitions. [2023-08-31 23:16:42,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 579 flow [2023-08-31 23:16:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:16:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:16:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1005 transitions. [2023-08-31 23:16:42,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470640569395018 [2023-08-31 23:16:42,283 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1005 transitions. [2023-08-31 23:16:42,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1005 transitions. [2023-08-31 23:16:42,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:42,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1005 transitions. [2023-08-31 23:16:42,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.625) internal successors, (1005), 8 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:42,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:42,289 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:42,289 INFO L175 Difference]: Start difference. First operand has 70 places, 39 transitions, 217 flow. Second operand 8 states and 1005 transitions. [2023-08-31 23:16:42,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 579 flow [2023-08-31 23:16:42,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 509 flow, removed 13 selfloop flow, removed 14 redundant places. [2023-08-31 23:16:42,293 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 185 flow [2023-08-31 23:16:42,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=185, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-31 23:16:42,294 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-31 23:16:42,294 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 185 flow [2023-08-31 23:16:42,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:42,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:42,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:16:42,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:42,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash -278291952, now seen corresponding path program 3 times [2023-08-31 23:16:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661884953] [2023-08-31 23:16:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:16:42,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:16:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:16:42,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:16:42,458 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:16:42,460 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:16:42,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:16:42,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:16:42,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:16:42,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:16:42,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:16:42,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:16:42,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:16:42,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:16:42,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:16:42,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:16:42,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:16:42,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:16:42,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:16:42,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:16:42,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:16:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:16:42,470 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:42,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:16:42,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:16:42,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:16:42 BasicIcfg [2023-08-31 23:16:42,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:16:42,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:16:42,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:16:42,570 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:16:42,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:14" (3/4) ... [2023-08-31 23:16:42,572 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:16:42,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:16:42,573 INFO L158 Benchmark]: Toolchain (without parser) took 29639.25ms. Allocated memory was 83.9MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 61.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-31 23:16:42,573 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:16:42,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.42ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:16:42,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.71ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 55.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:16:42,574 INFO L158 Benchmark]: Boogie Preprocessor took 55.01ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 53.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:16:42,574 INFO L158 Benchmark]: RCFGBuilder took 689.65ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 45.7MB in the end (delta: 7.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-08-31 23:16:42,574 INFO L158 Benchmark]: TraceAbstraction took 28268.49ms. Allocated memory was 83.9MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 45.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-31 23:16:42,575 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 3.2GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:16:42,576 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.16ms. Allocated memory is still 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.42ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 58.0MB in the end (delta: 3.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.71ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 55.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.01ms. Allocated memory is still 83.9MB. Free memory was 55.5MB in the beginning and 53.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 689.65ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 45.7MB in the end (delta: 7.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28268.49ms. Allocated memory was 83.9MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 45.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 3.2GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 147 PlacesBefore, 52 PlacesAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 9032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3789, independent: 3562, independent conditional: 0, independent unconditional: 3562, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1606, independent: 1573, independent conditional: 0, independent unconditional: 1573, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3789, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 1606, unknown conditional: 0, unknown unconditional: 1606] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-3, t717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=-2, t717={5:0}, t718={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=-1, t717={5:0}, t718={6:0}, t719={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 855]: 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: 859]: 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, 175 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: 28.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2264 IncrementalHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 91 mSDtfsCounter, 2264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=795occurred in iteration=11, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:16:42,597 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/mix027_power.opt_pso.opt_rmo.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 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:16:44,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:16:44,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:16:44,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:16:44,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:16:44,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:16:44,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:16:44,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:16:44,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:16:44,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:16:44,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:16:44,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:16:44,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:16:44,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:16:44,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:16:44,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:16:44,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:16:44,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:16:44,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:16:44,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:16:44,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:16:44,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:16:44,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:16:44,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:16:44,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:16:44,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:16:44,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:16:44,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:16:44,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:16:44,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:16:44,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:16:44,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:16:44,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:16:44,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:16:44,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:16:44,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:16:44,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:16:44,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:16:44,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:16:44,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:16:44,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:16:44,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:16:44,764 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:16:44,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:16:44,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:16:44,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:16:44,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:16:44,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:16:44,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:16:44,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:16:44,767 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:16:44,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:16:44,768 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:16:44,769 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:16:44,770 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:16:44,770 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:16:44,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:16:44,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:16:44,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:16:44,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:44,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:16:44,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:16:44,771 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:16:44,771 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:16:44,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:16:44,771 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:16:44,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:16:44,772 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:16:44,772 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:16:44,772 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 -> 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:16:45,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:16:45,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:16:45,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:16:45,080 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:16:45,080 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:16:45,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:46,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:16:46,403 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:16:46,403 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:46,416 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0650369b/86cd8e11e54445cc88df18d075c3ee6a/FLAGaa043e7c2 [2023-08-31 23:16:46,429 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0650369b/86cd8e11e54445cc88df18d075c3ee6a [2023-08-31 23:16:46,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:16:46,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:16:46,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:46,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:16:46,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:16:46,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:46" (1/1) ... [2023-08-31 23:16:46,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f40e60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:46, skipping insertion in model container [2023-08-31 23:16:46,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:46" (1/1) ... [2023-08-31 23:16:46,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:16:46,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:16:46,693 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-31 23:16:46,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:46,905 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:16:46,917 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-31 23:16:46,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:47,007 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:47,007 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:47,013 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:16:47,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47 WrapperNode [2023-08-31 23:16:47,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:47,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:47,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:16:47,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:16:47,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,056 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-31 23:16:47,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:47,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:16:47,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:16:47,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:16:47,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,095 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:16:47,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:16:47,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:16:47,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:16:47,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (1/1) ... [2023-08-31 23:16:47,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:16:47,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:16:47,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:16:47,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:16:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:16:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:16:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:16:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:16:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:16:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:16:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:16:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:16:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:16:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:16:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:16:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:16:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:16:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:16:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:16:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:16:47,193 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:16:47,385 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:16:47,388 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:16:47,759 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:16:47,870 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:16:47,870 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:16:47,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:47 BoogieIcfgContainer [2023-08-31 23:16:47,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:16:47,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:16:47,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:16:47,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:16:47,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:16:46" (1/3) ... [2023-08-31 23:16:47,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c7374e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:47, skipping insertion in model container [2023-08-31 23:16:47,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:47" (2/3) ... [2023-08-31 23:16:47,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c7374e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:47, skipping insertion in model container [2023-08-31 23:16:47,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:47" (3/3) ... [2023-08-31 23:16:47,880 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2023-08-31 23:16:47,895 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:16:47,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:16:47,896 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:16:47,969 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:16:48,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:16:48,081 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:16:48,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:16:48,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:16:48,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-31 23:16:48,097 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:16:48,108 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:16:48,112 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:16:48,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-31 23:16:48,158 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:16:48,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:48,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:16:48,162 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-31 23:16:55,134 INFO L134 LiptonReduction]: Checked pairs total: 8793 [2023-08-31 23:16:55,134 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:16:55,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:16:55,160 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;@50845737, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:16:55,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:16:55,162 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:16:55,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:55,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:55,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:16:55,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:55,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2023-08-31 23:16:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:16:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465327299] [2023-08-31 23:16:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:55,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:16:55,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:16:55,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:16:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:55,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:16:55,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:16:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:55,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:16:55,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:16:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465327299] [2023-08-31 23:16:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465327299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:55,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:55,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:16:55,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499793182] [2023-08-31 23:16:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:55,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:16:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:16:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:16:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:16:55,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-31 23:16:55,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:55,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:55,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-31 23:16:55,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:56,212 INFO L130 PetriNetUnfolder]: 5049/7083 cut-off events. [2023-08-31 23:16:56,212 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-31 23:16:56,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14121 conditions, 7083 events. 5049/7083 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 37120 event pairs, 5049 based on Foata normal form. 0/6050 useless extension candidates. Maximal degree in co-relation 14109. Up to 6881 conditions per place. [2023-08-31 23:16:56,250 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-31 23:16:56,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-31 23:16:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:16:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:16:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-31 23:16:56,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252707581227437 [2023-08-31 23:16:56,261 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-31 23:16:56,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-31 23:16:56,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:56,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-31 23:16:56,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,271 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,273 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 291 transitions. [2023-08-31 23:16:56,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-31 23:16:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:56,279 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-31 23:16:56,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-31 23:16:56,284 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-31 23:16:56,284 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-31 23:16:56,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:56,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:56,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:16:56,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:56,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:56,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1833141641, now seen corresponding path program 1 times [2023-08-31 23:16:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:16:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357732574] [2023-08-31 23:16:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:16:56,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:16:56,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:16:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:56,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:16:56,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:16:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:56,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:16:56,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:16:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357732574] [2023-08-31 23:16:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357732574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:16:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313954804] [2023-08-31 23:16:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:56,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:16:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:16:56,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:16:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:16:56,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 277 [2023-08-31 23:16:56,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:56,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 277 [2023-08-31 23:16:56,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:57,230 INFO L130 PetriNetUnfolder]: 3975/5856 cut-off events. [2023-08-31 23:16:57,230 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:57,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11433 conditions, 5856 events. 3975/5856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33626 event pairs, 753 based on Foata normal form. 0/5423 useless extension candidates. Maximal degree in co-relation 11430. Up to 4303 conditions per place. [2023-08-31 23:16:57,260 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-31 23:16:57,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-08-31 23:16:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:16:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:16:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-31 23:16:57,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090252707581228 [2023-08-31 23:16:57,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-31 23:16:57,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-31 23:16:57,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:57,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-31 23:16:57,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,268 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 423 transitions. [2023-08-31 23:16:57,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-08-31 23:16:57,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:16:57,269 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-31 23:16:57,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-31 23:16:57,270 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-31 23:16:57,270 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-31 23:16:57,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:57,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:57,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:16:57,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:57,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:57,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1764438658, now seen corresponding path program 1 times [2023-08-31 23:16:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:16:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844920458] [2023-08-31 23:16:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:57,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:16:57,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:16:57,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:16:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:57,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:16:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:16:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:57,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:16:57,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:16:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844920458] [2023-08-31 23:16:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844920458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104260473] [2023-08-31 23:16:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:57,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:16:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:57,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:16:57,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:57,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:16:57,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:58,127 INFO L130 PetriNetUnfolder]: 2757/4002 cut-off events. [2023-08-31 23:16:58,128 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2023-08-31 23:16:58,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 4002 events. 2757/4002 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 20735 event pairs, 542 based on Foata normal form. 192/4026 useless extension candidates. Maximal degree in co-relation 8359. Up to 3074 conditions per place. [2023-08-31 23:16:58,153 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-08-31 23:16:58,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-08-31 23:16:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2023-08-31 23:16:58,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488086642599278 [2023-08-31 23:16:58,156 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2023-08-31 23:16:58,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2023-08-31 23:16:58,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:58,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2023-08-31 23:16:58,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,164 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 676 transitions. [2023-08-31 23:16:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-08-31 23:16:58,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:58,167 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-08-31 23:16:58,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:16:58,169 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-31 23:16:58,169 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-08-31 23:16:58,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:58,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:58,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:16:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:58,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:58,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1141569330, now seen corresponding path program 1 times [2023-08-31 23:16:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:16:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138615843] [2023-08-31 23:16:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:16:58,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:16:58,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:16:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:58,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:16:58,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:16:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:58,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:16:58,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:16:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138615843] [2023-08-31 23:16:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138615843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967147370] [2023-08-31 23:16:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:58,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:16:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:58,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:16:58,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 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-31 23:16:58,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:58,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:16:58,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:59,045 INFO L130 PetriNetUnfolder]: 1407/2193 cut-off events. [2023-08-31 23:16:59,046 INFO L131 PetriNetUnfolder]: For 889/889 co-relation queries the response was YES. [2023-08-31 23:16:59,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 2193 events. 1407/2193 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10997 event pairs, 231 based on Foata normal form. 138/2258 useless extension candidates. Maximal degree in co-relation 5955. Up to 1054 conditions per place. [2023-08-31 23:16:59,060 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-08-31 23:16:59,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-08-31 23:16:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 813 transitions. [2023-08-31 23:16:59,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891696750902527 [2023-08-31 23:16:59,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 813 transitions. [2023-08-31 23:16:59,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 813 transitions. [2023-08-31 23:16:59,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:59,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 813 transitions. [2023-08-31 23:16:59,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,071 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 813 transitions. [2023-08-31 23:16:59,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-08-31 23:16:59,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:59,079 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-08-31 23:16:59,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-31 23:16:59,080 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-31 23:16:59,080 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-08-31 23:16:59,081 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-31 23:16:59,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:59,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:59,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:16:59,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:59,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:59,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1309325384, now seen corresponding path program 1 times [2023-08-31 23:16:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:16:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069698275] [2023-08-31 23:16:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:59,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:16:59,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:16:59,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:16:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:16:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:59,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:16:59,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:16:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:59,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:16:59,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:16:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069698275] [2023-08-31 23:16:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069698275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:16:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690311774] [2023-08-31 23:16:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:16:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:59,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:16:59,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:59,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:16:59,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:59,909 INFO L130 PetriNetUnfolder]: 759/1239 cut-off events. [2023-08-31 23:16:59,910 INFO L131 PetriNetUnfolder]: For 1309/1309 co-relation queries the response was YES. [2023-08-31 23:16:59,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 1239 events. 759/1239 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5663 event pairs, 169 based on Foata normal form. 57/1270 useless extension candidates. Maximal degree in co-relation 3888. Up to 419 conditions per place. [2023-08-31 23:16:59,916 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-08-31 23:16:59,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-08-31 23:16:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 948 transitions. [2023-08-31 23:16:59,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889118102114492 [2023-08-31 23:16:59,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 948 transitions. [2023-08-31 23:16:59,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 948 transitions. [2023-08-31 23:16:59,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:59,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 948 transitions. [2023-08-31 23:16:59,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.42857142857142) internal successors, (948), 7 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,926 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,926 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 948 transitions. [2023-08-31 23:16:59,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-08-31 23:16:59,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:59,937 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-08-31 23:16:59,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-31 23:16:59,938 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-31 23:16:59,938 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-08-31 23:16:59,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:59,939 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-31 23:16:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-31 23:17:00,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:00,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:00,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash 843193576, now seen corresponding path program 1 times [2023-08-31 23:17:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404246456] [2023-08-31 23:17:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:00,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:00,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:00,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:17:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:00,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:17:00,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:00,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:00,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:00,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404246456] [2023-08-31 23:17:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404246456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:17:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955971137] [2023-08-31 23:17:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:00,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:17:00,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:00,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:17:00,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:00,766 INFO L130 PetriNetUnfolder]: 625/1005 cut-off events. [2023-08-31 23:17:00,766 INFO L131 PetriNetUnfolder]: For 1016/1016 co-relation queries the response was YES. [2023-08-31 23:17:00,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 1005 events. 625/1005 cut-off events. For 1016/1016 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4386 event pairs, 164 based on Foata normal form. 12/1002 useless extension candidates. Maximal degree in co-relation 3027. Up to 400 conditions per place. [2023-08-31 23:17:00,772 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-08-31 23:17:00,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-08-31 23:17:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:17:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:17:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1059 transitions. [2023-08-31 23:17:00,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778880866425993 [2023-08-31 23:17:00,775 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1059 transitions. [2023-08-31 23:17:00,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1059 transitions. [2023-08-31 23:17:00,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:00,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1059 transitions. [2023-08-31 23:17:00,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.375) internal successors, (1059), 8 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,782 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,782 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1059 transitions. [2023-08-31 23:17:00,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-08-31 23:17:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:17:00,792 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-08-31 23:17:00,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-31 23:17:00,792 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-31 23:17:00,793 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-08-31 23:17:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:00,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:00,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:01,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:01,004 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:01,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 27483196, now seen corresponding path program 1 times [2023-08-31 23:17:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579043917] [2023-08-31 23:17:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:01,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:01,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:01,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:01,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:17:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:01,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:01,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:01,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:01,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579043917] [2023-08-31 23:17:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579043917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112193325] [2023-08-31 23:17:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:01,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:01,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:17:01,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:01,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:17:01,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:01,422 INFO L130 PetriNetUnfolder]: 879/1430 cut-off events. [2023-08-31 23:17:01,423 INFO L131 PetriNetUnfolder]: For 1896/1896 co-relation queries the response was YES. [2023-08-31 23:17:01,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 1430 events. 879/1430 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6855 event pairs, 174 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 4296. Up to 777 conditions per place. [2023-08-31 23:17:01,431 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 82 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-31 23:17:01,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 663 flow [2023-08-31 23:17:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:17:01,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972924187725632 [2023-08-31 23:17:01,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:17:01,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:17:01,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:01,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:17:01,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,437 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,437 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:17:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 663 flow [2023-08-31 23:17:01,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 522 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:17:01,447 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2023-08-31 23:17:01,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-31 23:17:01,448 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-31 23:17:01,448 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2023-08-31 23:17:01,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:01,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:01,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:01,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:01,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2006709294, now seen corresponding path program 2 times [2023-08-31 23:17:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924498624] [2023-08-31 23:17:01,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:17:01,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:01,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:01,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:01,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:17:01,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:01,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:01,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:01,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:01,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924498624] [2023-08-31 23:17:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924498624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:01,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:01,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704204471] [2023-08-31 23:17:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:01,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-31 23:17:01,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:01,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:01,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-31 23:17:01,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:02,094 INFO L130 PetriNetUnfolder]: 1515/2421 cut-off events. [2023-08-31 23:17:02,094 INFO L131 PetriNetUnfolder]: For 1851/1851 co-relation queries the response was YES. [2023-08-31 23:17:02,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6844 conditions, 2421 events. 1515/2421 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12846 event pairs, 677 based on Foata normal form. 1/2377 useless extension candidates. Maximal degree in co-relation 6834. Up to 1402 conditions per place. [2023-08-31 23:17:02,107 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 67 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-31 23:17:02,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 439 flow [2023-08-31 23:17:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-31 23:17:02,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50661853188929 [2023-08-31 23:17:02,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-31 23:17:02,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-31 23:17:02,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:02,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-31 23:17:02,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,113 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 3 states and 421 transitions. [2023-08-31 23:17:02,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 439 flow [2023-08-31 23:17:02,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:02,132 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 178 flow [2023-08-31 23:17:02,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:17:02,138 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-31 23:17:02,138 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 178 flow [2023-08-31 23:17:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:02,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:02,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:02,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:02,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:02,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1484819732, now seen corresponding path program 3 times [2023-08-31 23:17:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593778560] [2023-08-31 23:17:02,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:17:02,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:02,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:17:02,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:17:02,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:02,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:17:02,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:02,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:02,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593778560] [2023-08-31 23:17:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593778560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387064052] [2023-08-31 23:17:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:02,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:02,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:17:02,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:02,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:17:02,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:03,203 INFO L130 PetriNetUnfolder]: 1815/3120 cut-off events. [2023-08-31 23:17:03,203 INFO L131 PetriNetUnfolder]: For 3044/3044 co-relation queries the response was YES. [2023-08-31 23:17:03,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 3120 events. 1815/3120 cut-off events. For 3044/3044 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19165 event pairs, 348 based on Foata normal form. 1/3104 useless extension candidates. Maximal degree in co-relation 9657. Up to 1023 conditions per place. [2023-08-31 23:17:03,218 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 116 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2023-08-31 23:17:03,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 130 transitions, 856 flow [2023-08-31 23:17:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-08-31 23:17:03,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47601856627127387 [2023-08-31 23:17:03,222 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-08-31 23:17:03,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-08-31 23:17:03,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:03,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-08-31 23:17:03,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:03,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:03,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:03,227 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 178 flow. Second operand 7 states and 923 transitions. [2023-08-31 23:17:03,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 130 transitions, 856 flow [2023-08-31 23:17:03,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 130 transitions, 852 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:03,260 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 232 flow [2023-08-31 23:17:03,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-08-31 23:17:03,261 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-31 23:17:03,261 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 232 flow [2023-08-31 23:17:03,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:03,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:03,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:03,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:03,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:03,473 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:03,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -60752346, now seen corresponding path program 4 times [2023-08-31 23:17:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702131328] [2023-08-31 23:17:03,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:17:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:03,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:03,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:17:03,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:17:03,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:03,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:03,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:03,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-31 23:17:03,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:03,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702131328] [2023-08-31 23:17:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702131328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:03,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686707891] [2023-08-31 23:17:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:03,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:03,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-31 23:17:03,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:03,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:03,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-31 23:17:03,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:04,136 INFO L130 PetriNetUnfolder]: 2890/4857 cut-off events. [2023-08-31 23:17:04,137 INFO L131 PetriNetUnfolder]: For 6510/6562 co-relation queries the response was YES. [2023-08-31 23:17:04,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16827 conditions, 4857 events. 2890/4857 cut-off events. For 6510/6562 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 31277 event pairs, 870 based on Foata normal form. 17/4839 useless extension candidates. Maximal degree in co-relation 16812. Up to 2496 conditions per place. [2023-08-31 23:17:04,163 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 76 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-08-31 23:17:04,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 552 flow [2023-08-31 23:17:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-31 23:17:04,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018050541516246 [2023-08-31 23:17:04,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-31 23:17:04,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-31 23:17:04,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:04,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-31 23:17:04,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,169 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 232 flow. Second operand 3 states and 417 transitions. [2023-08-31 23:17:04,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 552 flow [2023-08-31 23:17:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:04,240 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 243 flow [2023-08-31 23:17:04,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-08-31 23:17:04,241 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-31 23:17:04,241 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 243 flow [2023-08-31 23:17:04,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:04,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:04,252 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 (11)] Ended with exit code 0 [2023-08-31 23:17:04,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:04,452 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:04,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1368358214, now seen corresponding path program 5 times [2023-08-31 23:17:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439172623] [2023-08-31 23:17:04,453 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:17:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:04,454 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:04,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:17:04,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:04,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:04,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:17:04,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:04,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:04,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439172623] [2023-08-31 23:17:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439172623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585913105] [2023-08-31 23:17:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:04,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:04,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-31 23:17:04,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:04,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-31 23:17:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:05,466 INFO L130 PetriNetUnfolder]: 2616/4565 cut-off events. [2023-08-31 23:17:05,466 INFO L131 PetriNetUnfolder]: For 6687/6810 co-relation queries the response was YES. [2023-08-31 23:17:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16362 conditions, 4565 events. 2616/4565 cut-off events. For 6687/6810 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30810 event pairs, 316 based on Foata normal form. 89/4612 useless extension candidates. Maximal degree in co-relation 16346. Up to 1740 conditions per place. [2023-08-31 23:17:05,502 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 91 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2023-08-31 23:17:05,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 729 flow [2023-08-31 23:17:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-31 23:17:05,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703455389375967 [2023-08-31 23:17:05,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-31 23:17:05,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-31 23:17:05,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:05,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-31 23:17:05,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:05,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:05,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:05,512 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 243 flow. Second operand 7 states and 912 transitions. [2023-08-31 23:17:05,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 729 flow [2023-08-31 23:17:05,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:05,607 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 283 flow [2023-08-31 23:17:05,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-08-31 23:17:05,607 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-31 23:17:05,607 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 283 flow [2023-08-31 23:17:05,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:05,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:05,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:05,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:05,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:05,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:05,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash -536939306, now seen corresponding path program 6 times [2023-08-31 23:17:05,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:05,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659546922] [2023-08-31 23:17:05,819 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:17:05,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:05,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:05,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:05,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:17:05,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:17:05,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:17:05,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:06,070 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:17:06,071 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:06,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:17:06,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:17:06,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:17:06,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:17:06,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:17:06,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:17:06,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:06,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:06,289 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:06,294 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:06,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:06,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:06 BasicIcfg [2023-08-31 23:17:06,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:06,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:06,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:06,371 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:06,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:47" (3/4) ... [2023-08-31 23:17:06,374 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:06,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:06,375 INFO L158 Benchmark]: Toolchain (without parser) took 19942.86ms. Allocated memory was 69.2MB in the beginning and 790.6MB in the end (delta: 721.4MB). Free memory was 41.0MB in the beginning and 503.9MB in the end (delta: -462.9MB). Peak memory consumption was 259.5MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,375 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:06,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.97ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 32.4MB in the end (delta: 8.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 69.2MB. Free memory was 32.4MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,376 INFO L158 Benchmark]: Boogie Preprocessor took 44.47ms. Allocated memory is still 69.2MB. Free memory was 29.8MB in the beginning and 47.3MB in the end (delta: -17.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,376 INFO L158 Benchmark]: RCFGBuilder took 769.93ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 47.3MB in the beginning and 56.6MB in the end (delta: -9.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,377 INFO L158 Benchmark]: TraceAbstraction took 18496.31ms. Allocated memory was 83.9MB in the beginning and 790.6MB in the end (delta: 706.7MB). Free memory was 55.6MB in the beginning and 503.9MB in the end (delta: -448.2MB). Peak memory consumption was 258.9MB. Max. memory is 16.1GB. [2023-08-31 23:17:06,377 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 790.6MB. Free memory was 503.9MB in the beginning and 503.9MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:06,379 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 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.97ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 32.4MB in the end (delta: 8.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 69.2MB. Free memory was 32.4MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.47ms. Allocated memory is still 69.2MB. Free memory was 29.8MB in the beginning and 47.3MB in the end (delta: -17.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 769.93ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 47.3MB in the beginning and 56.6MB in the end (delta: -9.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18496.31ms. Allocated memory was 83.9MB in the beginning and 790.6MB in the end (delta: 706.7MB). Free memory was 55.6MB in the beginning and 503.9MB in the end (delta: -448.2MB). Peak memory consumption was 258.9MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 790.6MB. Free memory was 503.9MB in the beginning and 503.9MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 148 PlacesBefore, 51 PlacesAfterwards, 137 TransitionsBefore, 39 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 8793 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3546, independent: 3330, independent conditional: 0, independent unconditional: 3330, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1647, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3546, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 1647, unknown conditional: 0, unknown unconditional: 1647] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-1, t717={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=0, t717={11:0}, t718={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=1, t717={11:0}, t718={15:0}, t719={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=2, t717={11:0}, t718={15:0}, t719={7:0}, t720={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t717={11:0}, t718={15:0}, t719={7:0}, t720={-2147483637:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 855]: 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: 859]: 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, 176 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1779 IncrementalHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 41 mSDtfsCounter, 1779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 850 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:06,401 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