./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --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:31:13,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:31:13,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:31:13,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:31:13,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:31:13,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:31:13,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:31:13,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:31:13,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:31:13,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:31:13,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:31:13,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:31:13,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:31:13,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:31:13,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:31:13,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:31:13,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:31:13,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:31:13,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:31:13,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:31:13,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:31:13,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:31:13,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:31:13,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:31:13,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:31:13,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:31:13,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:31:13,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:31:13,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:31:13,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:31:13,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:31:13,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:31:13,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:31:13,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:31:13,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:31:13,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:31:13,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:31:13,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:31:13,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:31:13,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:31:13,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:31:13,331 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:31:13,360 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:31:13,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:31:13,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:31:13,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:31:13,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:31:13,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:31:13,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:31:13,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:31:13,363 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:31:13,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:31:13,364 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:31:13,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:31:13,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:31:13,365 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:31:13,366 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:31:13,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:31:13,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:31:13,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:31:13,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:13,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:31:13,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:31:13,367 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:31:13,367 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 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:31:13,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:31:13,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:31:13,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:31:13,646 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:31:13,646 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:31:13,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:14,593 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:31:14,755 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:31:14,756 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:14,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63abf1260/8dc8ddacd61a44e68f72ad8901f9156e/FLAGb6354bfea [2023-08-31 23:31:14,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63abf1260/8dc8ddacd61a44e68f72ad8901f9156e [2023-08-31 23:31:14,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:31:14,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:31:14,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:14,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:31:14,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:31:14,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:14" (1/1) ... [2023-08-31 23:31:14,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdb577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:14, skipping insertion in model container [2023-08-31 23:31:14,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:14" (1/1) ... [2023-08-31 23:31:14,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:31:14,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:31:14,916 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-31 23:31:15,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:15,118 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:31:15,128 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-31 23:31:15,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:15,213 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:15,214 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:15,218 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:31:15,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15 WrapperNode [2023-08-31 23:31:15,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:15,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:15,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:31:15,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:31:15,225 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:31:15" (1/1) ... [2023-08-31 23:31:15,251 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:31:15" (1/1) ... [2023-08-31 23:31:15,275 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2023-08-31 23:31:15,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:15,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:31:15,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:31:15,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:31:15,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:31:15,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:31:15,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:31:15,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:31:15,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (1/1) ... [2023-08-31 23:31:15,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:31:15,366 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:31:15,382 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:31:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:31:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:31:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:31:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:31:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:31:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:31:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:31:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:31:15,394 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:31:15,514 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:31:15,516 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:31:15,863 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:31:16,192 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:31:16,192 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:31:16,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:16 BoogieIcfgContainer [2023-08-31 23:31:16,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:31:16,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:31:16,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:31:16,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:31:16,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:31:14" (1/3) ... [2023-08-31 23:31:16,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba6f0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:16, skipping insertion in model container [2023-08-31 23:31:16,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:15" (2/3) ... [2023-08-31 23:31:16,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba6f0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:16, skipping insertion in model container [2023-08-31 23:31:16,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:16" (3/3) ... [2023-08-31 23:31:16,201 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:16,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:31:16,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-08-31 23:31:16,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:31:16,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:31:16,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 135 transitions, 280 flow [2023-08-31 23:31:16,356 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-31 23:31:16,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:16,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 160 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-31 23:31:16,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 135 transitions, 280 flow [2023-08-31 23:31:16,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 133 transitions, 272 flow [2023-08-31 23:31:16,370 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:31:16,386 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 133 transitions, 272 flow [2023-08-31 23:31:16,389 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 133 transitions, 272 flow [2023-08-31 23:31:16,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 133 transitions, 272 flow [2023-08-31 23:31:16,440 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-31 23:31:16,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:16,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 160 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-31 23:31:16,443 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-31 23:31:21,754 INFO L134 LiptonReduction]: Checked pairs total: 12737 [2023-08-31 23:31:21,754 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-31 23:31:21,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:31:21,775 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;@34d814c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:31:21,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-08-31 23:31:21,777 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:31:21,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:21,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:21,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:31:21,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:21,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 769, now seen corresponding path program 1 times [2023-08-31 23:31:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:21,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389232152] [2023-08-31 23:31:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:21,852 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:31:21,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:21,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389232152] [2023-08-31 23:31:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389232152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:31:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320787311] [2023-08-31 23:31:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:31:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:21,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:31:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:31:21,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 255 [2023-08-31 23:31:21,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:31:21,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:21,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 255 [2023-08-31 23:31:21,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:22,118 INFO L130 PetriNetUnfolder]: 1032/1699 cut-off events. [2023-08-31 23:31:22,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 1699 events. 1032/1699 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 10427 event pairs, 1032 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 3383. Up to 1679 conditions per place. [2023-08-31 23:31:22,145 INFO L137 encePairwiseOnDemand]: 240/255 looper letters, 30 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:31:22,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 132 flow [2023-08-31 23:31:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:31:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:31:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-08-31 23:31:22,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49607843137254903 [2023-08-31 23:31:22,168 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-08-31 23:31:22,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-08-31 23:31:22,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:22,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-08-31 23:31:22,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:22,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:31:22,177 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:31:22,178 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 104 flow. Second operand 2 states and 253 transitions. [2023-08-31 23:31:22,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 132 flow [2023-08-31 23:31:22,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:22,181 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 70 flow [2023-08-31 23:31:22,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-31 23:31:22,184 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -16 predicate places. [2023-08-31 23:31:22,185 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 70 flow [2023-08-31 23:31:22,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:31:22,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:22,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:22,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:31:22,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:22,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 757889, now seen corresponding path program 1 times [2023-08-31 23:31:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199589987] [2023-08-31 23:31:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:22,446 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:31:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199589987] [2023-08-31 23:31:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199589987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795670593] [2023-08-31 23:31:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:22,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:22,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 255 [2023-08-31 23:31:22,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:31:22,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:22,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 255 [2023-08-31 23:31:22,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:22,567 INFO L130 PetriNetUnfolder]: 442/760 cut-off events. [2023-08-31 23:31:22,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:22,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 760 events. 442/760 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4074 event pairs, 442 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 1513. Up to 743 conditions per place. [2023-08-31 23:31:22,570 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 23 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-31 23:31:22,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 106 flow [2023-08-31 23:31:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-31 23:31:22,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392156862745098 [2023-08-31 23:31:22,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-31 23:31:22,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-31 23:31:22,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:22,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-31 23:31:22,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:31:22,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,592 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 70 flow. Second operand 3 states and 336 transitions. [2023-08-31 23:31:22,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 106 flow [2023-08-31 23:31:22,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:31:22,593 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-31 23:31:22,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 23:31:22,593 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -20 predicate places. [2023-08-31 23:31:22,593 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-31 23:31:22,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:31:22,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:22,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:31:22,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:22,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 757888, now seen corresponding path program 1 times [2023-08-31 23:31:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:22,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436637276] [2023-08-31 23:31:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:22,647 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:31:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436637276] [2023-08-31 23:31:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436637276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694529058] [2023-08-31 23:31:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:22,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:22,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:22,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 255 [2023-08-31 23:31:22,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:31:22,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:22,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 255 [2023-08-31 23:31:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:22,763 INFO L130 PetriNetUnfolder]: 332/625 cut-off events. [2023-08-31 23:31:22,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:22,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 625 events. 332/625 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3202 event pairs, 213 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 1243. Up to 378 conditions per place. [2023-08-31 23:31:22,766 INFO L137 encePairwiseOnDemand]: 242/255 looper letters, 25 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2023-08-31 23:31:22,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 136 flow [2023-08-31 23:31:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-31 23:31:22,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790849673202614 [2023-08-31 23:31:22,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-31 23:31:22,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-31 23:31:22,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:22,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-31 23:31:22,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:31:22,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,771 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 335 transitions. [2023-08-31 23:31:22,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 136 flow [2023-08-31 23:31:22,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:22,772 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 111 flow [2023-08-31 23:31:22,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-31 23:31:22,772 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -19 predicate places. [2023-08-31 23:31:22,772 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 111 flow [2023-08-31 23:31:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:31:22,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:22,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:22,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:31:22,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:22,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1522646157, now seen corresponding path program 1 times [2023-08-31 23:31:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183305596] [2023-08-31 23:31:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:22,829 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:31:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:22,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183305596] [2023-08-31 23:31:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183305596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:22,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484726579] [2023-08-31 23:31:22,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:22,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:22,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 255 [2023-08-31 23:31:22,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:31:22,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:22,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 255 [2023-08-31 23:31:22,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:22,942 INFO L130 PetriNetUnfolder]: 285/587 cut-off events. [2023-08-31 23:31:22,942 INFO L131 PetriNetUnfolder]: For 164/175 co-relation queries the response was YES. [2023-08-31 23:31:22,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 587 events. 285/587 cut-off events. For 164/175 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3255 event pairs, 101 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 1520. Up to 356 conditions per place. [2023-08-31 23:31:22,945 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 41 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-08-31 23:31:22,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 263 flow [2023-08-31 23:31:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-31 23:31:22,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4549019607843137 [2023-08-31 23:31:22,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-31 23:31:22,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-31 23:31:22,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:22,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-31 23:31:22,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:31:22,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:22,950 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 111 flow. Second operand 3 states and 348 transitions. [2023-08-31 23:31:22,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 263 flow [2023-08-31 23:31:22,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:22,952 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 110 flow [2023-08-31 23:31:22,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-31 23:31:22,953 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -18 predicate places. [2023-08-31 23:31:22,953 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 110 flow [2023-08-31 23:31:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:31:22,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:22,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:22,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:31:22,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:22,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1522646349, now seen corresponding path program 1 times [2023-08-31 23:31:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855106607] [2023-08-31 23:31:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:23,189 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:31:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855106607] [2023-08-31 23:31:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855106607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173885790] [2023-08-31 23:31:23,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:23,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:23,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 255 [2023-08-31 23:31:23,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:31:23,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:23,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 255 [2023-08-31 23:31:23,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:23,358 INFO L130 PetriNetUnfolder]: 281/565 cut-off events. [2023-08-31 23:31:23,358 INFO L131 PetriNetUnfolder]: For 178/185 co-relation queries the response was YES. [2023-08-31 23:31:23,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 565 events. 281/565 cut-off events. For 178/185 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3008 event pairs, 123 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1530. Up to 488 conditions per place. [2023-08-31 23:31:23,361 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 35 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-31 23:31:23,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 234 flow [2023-08-31 23:31:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-31 23:31:23,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790849673202614 [2023-08-31 23:31:23,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-31 23:31:23,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-31 23:31:23,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:23,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-31 23:31:23,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:31:23,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:23,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:23,365 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 110 flow. Second operand 3 states and 335 transitions. [2023-08-31 23:31:23,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 234 flow [2023-08-31 23:31:23,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:23,368 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 136 flow [2023-08-31 23:31:23,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-31 23:31:23,370 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -17 predicate places. [2023-08-31 23:31:23,370 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 136 flow [2023-08-31 23:31:23,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:31:23,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:23,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:23,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:31:23,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:23,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -42604304, now seen corresponding path program 1 times [2023-08-31 23:31:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:23,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141070572] [2023-08-31 23:31:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:23,557 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:31:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141070572] [2023-08-31 23:31:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141070572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:23,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:23,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:23,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243283812] [2023-08-31 23:31:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:23,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:23,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 255 [2023-08-31 23:31:23,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 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:31:23,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:23,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 255 [2023-08-31 23:31:23,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:23,676 INFO L130 PetriNetUnfolder]: 281/561 cut-off events. [2023-08-31 23:31:23,676 INFO L131 PetriNetUnfolder]: For 188/191 co-relation queries the response was YES. [2023-08-31 23:31:23,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 561 events. 281/561 cut-off events. For 188/191 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3004 event pairs, 65 based on Foata normal form. 2/463 useless extension candidates. Maximal degree in co-relation 1591. Up to 432 conditions per place. [2023-08-31 23:31:23,679 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 38 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-31 23:31:23,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 258 flow [2023-08-31 23:31:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-31 23:31:23,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-31 23:31:23,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-31 23:31:23,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-31 23:31:23,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:23,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-31 23:31:23,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:31:23,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:23,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:23,683 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 136 flow. Second operand 3 states and 340 transitions. [2023-08-31 23:31:23,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 258 flow [2023-08-31 23:31:23,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:23,685 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 143 flow [2023-08-31 23:31:23,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-31 23:31:23,685 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-31 23:31:23,685 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 143 flow [2023-08-31 23:31:23,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 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:31:23,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:23,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:23,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:31:23,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:23,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -913190674, now seen corresponding path program 1 times [2023-08-31 23:31:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689771699] [2023-08-31 23:31:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:23,758 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:31:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:23,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689771699] [2023-08-31 23:31:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689771699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:31:23,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147427501] [2023-08-31 23:31:23,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:23,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:23,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 255 [2023-08-31 23:31:23,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:31:23,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:23,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 255 [2023-08-31 23:31:23,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:23,943 INFO L130 PetriNetUnfolder]: 293/569 cut-off events. [2023-08-31 23:31:23,943 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2023-08-31 23:31:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1693 conditions, 569 events. 293/569 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2912 event pairs, 118 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 1685. Up to 252 conditions per place. [2023-08-31 23:31:23,946 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 43 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2023-08-31 23:31:23,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 320 flow [2023-08-31 23:31:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-31 23:31:23,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42549019607843136 [2023-08-31 23:31:23,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-31 23:31:23,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-31 23:31:23,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:23,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-31 23:31:23,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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:31:23,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:23,950 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:23,951 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 143 flow. Second operand 4 states and 434 transitions. [2023-08-31 23:31:23,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 320 flow [2023-08-31 23:31:23,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:23,952 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 195 flow [2023-08-31 23:31:23,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-31 23:31:23,953 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-31 23:31:23,953 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 195 flow [2023-08-31 23:31:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:31:23,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:23,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:23,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:31:23,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:23,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash -42604495, now seen corresponding path program 1 times [2023-08-31 23:31:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953411312] [2023-08-31 23:31:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:24,104 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:31:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953411312] [2023-08-31 23:31:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953411312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389503557] [2023-08-31 23:31:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:24,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:24,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 255 [2023-08-31 23:31:24,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 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:31:24,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:24,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 255 [2023-08-31 23:31:24,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:24,248 INFO L130 PetriNetUnfolder]: 258/522 cut-off events. [2023-08-31 23:31:24,248 INFO L131 PetriNetUnfolder]: For 681/685 co-relation queries the response was YES. [2023-08-31 23:31:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 522 events. 258/522 cut-off events. For 681/685 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2700 event pairs, 124 based on Foata normal form. 8/459 useless extension candidates. Maximal degree in co-relation 1699. Up to 313 conditions per place. [2023-08-31 23:31:24,251 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 39 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-31 23:31:24,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 321 flow [2023-08-31 23:31:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-31 23:31:24,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392156862745098 [2023-08-31 23:31:24,252 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-31 23:31:24,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-31 23:31:24,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:24,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-31 23:31:24,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:31:24,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:24,255 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:24,255 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 195 flow. Second operand 4 states and 448 transitions. [2023-08-31 23:31:24,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 321 flow [2023-08-31 23:31:24,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:24,257 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 192 flow [2023-08-31 23:31:24,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-31 23:31:24,258 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-31 23:31:24,258 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 192 flow [2023-08-31 23:31:24,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 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:31:24,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:24,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:24,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:31:24,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:24,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash -42443228, now seen corresponding path program 1 times [2023-08-31 23:31:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588106357] [2023-08-31 23:31:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588106357] [2023-08-31 23:31:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588106357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:24,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:24,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:24,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441393562] [2023-08-31 23:31:24,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:24,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:24,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 255 [2023-08-31 23:31:24,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:31:24,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:24,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 255 [2023-08-31 23:31:24,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:24,492 INFO L130 PetriNetUnfolder]: 251/509 cut-off events. [2023-08-31 23:31:24,492 INFO L131 PetriNetUnfolder]: For 644/647 co-relation queries the response was YES. [2023-08-31 23:31:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 509 events. 251/509 cut-off events. For 644/647 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2633 event pairs, 122 based on Foata normal form. 3/442 useless extension candidates. Maximal degree in co-relation 1650. Up to 307 conditions per place. [2023-08-31 23:31:24,494 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-31 23:31:24,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 314 flow [2023-08-31 23:31:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-31 23:31:24,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45359477124183006 [2023-08-31 23:31:24,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-31 23:31:24,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-31 23:31:24,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:24,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-31 23:31:24,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:31:24,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:24,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:24,497 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 192 flow. Second operand 3 states and 347 transitions. [2023-08-31 23:31:24,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 314 flow [2023-08-31 23:31:24,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:24,500 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 203 flow [2023-08-31 23:31:24,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-31 23:31:24,501 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-08-31 23:31:24,501 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 203 flow [2023-08-31 23:31:24,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:31:24,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:24,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:24,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:31:24,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:24,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1320734105, now seen corresponding path program 1 times [2023-08-31 23:31:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194922718] [2023-08-31 23:31:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:24,782 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:31:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194922718] [2023-08-31 23:31:24,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194922718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:24,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:31:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249450783] [2023-08-31 23:31:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:24,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:31:24,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:24,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:31:24,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:31:24,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 255 [2023-08-31 23:31:24,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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:31:24,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:24,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 255 [2023-08-31 23:31:24,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:25,010 INFO L130 PetriNetUnfolder]: 492/933 cut-off events. [2023-08-31 23:31:25,010 INFO L131 PetriNetUnfolder]: For 997/1028 co-relation queries the response was YES. [2023-08-31 23:31:25,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3009 conditions, 933 events. 492/933 cut-off events. For 997/1028 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5307 event pairs, 128 based on Foata normal form. 19/818 useless extension candidates. Maximal degree in co-relation 2999. Up to 329 conditions per place. [2023-08-31 23:31:25,015 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 82 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2023-08-31 23:31:25,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 624 flow [2023-08-31 23:31:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-08-31 23:31:25,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4366013071895425 [2023-08-31 23:31:25,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-08-31 23:31:25,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-08-31 23:31:25,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:25,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-08-31 23:31:25,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:31:25,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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:31:25,020 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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:31:25,020 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 203 flow. Second operand 6 states and 668 transitions. [2023-08-31 23:31:25,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 94 transitions, 624 flow [2023-08-31 23:31:25,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:25,023 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 231 flow [2023-08-31 23:31:25,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-31 23:31:25,023 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2023-08-31 23:31:25,023 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 231 flow [2023-08-31 23:31:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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:31:25,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:25,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:25,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:31:25,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:25,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1315740935, now seen corresponding path program 2 times [2023-08-31 23:31:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396628088] [2023-08-31 23:31:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:25,152 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:31:25,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:25,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396628088] [2023-08-31 23:31:25,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396628088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:25,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644727206] [2023-08-31 23:31:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:25,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:25,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:25,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 255 [2023-08-31 23:31:25,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:25,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:25,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 255 [2023-08-31 23:31:25,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:25,351 INFO L130 PetriNetUnfolder]: 576/1102 cut-off events. [2023-08-31 23:31:25,352 INFO L131 PetriNetUnfolder]: For 1749/1786 co-relation queries the response was YES. [2023-08-31 23:31:25,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 1102 events. 576/1102 cut-off events. For 1749/1786 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6663 event pairs, 139 based on Foata normal form. 19/953 useless extension candidates. Maximal degree in co-relation 3743. Up to 494 conditions per place. [2023-08-31 23:31:25,356 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 60 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-31 23:31:25,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 489 flow [2023-08-31 23:31:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-31 23:31:25,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392156862745098 [2023-08-31 23:31:25,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-31 23:31:25,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-31 23:31:25,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:25,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-31 23:31:25,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:31:25,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:25,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:25,360 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 231 flow. Second operand 4 states and 448 transitions. [2023-08-31 23:31:25,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 489 flow [2023-08-31 23:31:25,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 474 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:25,364 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 234 flow [2023-08-31 23:31:25,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-31 23:31:25,364 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-08-31 23:31:25,364 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 234 flow [2023-08-31 23:31:25,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:25,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:25,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:25,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:31:25,365 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:25,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2008375541, now seen corresponding path program 1 times [2023-08-31 23:31:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653015623] [2023-08-31 23:31:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653015623] [2023-08-31 23:31:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653015623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:25,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:25,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302414087] [2023-08-31 23:31:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:25,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:25,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 255 [2023-08-31 23:31:25,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:31:25,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:25,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 255 [2023-08-31 23:31:25,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:25,803 INFO L130 PetriNetUnfolder]: 507/1009 cut-off events. [2023-08-31 23:31:25,803 INFO L131 PetriNetUnfolder]: For 1327/1367 co-relation queries the response was YES. [2023-08-31 23:31:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1009 events. 507/1009 cut-off events. For 1327/1367 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6223 event pairs, 277 based on Foata normal form. 10/931 useless extension candidates. Maximal degree in co-relation 3293. Up to 537 conditions per place. [2023-08-31 23:31:25,807 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 52 selfloop transitions, 8 changer transitions 3/69 dead transitions. [2023-08-31 23:31:25,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 545 flow [2023-08-31 23:31:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:31:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:31:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-31 23:31:25,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992156862745098 [2023-08-31 23:31:25,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-31 23:31:25,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-31 23:31:25,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:25,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-31 23:31:25,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:31:25,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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:31:25,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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:31:25,812 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 234 flow. Second operand 5 states and 509 transitions. [2023-08-31 23:31:25,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 545 flow [2023-08-31 23:31:25,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 486 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-31 23:31:25,816 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 271 flow [2023-08-31 23:31:25,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-31 23:31:25,816 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:31:25,816 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 271 flow [2023-08-31 23:31:25,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:31:25,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:25,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:25,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:31:25,817 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:25,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1320687048, now seen corresponding path program 1 times [2023-08-31 23:31:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325502698] [2023-08-31 23:31:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:25,890 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:31:25,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325502698] [2023-08-31 23:31:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325502698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895377780] [2023-08-31 23:31:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:25,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 255 [2023-08-31 23:31:25,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:25,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:25,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 255 [2023-08-31 23:31:25,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:26,073 INFO L130 PetriNetUnfolder]: 498/978 cut-off events. [2023-08-31 23:31:26,073 INFO L131 PetriNetUnfolder]: For 1153/1161 co-relation queries the response was YES. [2023-08-31 23:31:26,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 978 events. 498/978 cut-off events. For 1153/1161 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5809 event pairs, 253 based on Foata normal form. 35/964 useless extension candidates. Maximal degree in co-relation 3276. Up to 474 conditions per place. [2023-08-31 23:31:26,077 INFO L137 encePairwiseOnDemand]: 244/255 looper letters, 42 selfloop transitions, 16 changer transitions 1/61 dead transitions. [2023-08-31 23:31:26,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 490 flow [2023-08-31 23:31:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-08-31 23:31:26,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40980392156862744 [2023-08-31 23:31:26,078 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-08-31 23:31:26,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-08-31 23:31:26,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:26,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-08-31 23:31:26,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:31:26,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:26,081 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:26,081 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 271 flow. Second operand 4 states and 418 transitions. [2023-08-31 23:31:26,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 490 flow [2023-08-31 23:31:26,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 481 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:26,084 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 379 flow [2023-08-31 23:31:26,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-31 23:31:26,084 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2023-08-31 23:31:26,085 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 379 flow [2023-08-31 23:31:26,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:26,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:26,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:26,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:31:26,085 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:26,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1350415960, now seen corresponding path program 1 times [2023-08-31 23:31:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086618734] [2023-08-31 23:31:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:26,813 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:31:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:26,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086618734] [2023-08-31 23:31:26,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086618734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:26,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:26,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:31:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284347118] [2023-08-31 23:31:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:26,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:31:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:26,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:31:26,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:31:26,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 255 [2023-08-31 23:31:26,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:31:26,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:26,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 255 [2023-08-31 23:31:26,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:27,352 INFO L130 PetriNetUnfolder]: 487/971 cut-off events. [2023-08-31 23:31:27,352 INFO L131 PetriNetUnfolder]: For 1873/1880 co-relation queries the response was YES. [2023-08-31 23:31:27,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 971 events. 487/971 cut-off events. For 1873/1880 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5808 event pairs, 75 based on Foata normal form. 11/939 useless extension candidates. Maximal degree in co-relation 3593. Up to 691 conditions per place. [2023-08-31 23:31:27,357 INFO L137 encePairwiseOnDemand]: 247/255 looper letters, 54 selfloop transitions, 24 changer transitions 1/81 dead transitions. [2023-08-31 23:31:27,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 745 flow [2023-08-31 23:31:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:31:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:31:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 957 transitions. [2023-08-31 23:31:27,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37529411764705883 [2023-08-31 23:31:27,359 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 957 transitions. [2023-08-31 23:31:27,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 957 transitions. [2023-08-31 23:31:27,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:27,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 957 transitions. [2023-08-31 23:31:27,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:27,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:31:27,365 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:31:27,365 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 379 flow. Second operand 10 states and 957 transitions. [2023-08-31 23:31:27,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 745 flow [2023-08-31 23:31:27,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:27,377 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 583 flow [2023-08-31 23:31:27,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=583, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-08-31 23:31:27,378 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2023-08-31 23:31:27,378 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 583 flow [2023-08-31 23:31:27,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:31:27,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:27,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:27,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:31:27,379 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:27,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1402705273, now seen corresponding path program 2 times [2023-08-31 23:31:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106377154] [2023-08-31 23:31:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:27,516 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:31:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106377154] [2023-08-31 23:31:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106377154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118574457] [2023-08-31 23:31:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:27,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:27,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 255 [2023-08-31 23:31:27,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:31:27,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:27,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 255 [2023-08-31 23:31:27,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:27,696 INFO L130 PetriNetUnfolder]: 382/792 cut-off events. [2023-08-31 23:31:27,696 INFO L131 PetriNetUnfolder]: For 2374/2423 co-relation queries the response was YES. [2023-08-31 23:31:27,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 792 events. 382/792 cut-off events. For 2374/2423 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4764 event pairs, 174 based on Foata normal form. 8/781 useless extension candidates. Maximal degree in co-relation 3162. Up to 373 conditions per place. [2023-08-31 23:31:27,704 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 41 selfloop transitions, 18 changer transitions 3/72 dead transitions. [2023-08-31 23:31:27,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 741 flow [2023-08-31 23:31:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:31:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:31:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-08-31 23:31:27,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3898039215686275 [2023-08-31 23:31:27,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-08-31 23:31:27,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-08-31 23:31:27,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:27,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-08-31 23:31:27,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:27,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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:31:27,709 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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:31:27,709 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 583 flow. Second operand 5 states and 497 transitions. [2023-08-31 23:31:27,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 741 flow [2023-08-31 23:31:27,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 707 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:27,717 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 528 flow [2023-08-31 23:31:27,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-31 23:31:27,718 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2023-08-31 23:31:27,718 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 528 flow [2023-08-31 23:31:27,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:31:27,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:27,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:27,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:31:27,718 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:27,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:27,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2008377541, now seen corresponding path program 1 times [2023-08-31 23:31:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:27,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589169778] [2023-08-31 23:31:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:27,765 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:31:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589169778] [2023-08-31 23:31:27,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589169778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:27,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078860705] [2023-08-31 23:31:27,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:27,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:27,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 255 [2023-08-31 23:31:27,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 528 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:27,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:27,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 255 [2023-08-31 23:31:27,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:27,909 INFO L130 PetriNetUnfolder]: 410/789 cut-off events. [2023-08-31 23:31:27,909 INFO L131 PetriNetUnfolder]: For 2729/2738 co-relation queries the response was YES. [2023-08-31 23:31:27,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 789 events. 410/789 cut-off events. For 2729/2738 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4340 event pairs, 279 based on Foata normal form. 28/811 useless extension candidates. Maximal degree in co-relation 3177. Up to 687 conditions per place. [2023-08-31 23:31:27,912 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 15 selfloop transitions, 1 changer transitions 39/56 dead transitions. [2023-08-31 23:31:27,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 631 flow [2023-08-31 23:31:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-08-31 23:31:27,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403921568627451 [2023-08-31 23:31:27,914 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-08-31 23:31:27,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-08-31 23:31:27,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:27,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-08-31 23:31:27,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:31:27,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:27,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:27,918 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 528 flow. Second operand 4 states and 412 transitions. [2023-08-31 23:31:27,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 631 flow [2023-08-31 23:31:27,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 575 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:31:27,926 INFO L231 Difference]: Finished difference. Result has 63 places, 17 transitions, 94 flow [2023-08-31 23:31:27,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=63, PETRI_TRANSITIONS=17} [2023-08-31 23:31:27,927 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-08-31 23:31:27,928 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 17 transitions, 94 flow [2023-08-31 23:31:27,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:27,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:27,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:31:27,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:27,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash -440518205, now seen corresponding path program 1 times [2023-08-31 23:31:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994539364] [2023-08-31 23:31:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:28,071 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:31:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994539364] [2023-08-31 23:31:28,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994539364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:28,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:28,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:28,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134221680] [2023-08-31 23:31:28,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:28,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:28,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:28,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 255 [2023-08-31 23:31:28,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 17 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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:31:28,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:28,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 255 [2023-08-31 23:31:28,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:28,107 INFO L130 PetriNetUnfolder]: 35/98 cut-off events. [2023-08-31 23:31:28,107 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2023-08-31 23:31:28,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 98 events. 35/98 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 304 event pairs, 14 based on Foata normal form. 7/104 useless extension candidates. Maximal degree in co-relation 299. Up to 77 conditions per place. [2023-08-31 23:31:28,108 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 19 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-31 23:31:28,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 24 transitions, 162 flow [2023-08-31 23:31:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-31 23:31:28,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2023-08-31 23:31:28,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-31 23:31:28,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-31 23:31:28,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:28,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-31 23:31:28,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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:31:28,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:28,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:31:28,112 INFO L175 Difference]: Start difference. First operand has 63 places, 17 transitions, 94 flow. Second operand 3 states and 324 transitions. [2023-08-31 23:31:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 24 transitions, 162 flow [2023-08-31 23:31:28,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 24 transitions, 128 flow, removed 4 selfloop flow, removed 13 redundant places. [2023-08-31 23:31:28,113 INFO L231 Difference]: Finished difference. Result has 41 places, 19 transitions, 83 flow [2023-08-31 23:31:28,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2023-08-31 23:31:28,113 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2023-08-31 23:31:28,114 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 83 flow [2023-08-31 23:31:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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:31:28,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:28,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:31:28,114 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:28,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 984292553, now seen corresponding path program 1 times [2023-08-31 23:31:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329928440] [2023-08-31 23:31:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:28,258 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:31:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329928440] [2023-08-31 23:31:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329928440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041000721] [2023-08-31 23:31:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:28,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:28,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:28,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 255 [2023-08-31 23:31:28,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 19 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:31:28,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:28,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 255 [2023-08-31 23:31:28,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:28,292 INFO L130 PetriNetUnfolder]: 13/54 cut-off events. [2023-08-31 23:31:28,292 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-31 23:31:28,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 54 events. 13/54 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 2 based on Foata normal form. 8/60 useless extension candidates. Maximal degree in co-relation 176. Up to 22 conditions per place. [2023-08-31 23:31:28,293 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 17 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2023-08-31 23:31:28,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 24 transitions, 143 flow [2023-08-31 23:31:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-31 23:31:28,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-08-31 23:31:28,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-31 23:31:28,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-31 23:31:28,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:28,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-31 23:31:28,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:28,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:28,297 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:31:28,297 INFO L175 Difference]: Start difference. First operand has 41 places, 19 transitions, 83 flow. Second operand 4 states and 425 transitions. [2023-08-31 23:31:28,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 24 transitions, 143 flow [2023-08-31 23:31:28,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 24 transitions, 129 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:28,298 INFO L231 Difference]: Finished difference. Result has 42 places, 19 transitions, 87 flow [2023-08-31 23:31:28,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=19} [2023-08-31 23:31:28,298 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-31 23:31:28,298 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 19 transitions, 87 flow [2023-08-31 23:31:28,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:31:28,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:28,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:28,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:31:28,299 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:28,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 289821317, now seen corresponding path program 1 times [2023-08-31 23:31:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675037500] [2023-08-31 23:31:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:31:28,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:31:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:31:28,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:31:28,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:31:28,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2023-08-31 23:31:28,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2023-08-31 23:31:28,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2023-08-31 23:31:28,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2023-08-31 23:31:28,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2023-08-31 23:31:28,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2023-08-31 23:31:28,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2023-08-31 23:31:28,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2023-08-31 23:31:28,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2023-08-31 23:31:28,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2023-08-31 23:31:28,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2023-08-31 23:31:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:31:28,417 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:28,422 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:31:28,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:31:28,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:31:28 BasicIcfg [2023-08-31 23:31:28,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:31:28,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:31:28,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:31:28,482 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:31:28,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:16" (3/4) ... [2023-08-31 23:31:28,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:31:28,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:31:28,485 INFO L158 Benchmark]: Toolchain (without parser) took 13706.21ms. Allocated memory was 67.1MB in the beginning and 432.0MB in the end (delta: 364.9MB). Free memory was 43.7MB in the beginning and 386.4MB in the end (delta: -342.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,485 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:31:28,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.5MB in the beginning and 50.7MB in the end (delta: -7.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.69ms. Allocated memory is still 81.8MB. Free memory was 50.7MB in the beginning and 48.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,486 INFO L158 Benchmark]: Boogie Preprocessor took 22.06ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,486 INFO L158 Benchmark]: RCFGBuilder took 895.70ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 46.5MB in the beginning and 72.7MB in the end (delta: -26.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,486 INFO L158 Benchmark]: TraceAbstraction took 12285.01ms. Allocated memory was 104.9MB in the beginning and 432.0MB in the end (delta: 327.2MB). Free memory was 72.0MB in the beginning and 386.4MB in the end (delta: -314.4MB). Peak memory consumption was 254.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:28,486 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 432.0MB. Free memory is still 386.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:31:28,488 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 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.5MB in the beginning and 50.7MB in the end (delta: -7.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.69ms. Allocated memory is still 81.8MB. Free memory was 50.7MB in the beginning and 48.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.06ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 895.70ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 46.5MB in the beginning and 72.7MB in the end (delta: -26.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12285.01ms. Allocated memory was 104.9MB in the beginning and 432.0MB in the end (delta: 327.2MB). Free memory was 72.0MB in the beginning and 386.4MB in the end (delta: -314.4MB). Peak memory consumption was 254.1MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 432.0MB. Free memory is still 386.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 138 PlacesBefore, 55 PlacesAfterwards, 133 TransitionsBefore, 49 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 12737 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5202, independent: 4837, independent conditional: 0, independent unconditional: 4837, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1405, independent: 1350, independent conditional: 0, independent unconditional: 1350, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5202, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 1405, unknown conditional: 0, unknown unconditional: 1405] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={6:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L814] 0 pthread_t t1930; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={6:0}, t1930={5:0}, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 169 locations, 50 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: 12.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1168 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 783 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 82 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=583occurred in iteration=14, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:31:28,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --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:31:30,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:31:30,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:31:30,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:31:30,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:31:30,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:31:30,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:31:30,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:31:30,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:31:30,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:31:30,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:31:30,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:31:30,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:31:30,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:31:30,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:31:30,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:31:30,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:31:30,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:31:30,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:31:30,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:31:30,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:31:30,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:31:30,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:31:30,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:31:30,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:31:30,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:31:30,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:31:30,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:31:30,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:31:30,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:31:30,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:31:30,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:31:30,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:31:30,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:31:30,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:31:30,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:31:30,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:31:30,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:31:30,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:31:30,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:31:30,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:31:30,257 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:31:30,281 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:31:30,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:31:30,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:31:30,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:31:30,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:31:30,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:31:30,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:31:30,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:31:30,283 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:31:30,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:31:30,284 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:31:30,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:31:30,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:31:30,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:31:30,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:31:30,285 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:31:30,286 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:31:30,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:31:30,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:31:30,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:31:30,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:30,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:31:30,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:31:30,287 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:31:30,287 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 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:31:30,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:31:30,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:31:30,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:31:30,519 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:31:30,520 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:31:30,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:31,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:31:31,778 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:31:31,779 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:31,786 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c608f88/b196ab80050042e1bba5ef6ae6b539f7/FLAGe6beaac93 [2023-08-31 23:31:31,797 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c608f88/b196ab80050042e1bba5ef6ae6b539f7 [2023-08-31 23:31:31,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:31:31,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:31:31,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:31,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:31:31,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:31:31,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:31" (1/1) ... [2023-08-31 23:31:31,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684d0dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:31, skipping insertion in model container [2023-08-31 23:31:31,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:31:31" (1/1) ... [2023-08-31 23:31:31,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:31:31,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:31:31,921 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-31 23:31:32,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:32,031 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:31:32,038 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-31 23:31:32,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:31:32,086 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:32,087 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:31:32,091 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:31:32,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32 WrapperNode [2023-08-31 23:31:32,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:31:32,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:32,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:31:32,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:31:32,097 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:31:32" (1/1) ... [2023-08-31 23:31:32,108 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:31:32" (1/1) ... [2023-08-31 23:31:32,121 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 122 [2023-08-31 23:31:32,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:31:32,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:31:32,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:31:32,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:31:32,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:31:32,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:31:32,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:31:32,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:31:32,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (1/1) ... [2023-08-31 23:31:32,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:31:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:31:32,172 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:31:32,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:31:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:31:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:31:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:31:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:31:32,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:31:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:31:32,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:31:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:31:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:31:32,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:31:32,205 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:31:32,342 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:31:32,343 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:31:32,667 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:31:33,026 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:31:33,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:31:33,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:33 BoogieIcfgContainer [2023-08-31 23:31:33,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:31:33,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:31:33,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:31:33,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:31:33,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:31:31" (1/3) ... [2023-08-31 23:31:33,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d98c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:33, skipping insertion in model container [2023-08-31 23:31:33,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:31:32" (2/3) ... [2023-08-31 23:31:33,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d98c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:31:33, skipping insertion in model container [2023-08-31 23:31:33,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:33" (3/3) ... [2023-08-31 23:31:33,035 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-31 23:31:33,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:31:33,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-08-31 23:31:33,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:31:33,113 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:31:33,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 136 transitions, 282 flow [2023-08-31 23:31:33,200 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-31 23:31:33,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 160 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-31 23:31:33,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 136 transitions, 282 flow [2023-08-31 23:31:33,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 134 transitions, 274 flow [2023-08-31 23:31:33,214 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:31:33,228 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 134 transitions, 274 flow [2023-08-31 23:31:33,231 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 134 transitions, 274 flow [2023-08-31 23:31:33,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 134 transitions, 274 flow [2023-08-31 23:31:33,252 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-31 23:31:33,252 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:33,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 160 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-31 23:31:33,254 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-31 23:31:42,674 INFO L134 LiptonReduction]: Checked pairs total: 11251 [2023-08-31 23:31:42,674 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-31 23:31:42,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:31:42,687 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;@7e7e9470, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:31:42,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-08-31 23:31:42,691 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:31:42,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:42,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:42,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:31:42,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:42,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash 774, now seen corresponding path program 1 times [2023-08-31 23:31:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275746965] [2023-08-31 23:31:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:42,706 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:31:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:42,709 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:31:42,744 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:31:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:42,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:31:42,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:42,772 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:31:42,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:42,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275746965] [2023-08-31 23:31:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275746965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:31:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515663123] [2023-08-31 23:31:42,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:42,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:31:42,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:42,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:31:42,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:31:42,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 258 [2023-08-31 23:31:42,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:31:42,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:42,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 258 [2023-08-31 23:31:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:43,127 INFO L130 PetriNetUnfolder]: 1032/1699 cut-off events. [2023-08-31 23:31:43,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:43,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 1699 events. 1032/1699 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 10411 event pairs, 1032 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 3383. Up to 1679 conditions per place. [2023-08-31 23:31:43,135 INFO L137 encePairwiseOnDemand]: 244/258 looper letters, 30 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:31:43,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 132 flow [2023-08-31 23:31:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:31:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:31:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2023-08-31 23:31:43,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49224806201550386 [2023-08-31 23:31:43,144 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2023-08-31 23:31:43,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2023-08-31 23:31:43,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:43,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2023-08-31 23:31:43,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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:31:43,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:31:43,151 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:31:43,152 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 100 flow. Second operand 2 states and 254 transitions. [2023-08-31 23:31:43,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 132 flow [2023-08-31 23:31:43,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:43,155 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 70 flow [2023-08-31 23:31:43,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-08-31 23:31:43,158 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2023-08-31 23:31:43,159 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 70 flow [2023-08-31 23:31:43,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:31:43,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:43,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:43,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 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:31:43,366 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:31:43,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:43,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 761797, now seen corresponding path program 1 times [2023-08-31 23:31:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128027154] [2023-08-31 23:31:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:43,368 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:31:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:43,369 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:31:43,371 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:31:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:43,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:31:43,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:31:43,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:31:43,528 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:31:43,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:43,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128027154] [2023-08-31 23:31:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128027154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46548498] [2023-08-31 23:31:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:43,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:43,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 258 [2023-08-31 23:31:43,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:31:43,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:43,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 258 [2023-08-31 23:31:43,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:43,690 INFO L130 PetriNetUnfolder]: 442/760 cut-off events. [2023-08-31 23:31:43,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:43,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 760 events. 442/760 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4068 event pairs, 442 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 1513. Up to 743 conditions per place. [2023-08-31 23:31:43,693 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 23 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-31 23:31:43,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 106 flow [2023-08-31 23:31:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-31 23:31:43,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-08-31 23:31:43,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-31 23:31:43,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-31 23:31:43,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:43,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-31 23:31:43,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:31:43,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:43,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:43,699 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 70 flow. Second operand 3 states and 342 transitions. [2023-08-31 23:31:43,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 106 flow [2023-08-31 23:31:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:31:43,700 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-31 23:31:43,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-31 23:31:43,701 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -19 predicate places. [2023-08-31 23:31:43,701 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-31 23:31:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:31:43,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:43,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:31:43,710 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:31:43,908 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:31:43,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:43,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 761796, now seen corresponding path program 1 times [2023-08-31 23:31:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648616029] [2023-08-31 23:31:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:43,916 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:31:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:43,928 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:31:43,931 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:31:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:43,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:31:43,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:44,002 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:31:44,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:31:44,032 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:31:44,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:44,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648616029] [2023-08-31 23:31:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648616029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:31:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114113667] [2023-08-31 23:31:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:44,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:44,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 258 [2023-08-31 23:31:44,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:31:44,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:44,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 258 [2023-08-31 23:31:44,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:44,160 INFO L130 PetriNetUnfolder]: 233/418 cut-off events. [2023-08-31 23:31:44,160 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:31:44,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 418 events. 233/418 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1894 event pairs, 155 based on Foata normal form. 21/326 useless extension candidates. Maximal degree in co-relation 838. Up to 208 conditions per place. [2023-08-31 23:31:44,162 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-31 23:31:44,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 122 flow [2023-08-31 23:31:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-31 23:31:44,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2023-08-31 23:31:44,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-31 23:31:44,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-31 23:31:44,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:44,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-31 23:31:44,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:31:44,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:44,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:44,167 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 340 transitions. [2023-08-31 23:31:44,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 122 flow [2023-08-31 23:31:44,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:31:44,168 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 69 flow [2023-08-31 23:31:44,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-08-31 23:31:44,169 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -19 predicate places. [2023-08-31 23:31:44,169 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 69 flow [2023-08-31 23:31:44,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:31:44,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:44,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:44,189 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:31:44,376 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:31:44,376 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:44,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2138937384, now seen corresponding path program 1 times [2023-08-31 23:31:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562038838] [2023-08-31 23:31:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:44,377 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:31:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:44,378 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:31:44,380 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:31:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:44,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:31:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:31:44,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:44,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:44,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562038838] [2023-08-31 23:31:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562038838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766396998] [2023-08-31 23:31:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:44,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:31:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:31:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:31:44,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 258 [2023-08-31 23:31:44,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:44,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 258 [2023-08-31 23:31:44,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:44,537 INFO L130 PetriNetUnfolder]: 63/152 cut-off events. [2023-08-31 23:31:44,538 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:31:44,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 152 events. 63/152 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 581 event pairs, 20 based on Foata normal form. 6/127 useless extension candidates. Maximal degree in co-relation 332. Up to 131 conditions per place. [2023-08-31 23:31:44,538 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 27 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-31 23:31:44,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 147 flow [2023-08-31 23:31:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:31:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:31:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-31 23:31:44,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354005167958656 [2023-08-31 23:31:44,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-31 23:31:44,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-31 23:31:44,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:44,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-31 23:31:44,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:31:44,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:44,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:31:44,543 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 69 flow. Second operand 3 states and 337 transitions. [2023-08-31 23:31:44,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 147 flow [2023-08-31 23:31:44,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:44,544 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2023-08-31 23:31:44,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-31 23:31:44,544 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -18 predicate places. [2023-08-31 23:31:44,545 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2023-08-31 23:31:44,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:31:44,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:44,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:44,563 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:31:44,752 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:31:44,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:44,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash -238224144, now seen corresponding path program 1 times [2023-08-31 23:31:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505142502] [2023-08-31 23:31:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:44,753 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:31:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:44,754 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:31:44,756 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:31:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:44,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:31:44,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:44,852 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:31:44,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:44,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:44,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505142502] [2023-08-31 23:31:44,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505142502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:44,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:44,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201359235] [2023-08-31 23:31:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:44,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:44,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 258 [2023-08-31 23:31:44,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:31:44,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:44,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 258 [2023-08-31 23:31:44,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:44,948 INFO L130 PetriNetUnfolder]: 12/46 cut-off events. [2023-08-31 23:31:44,948 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:31:44,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 46 events. 12/46 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 5 based on Foata normal form. 5/46 useless extension candidates. Maximal degree in co-relation 119. Up to 18 conditions per place. [2023-08-31 23:31:44,948 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 21 selfloop transitions, 5 changer transitions 1/29 dead transitions. [2023-08-31 23:31:44,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 136 flow [2023-08-31 23:31:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-31 23:31:44,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2023-08-31 23:31:44,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-31 23:31:44,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-31 23:31:44,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:44,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-31 23:31:44,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:31:44,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:44,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:44,953 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 4 states and 436 transitions. [2023-08-31 23:31:44,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 136 flow [2023-08-31 23:31:44,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:44,953 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 77 flow [2023-08-31 23:31:44,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-31 23:31:44,954 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -20 predicate places. [2023-08-31 23:31:44,954 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 77 flow [2023-08-31 23:31:44,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:31:44,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:44,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:44,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:31:45,155 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:31:45,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:45,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2055022630, now seen corresponding path program 1 times [2023-08-31 23:31:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:45,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449219099] [2023-08-31 23:31:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:45,157 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:31:45,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:45,162 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:31:45,164 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:31:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:45,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:31:45,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:45,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:31:45,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:31:45,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-31 23:31:46,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:31:46,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:46,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:46,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449219099] [2023-08-31 23:31:46,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449219099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:46,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:46,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914646887] [2023-08-31 23:31:46,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:46,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:46,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:46,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:46,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 258 [2023-08-31 23:31:46,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:31:46,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:46,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 258 [2023-08-31 23:31:46,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:46,246 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-31 23:31:46,246 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-31 23:31:46,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 76 events. 21/76 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 209 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 205. Up to 35 conditions per place. [2023-08-31 23:31:46,246 INFO L137 encePairwiseOnDemand]: 253/258 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-31 23:31:46,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 270 flow [2023-08-31 23:31:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-08-31 23:31:46,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127906976744186 [2023-08-31 23:31:46,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-08-31 23:31:46,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-08-31 23:31:46,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:46,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-08-31 23:31:46,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:31:46,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:31:46,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:31:46,252 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 77 flow. Second operand 6 states and 639 transitions. [2023-08-31 23:31:46,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 270 flow [2023-08-31 23:31:46,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 249 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:46,255 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 89 flow [2023-08-31 23:31:46,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-08-31 23:31:46,257 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -16 predicate places. [2023-08-31 23:31:46,257 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 89 flow [2023-08-31 23:31:46,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:31:46,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:46,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:46,267 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:31:46,465 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:31:46,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:46,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -465963182, now seen corresponding path program 2 times [2023-08-31 23:31:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:46,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793956280] [2023-08-31 23:31:46,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:31:46,466 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:31:46,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:46,467 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:31:46,470 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:31:46,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:31:46,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:31:46,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:31:46,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:47,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-31 23:31:47,334 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:31:47,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:47,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793956280] [2023-08-31 23:31:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793956280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:47,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:47,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:31:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612419175] [2023-08-31 23:31:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:47,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:31:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:31:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:31:47,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 258 [2023-08-31 23:31:47,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:31:47,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:47,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 258 [2023-08-31 23:31:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:47,635 INFO L130 PetriNetUnfolder]: 22/88 cut-off events. [2023-08-31 23:31:47,635 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-31 23:31:47,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 88 events. 22/88 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 259. Up to 40 conditions per place. [2023-08-31 23:31:47,635 INFO L137 encePairwiseOnDemand]: 250/258 looper letters, 38 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2023-08-31 23:31:47,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 249 flow [2023-08-31 23:31:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2023-08-31 23:31:47,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992248062015504 [2023-08-31 23:31:47,637 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2023-08-31 23:31:47,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2023-08-31 23:31:47,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:47,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2023-08-31 23:31:47,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:31:47,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:31:47,640 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:31:47,640 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 89 flow. Second operand 6 states and 618 transitions. [2023-08-31 23:31:47,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 249 flow [2023-08-31 23:31:47,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:47,641 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 114 flow [2023-08-31 23:31:47,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-31 23:31:47,642 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2023-08-31 23:31:47,642 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 114 flow [2023-08-31 23:31:47,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:31:47,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:47,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:47,652 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:31:47,849 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:31:47,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:47,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1560855441, now seen corresponding path program 1 times [2023-08-31 23:31:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332307408] [2023-08-31 23:31:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:47,850 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:31:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:47,851 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:31:47,853 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:31:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:47,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:31:47,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:48,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:31:48,195 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:31:48,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:48,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332307408] [2023-08-31 23:31:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332307408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269944446] [2023-08-31 23:31:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:48,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:48,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:48,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:48,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:48,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 258 [2023-08-31 23:31:48,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 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:31:48,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:48,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 258 [2023-08-31 23:31:48,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:48,288 INFO L130 PetriNetUnfolder]: 15/76 cut-off events. [2023-08-31 23:31:48,288 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-31 23:31:48,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 76 events. 15/76 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 4 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 230. Up to 52 conditions per place. [2023-08-31 23:31:48,288 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2023-08-31 23:31:48,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 180 flow [2023-08-31 23:31:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-31 23:31:48,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2023-08-31 23:31:48,290 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-31 23:31:48,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-31 23:31:48,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:48,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-31 23:31:48,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:31:48,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:48,292 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:48,292 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 114 flow. Second operand 4 states and 428 transitions. [2023-08-31 23:31:48,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 180 flow [2023-08-31 23:31:48,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 171 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:48,293 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 109 flow [2023-08-31 23:31:48,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-08-31 23:31:48,294 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-31 23:31:48,294 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 109 flow [2023-08-31 23:31:48,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 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:31:48,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:48,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:48,301 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:31:48,501 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:31:48,501 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:48,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1560855440, now seen corresponding path program 1 times [2023-08-31 23:31:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365712076] [2023-08-31 23:31:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:48,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:31:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:48,502 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:31:48,504 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:31:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:48,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:31:48,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:31:48,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:31:48,941 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:31:48,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:31:48,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:31:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365712076] [2023-08-31 23:31:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365712076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612936875] [2023-08-31 23:31:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:31:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:48,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 258 [2023-08-31 23:31:48,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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:31:48,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:48,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 258 [2023-08-31 23:31:48,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:49,041 INFO L130 PetriNetUnfolder]: 15/75 cut-off events. [2023-08-31 23:31:49,041 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-31 23:31:49,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 75 events. 15/75 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 215 event pairs, 4 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 226. Up to 57 conditions per place. [2023-08-31 23:31:49,042 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-31 23:31:49,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 173 flow [2023-08-31 23:31:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-31 23:31:49,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253875968992248 [2023-08-31 23:31:49,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-31 23:31:49,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-31 23:31:49,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:49,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-31 23:31:49,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:31:49,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:49,045 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states 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:31:49,045 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 109 flow. Second operand 4 states and 439 transitions. [2023-08-31 23:31:49,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 173 flow [2023-08-31 23:31:49,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 165 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:49,046 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 101 flow [2023-08-31 23:31:49,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-31 23:31:49,046 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2023-08-31 23:31:49,046 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 101 flow [2023-08-31 23:31:49,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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:31:49,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:49,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:49,061 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:31:49,247 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:31:49,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-08-31 23:31:49,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1560855240, now seen corresponding path program 3 times [2023-08-31 23:31:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:31:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661703547] [2023-08-31 23:31:49,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:31:49,248 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:31:49,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:31:49,249 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:31:49,252 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:31:49,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:31:49,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:31:49,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:31:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:31:49,525 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:31:49,525 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:31:49,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2023-08-31 23:31:49,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2023-08-31 23:31:49,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2023-08-31 23:31:49,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2023-08-31 23:31:49,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2023-08-31 23:31:49,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2023-08-31 23:31:49,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2023-08-31 23:31:49,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2023-08-31 23:31:49,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2023-08-31 23:31:49,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2023-08-31 23:31:49,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2023-08-31 23:31:49,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2023-08-31 23:31:49,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:31:49,754 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:31:49,754 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:49,758 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:31:49,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:31:49,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:31:49 BasicIcfg [2023-08-31 23:31:49,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:31:49,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:31:49,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:31:49,794 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:31:49,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:31:33" (3/4) ... [2023-08-31 23:31:49,795 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:31:49,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:31:49,796 INFO L158 Benchmark]: Toolchain (without parser) took 17996.90ms. Allocated memory was 67.1MB in the beginning and 360.7MB in the end (delta: 293.6MB). Free memory was 42.9MB in the beginning and 210.5MB in the end (delta: -167.7MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,796 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 43.9MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:31:49,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.20ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 42.7MB in the beginning and 66.0MB in the end (delta: -23.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.31ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,797 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,797 INFO L158 Benchmark]: RCFGBuilder took 882.85ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 46.3MB in the end (delta: 15.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,797 INFO L158 Benchmark]: TraceAbstraction took 16762.67ms. Allocated memory was 96.5MB in the beginning and 360.7MB in the end (delta: 264.2MB). Free memory was 45.6MB in the beginning and 211.6MB in the end (delta: -166.0MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,797 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 360.7MB. Free memory was 211.6MB in the beginning and 210.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:31:49,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 43.9MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.20ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 42.7MB in the beginning and 66.0MB in the end (delta: -23.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.31ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 882.85ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 46.3MB in the end (delta: 15.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16762.67ms. Allocated memory was 96.5MB in the beginning and 360.7MB in the end (delta: 264.2MB). Free memory was 45.6MB in the beginning and 211.6MB in the end (delta: -166.0MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 360.7MB. Free memory was 211.6MB in the beginning and 210.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 139 PlacesBefore, 54 PlacesAfterwards, 134 TransitionsBefore, 47 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 11251 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5006, independent: 4687, independent conditional: 0, independent unconditional: 4687, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1423, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5006, independent: 3324, independent conditional: 0, independent unconditional: 3324, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 1423, unknown conditional: 0, unknown unconditional: 1423] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={512:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={512:0}, t1930={7:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L784] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L787] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={512:0}, t1930={7:0}, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 170 locations, 50 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: 16.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 48 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 53 NumberOfNonLiveVariables, 936 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:31:49,825 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