./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.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/safe018_rmo.oepc.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 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --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:38:54,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:38:54,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:38:54,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:38:54,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:38:54,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:38:54,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:38:54,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:38:54,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:38:54,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:38:54,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:38:54,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:38:54,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:38:54,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:38:54,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:38:54,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:38:54,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:38:54,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:38:54,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:38:54,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:38:54,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:38:54,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:38:54,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:38:54,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:38:54,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:38:54,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:38:54,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:38:54,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:38:54,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:38:54,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:38:54,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:38:54,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:38:54,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:38:54,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:38:54,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:38:54,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:38:54,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:38:54,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:38:54,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:38:54,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:38:54,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:38:54,297 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:38:54,322 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:38:54,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:38:54,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:38:54,323 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:38:54,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:38:54,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:38:54,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:38:54,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:38:54,324 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:38:54,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:38:54,325 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:38:54,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:38:54,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:38:54,327 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:38:54,327 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:38:54,327 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:38:54,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:38:54,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:38:54,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:54,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:38:54,328 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:38:54,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:38:54,329 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:38:54,329 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb 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:38:54,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:38:54,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:38:54,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:38:54,599 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:38:54,600 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:38:54,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-31 23:38:55,549 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:38:55,768 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:38:55,769 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-31 23:38:55,793 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5574f0c2c/4bf1dee5769b4c30a66f51c87a421a4a/FLAG1895ac80d [2023-08-31 23:38:55,808 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5574f0c2c/4bf1dee5769b4c30a66f51c87a421a4a [2023-08-31 23:38:55,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:38:55,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:38:55,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:55,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:38:55,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:38:55,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:55" (1/1) ... [2023-08-31 23:38:55,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150b23f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:55, skipping insertion in model container [2023-08-31 23:38:55,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:38:55" (1/1) ... [2023-08-31 23:38:55,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:38:55,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:38:55,993 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/safe018_rmo.oepc.i[993,1006] [2023-08-31 23:38:56,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:56,175 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:38:56,186 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/safe018_rmo.oepc.i[993,1006] [2023-08-31 23:38:56,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:38:56,266 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:56,266 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:38:56,271 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:38:56,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56 WrapperNode [2023-08-31 23:38:56,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:38:56,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:56,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:38:56,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:38:56,277 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:38:56" (1/1) ... [2023-08-31 23:38:56,306 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:38:56" (1/1) ... [2023-08-31 23:38:56,331 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-31 23:38:56,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:38:56,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:38:56,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:38:56,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:38:56,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:38:56,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:38:56,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:38:56,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:38:56,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (1/1) ... [2023-08-31 23:38:56,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:38:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:38:56,458 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:38:56,477 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:38:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:38:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:38:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:38:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:38:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:38:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:38:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:38:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:38:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:38:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:38:56,489 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:38:56,649 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:38:56,650 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:38:57,025 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:38:57,254 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:38:57,255 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:38:57,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:57 BoogieIcfgContainer [2023-08-31 23:38:57,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:38:57,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:38:57,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:38:57,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:38:57,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:38:55" (1/3) ... [2023-08-31 23:38:57,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ecbea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:57, skipping insertion in model container [2023-08-31 23:38:57,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:38:56" (2/3) ... [2023-08-31 23:38:57,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ecbea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:38:57, skipping insertion in model container [2023-08-31 23:38:57,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:57" (3/3) ... [2023-08-31 23:38:57,262 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2023-08-31 23:38:57,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:38:57,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-31 23:38:57,272 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:38:57,321 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:38:57,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 157 transitions, 329 flow [2023-08-31 23:38:57,387 INFO L130 PetriNetUnfolder]: 2/154 cut-off events. [2023-08-31 23:38:57,387 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:57,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 154 events. 2/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 181 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:38:57,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 157 transitions, 329 flow [2023-08-31 23:38:57,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 154 transitions, 317 flow [2023-08-31 23:38:57,397 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:38:57,402 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 154 transitions, 317 flow [2023-08-31 23:38:57,404 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 154 transitions, 317 flow [2023-08-31 23:38:57,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 317 flow [2023-08-31 23:38:57,424 INFO L130 PetriNetUnfolder]: 2/154 cut-off events. [2023-08-31 23:38:57,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:38:57,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 154 events. 2/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 181 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:38:57,426 INFO L119 LiptonReduction]: Number of co-enabled transitions 4252 [2023-08-31 23:39:02,511 INFO L134 LiptonReduction]: Checked pairs total: 17189 [2023-08-31 23:39:02,511 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-31 23:39:02,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:39:02,544 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;@4fcdfff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:39:02,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-08-31 23:39:02,546 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:39:02,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:02,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:02,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:39:02,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:02,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 786, now seen corresponding path program 1 times [2023-08-31 23:39:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354809845] [2023-08-31 23:39:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:02,664 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:39:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354809845] [2023-08-31 23:39:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354809845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:39:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986138407] [2023-08-31 23:39:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:02,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:39:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:39:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:39:02,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 299 [2023-08-31 23:39:02,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:02,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:02,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 299 [2023-08-31 23:39:02,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:03,310 INFO L130 PetriNetUnfolder]: 4714/6862 cut-off events. [2023-08-31 23:39:03,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:03,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 6862 events. 4714/6862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 41181 event pairs, 4714 based on Foata normal form. 0/3717 useless extension candidates. Maximal degree in co-relation 13698. Up to 6801 conditions per place. [2023-08-31 23:39:03,338 INFO L137 encePairwiseOnDemand]: 282/299 looper letters, 36 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-31 23:39:03,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 159 flow [2023-08-31 23:39:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:39:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:39:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2023-08-31 23:39:03,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066889632107023 [2023-08-31 23:39:03,347 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2023-08-31 23:39:03,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2023-08-31 23:39:03,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:03,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2023-08-31 23:39:03,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,355 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,356 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 303 transitions. [2023-08-31 23:39:03,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 159 flow [2023-08-31 23:39:03,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:03,359 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-31 23:39:03,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-31 23:39:03,363 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2023-08-31 23:39:03,363 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-31 23:39:03,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:03,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:39:03,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:39:03,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:03,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 773025, now seen corresponding path program 1 times [2023-08-31 23:39:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955705029] [2023-08-31 23:39:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:03,532 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:39:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955705029] [2023-08-31 23:39:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955705029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912693341] [2023-08-31 23:39:03,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:03,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:03,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:03,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:03,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:03,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:03,955 INFO L130 PetriNetUnfolder]: 3050/4481 cut-off events. [2023-08-31 23:39:03,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:03,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8973 conditions, 4481 events. 3050/4481 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 24774 event pairs, 1930 based on Foata normal form. 108/2917 useless extension candidates. Maximal degree in co-relation 8970. Up to 2501 conditions per place. [2023-08-31 23:39:03,969 INFO L137 encePairwiseOnDemand]: 291/299 looper letters, 44 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-31 23:39:03,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 194 flow [2023-08-31 23:39:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:39:03,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46265328874024525 [2023-08-31 23:39:03,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:39:03,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:39:03,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:03,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:39:03,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 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:39:03,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,976 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:39:03,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 194 flow [2023-08-31 23:39:03,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:39:03,977 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 94 flow [2023-08-31 23:39:03,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-31 23:39:03,978 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-31 23:39:03,978 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 94 flow [2023-08-31 23:39:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:03,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:03,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:39:03,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:39:03,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:03,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 773026, now seen corresponding path program 1 times [2023-08-31 23:39:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203569753] [2023-08-31 23:39:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:39:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203569753] [2023-08-31 23:39:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203569753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:04,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557687158] [2023-08-31 23:39:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:04,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-08-31 23:39:04,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:04,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-08-31 23:39:04,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:04,273 INFO L130 PetriNetUnfolder]: 1159/1777 cut-off events. [2023-08-31 23:39:04,273 INFO L131 PetriNetUnfolder]: For 108/132 co-relation queries the response was YES. [2023-08-31 23:39:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1777 events. 1159/1777 cut-off events. For 108/132 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8690 event pairs, 1159 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 3813. Up to 1745 conditions per place. [2023-08-31 23:39:04,280 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 27 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-31 23:39:04,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 138 flow [2023-08-31 23:39:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-31 23:39:04,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2023-08-31 23:39:04,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-31 23:39:04,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-31 23:39:04,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:04,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-31 23:39:04,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,286 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 94 flow. Second operand 3 states and 403 transitions. [2023-08-31 23:39:04,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 138 flow [2023-08-31 23:39:04,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:04,287 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 80 flow [2023-08-31 23:39:04,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-31 23:39:04,288 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -24 predicate places. [2023-08-31 23:39:04,288 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 80 flow [2023-08-31 23:39:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:04,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:39:04,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:04,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash 358789881, now seen corresponding path program 1 times [2023-08-31 23:39:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193059140] [2023-08-31 23:39:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:04,458 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:39:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193059140] [2023-08-31 23:39:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193059140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:04,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117994418] [2023-08-31 23:39:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:04,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:04,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 299 [2023-08-31 23:39:04,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:04,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 299 [2023-08-31 23:39:04,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:04,699 INFO L130 PetriNetUnfolder]: 1101/1819 cut-off events. [2023-08-31 23:39:04,700 INFO L131 PetriNetUnfolder]: For 105/141 co-relation queries the response was YES. [2023-08-31 23:39:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 1819 events. 1101/1819 cut-off events. For 105/141 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10206 event pairs, 383 based on Foata normal form. 3/1603 useless extension candidates. Maximal degree in co-relation 3731. Up to 1079 conditions per place. [2023-08-31 23:39:04,709 INFO L137 encePairwiseOnDemand]: 295/299 looper letters, 47 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-31 23:39:04,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 229 flow [2023-08-31 23:39:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-31 23:39:04,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47157190635451507 [2023-08-31 23:39:04,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-31 23:39:04,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-31 23:39:04,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:04,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-31 23:39:04,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,714 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 80 flow. Second operand 3 states and 423 transitions. [2023-08-31 23:39:04,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 229 flow [2023-08-31 23:39:04,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:04,716 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 89 flow [2023-08-31 23:39:04,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:39:04,716 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2023-08-31 23:39:04,717 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 89 flow [2023-08-31 23:39:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:04,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:04,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:39:04,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:04,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 358790062, now seen corresponding path program 1 times [2023-08-31 23:39:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219695350] [2023-08-31 23:39:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:39:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:04,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219695350] [2023-08-31 23:39:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219695350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635369475] [2023-08-31 23:39:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:04,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 299 [2023-08-31 23:39:04,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:04,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:04,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 299 [2023-08-31 23:39:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:05,084 INFO L130 PetriNetUnfolder]: 1090/1808 cut-off events. [2023-08-31 23:39:05,085 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2023-08-31 23:39:05,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 1808 events. 1090/1808 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9703 event pairs, 229 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 4070. Up to 1555 conditions per place. [2023-08-31 23:39:05,092 INFO L137 encePairwiseOnDemand]: 295/299 looper letters, 43 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-31 23:39:05,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 227 flow [2023-08-31 23:39:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-31 23:39:05,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46711259754738016 [2023-08-31 23:39:05,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-31 23:39:05,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-31 23:39:05,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:05,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-31 23:39:05,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,096 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 89 flow. Second operand 3 states and 419 transitions. [2023-08-31 23:39:05,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 227 flow [2023-08-31 23:39:05,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:05,098 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 105 flow [2023-08-31 23:39:05,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 23:39:05,099 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2023-08-31 23:39:05,099 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 105 flow [2023-08-31 23:39:05,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:05,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:05,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:39:05,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:05,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1762411245, now seen corresponding path program 1 times [2023-08-31 23:39:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630176460] [2023-08-31 23:39:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:39:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630176460] [2023-08-31 23:39:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630176460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913462324] [2023-08-31 23:39:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:05,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:05,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:05,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:05,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 299 [2023-08-31 23:39:05,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:05,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 299 [2023-08-31 23:39:05,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:05,464 INFO L130 PetriNetUnfolder]: 1858/2987 cut-off events. [2023-08-31 23:39:05,464 INFO L131 PetriNetUnfolder]: For 551/551 co-relation queries the response was YES. [2023-08-31 23:39:05,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 2987 events. 1858/2987 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16737 event pairs, 508 based on Foata normal form. 132/2891 useless extension candidates. Maximal degree in co-relation 6863. Up to 1274 conditions per place. [2023-08-31 23:39:05,477 INFO L137 encePairwiseOnDemand]: 286/299 looper letters, 49 selfloop transitions, 15 changer transitions 0/65 dead transitions. [2023-08-31 23:39:05,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 314 flow [2023-08-31 23:39:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-31 23:39:05,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.451505016722408 [2023-08-31 23:39:05,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-31 23:39:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-31 23:39:05,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:05,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-31 23:39:05,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,483 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 105 flow. Second operand 4 states and 540 transitions. [2023-08-31 23:39:05,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 314 flow [2023-08-31 23:39:05,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:05,485 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 209 flow [2023-08-31 23:39:05,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-08-31 23:39:05,485 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -17 predicate places. [2023-08-31 23:39:05,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 209 flow [2023-08-31 23:39:05,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:05,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:05,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:39:05,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:05,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1762411064, now seen corresponding path program 1 times [2023-08-31 23:39:05,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909342877] [2023-08-31 23:39:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:05,671 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:39:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909342877] [2023-08-31 23:39:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909342877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:05,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:05,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296832250] [2023-08-31 23:39:05,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:05,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 299 [2023-08-31 23:39:05,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:05,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 299 [2023-08-31 23:39:05,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:05,907 INFO L130 PetriNetUnfolder]: 1584/2674 cut-off events. [2023-08-31 23:39:05,907 INFO L131 PetriNetUnfolder]: For 2043/2052 co-relation queries the response was YES. [2023-08-31 23:39:05,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7946 conditions, 2674 events. 1584/2674 cut-off events. For 2043/2052 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15822 event pairs, 253 based on Foata normal form. 6/2464 useless extension candidates. Maximal degree in co-relation 7937. Up to 2090 conditions per place. [2023-08-31 23:39:05,919 INFO L137 encePairwiseOnDemand]: 295/299 looper letters, 64 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-31 23:39:05,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 451 flow [2023-08-31 23:39:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-31 23:39:05,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45568561872909696 [2023-08-31 23:39:05,921 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-31 23:39:05,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-31 23:39:05,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:05,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-31 23:39:05,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,924 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,924 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 209 flow. Second operand 4 states and 545 transitions. [2023-08-31 23:39:05,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 451 flow [2023-08-31 23:39:05,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 451 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:39:05,930 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 224 flow [2023-08-31 23:39:05,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-31 23:39:05,930 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -13 predicate places. [2023-08-31 23:39:05,930 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 224 flow [2023-08-31 23:39:05,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:05,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:05,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:05,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:39:05,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:05,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1762411244, now seen corresponding path program 1 times [2023-08-31 23:39:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959853791] [2023-08-31 23:39:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:06,029 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:39:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959853791] [2023-08-31 23:39:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959853791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84956902] [2023-08-31 23:39:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:06,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:06,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:06,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:06,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:06,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:06,389 INFO L130 PetriNetUnfolder]: 1724/2808 cut-off events. [2023-08-31 23:39:06,390 INFO L131 PetriNetUnfolder]: For 2491/2497 co-relation queries the response was YES. [2023-08-31 23:39:06,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 2808 events. 1724/2808 cut-off events. For 2491/2497 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 15833 event pairs, 716 based on Foata normal form. 30/2595 useless extension candidates. Maximal degree in co-relation 8566. Up to 1839 conditions per place. [2023-08-31 23:39:06,402 INFO L137 encePairwiseOnDemand]: 296/299 looper letters, 60 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-31 23:39:06,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 450 flow [2023-08-31 23:39:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-31 23:39:06,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44648829431438125 [2023-08-31 23:39:06,404 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-31 23:39:06,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-31 23:39:06,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:06,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-31 23:39:06,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,408 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,408 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 224 flow. Second operand 4 states and 534 transitions. [2023-08-31 23:39:06,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 450 flow [2023-08-31 23:39:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 436 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:06,413 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 216 flow [2023-08-31 23:39:06,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-31 23:39:06,414 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -14 predicate places. [2023-08-31 23:39:06,414 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 216 flow [2023-08-31 23:39:06,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:06,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:06,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:39:06,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:06,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1763521670, now seen corresponding path program 1 times [2023-08-31 23:39:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327143132] [2023-08-31 23:39:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:06,591 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:39:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:06,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327143132] [2023-08-31 23:39:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327143132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591790778] [2023-08-31 23:39:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:06,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:06,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:06,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:06,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:06,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:06,999 INFO L130 PetriNetUnfolder]: 1897/3110 cut-off events. [2023-08-31 23:39:07,000 INFO L131 PetriNetUnfolder]: For 4408/4464 co-relation queries the response was YES. [2023-08-31 23:39:07,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9690 conditions, 3110 events. 1897/3110 cut-off events. For 4408/4464 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 18956 event pairs, 630 based on Foata normal form. 25/2828 useless extension candidates. Maximal degree in co-relation 9680. Up to 2178 conditions per place. [2023-08-31 23:39:07,009 INFO L137 encePairwiseOnDemand]: 294/299 looper letters, 77 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-31 23:39:07,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 642 flow [2023-08-31 23:39:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:39:07,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070234113712377 [2023-08-31 23:39:07,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:39:07,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:39:07,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:07,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:39:07,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,016 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,016 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 216 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:39:07,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 642 flow [2023-08-31 23:39:07,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:07,022 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 320 flow [2023-08-31 23:39:07,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-31 23:39:07,023 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2023-08-31 23:39:07,023 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 320 flow [2023-08-31 23:39:07,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:07,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:07,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:39:07,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:07,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1199831510, now seen corresponding path program 1 times [2023-08-31 23:39:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581220620] [2023-08-31 23:39:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:07,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:39:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581220620] [2023-08-31 23:39:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581220620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:07,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:07,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826570548] [2023-08-31 23:39:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:07,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:07,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:07,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:07,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:07,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:07,508 INFO L130 PetriNetUnfolder]: 2274/3805 cut-off events. [2023-08-31 23:39:07,509 INFO L131 PetriNetUnfolder]: For 5360/5454 co-relation queries the response was YES. [2023-08-31 23:39:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12527 conditions, 3805 events. 2274/3805 cut-off events. For 5360/5454 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 25128 event pairs, 464 based on Foata normal form. 60/3475 useless extension candidates. Maximal degree in co-relation 12515. Up to 1649 conditions per place. [2023-08-31 23:39:07,523 INFO L137 encePairwiseOnDemand]: 295/299 looper letters, 88 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-31 23:39:07,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 728 flow [2023-08-31 23:39:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-31 23:39:07,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45568561872909696 [2023-08-31 23:39:07,526 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-31 23:39:07,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-31 23:39:07,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:07,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-31 23:39:07,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,529 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,529 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 320 flow. Second operand 4 states and 545 transitions. [2023-08-31 23:39:07,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 728 flow [2023-08-31 23:39:07,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 728 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:39:07,537 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 347 flow [2023-08-31 23:39:07,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-31 23:39:07,538 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2023-08-31 23:39:07,539 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 347 flow [2023-08-31 23:39:07,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:07,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:07,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:39:07,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:07,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1199832471, now seen corresponding path program 1 times [2023-08-31 23:39:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657086213] [2023-08-31 23:39:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:07,791 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:39:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657086213] [2023-08-31 23:39:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657086213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596364354] [2023-08-31 23:39:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:07,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:07,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:07,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:07,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:07,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:07,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:08,198 INFO L130 PetriNetUnfolder]: 2283/3853 cut-off events. [2023-08-31 23:39:08,199 INFO L131 PetriNetUnfolder]: For 6557/6604 co-relation queries the response was YES. [2023-08-31 23:39:08,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13336 conditions, 3853 events. 2283/3853 cut-off events. For 6557/6604 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 25096 event pairs, 1239 based on Foata normal form. 6/3434 useless extension candidates. Maximal degree in co-relation 13321. Up to 2434 conditions per place. [2023-08-31 23:39:08,216 INFO L137 encePairwiseOnDemand]: 296/299 looper letters, 57 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2023-08-31 23:39:08,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 565 flow [2023-08-31 23:39:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-31 23:39:08,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45707915273132665 [2023-08-31 23:39:08,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-31 23:39:08,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-31 23:39:08,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:08,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-31 23:39:08,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,220 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 347 flow. Second operand 3 states and 410 transitions. [2023-08-31 23:39:08,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 565 flow [2023-08-31 23:39:08,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 557 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:08,230 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 374 flow [2023-08-31 23:39:08,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-31 23:39:08,231 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2023-08-31 23:39:08,231 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 374 flow [2023-08-31 23:39:08,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:08,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:08,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:39:08,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:08,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1199850628, now seen corresponding path program 1 times [2023-08-31 23:39:08,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:08,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932234454] [2023-08-31 23:39:08,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:08,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:08,353 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:39:08,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932234454] [2023-08-31 23:39:08,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932234454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:08,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:08,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897793425] [2023-08-31 23:39:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:08,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:08,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:08,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:08,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 299 [2023-08-31 23:39:08,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:08,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 299 [2023-08-31 23:39:08,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:08,720 INFO L130 PetriNetUnfolder]: 2359/3851 cut-off events. [2023-08-31 23:39:08,720 INFO L131 PetriNetUnfolder]: For 6908/6908 co-relation queries the response was YES. [2023-08-31 23:39:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13842 conditions, 3851 events. 2359/3851 cut-off events. For 6908/6908 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23126 event pairs, 687 based on Foata normal form. 53/3555 useless extension candidates. Maximal degree in co-relation 13826. Up to 1517 conditions per place. [2023-08-31 23:39:08,738 INFO L137 encePairwiseOnDemand]: 287/299 looper letters, 63 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2023-08-31 23:39:08,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 774 flow [2023-08-31 23:39:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-31 23:39:08,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42642140468227424 [2023-08-31 23:39:08,740 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-31 23:39:08,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-31 23:39:08,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:08,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-31 23:39:08,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,743 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 374 flow. Second operand 4 states and 510 transitions. [2023-08-31 23:39:08,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 774 flow [2023-08-31 23:39:08,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 732 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:08,755 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 515 flow [2023-08-31 23:39:08,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-31 23:39:08,755 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2023-08-31 23:39:08,755 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 515 flow [2023-08-31 23:39:08,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:08,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:08,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:08,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:39:08,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:08,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -50623219, now seen corresponding path program 1 times [2023-08-31 23:39:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776675067] [2023-08-31 23:39:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:09,490 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:39:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776675067] [2023-08-31 23:39:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776675067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:39:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404103963] [2023-08-31 23:39:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:39:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:39:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:39:09,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 299 [2023-08-31 23:39:09,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 515 flow. Second operand has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:09,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:09,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 299 [2023-08-31 23:39:09,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:10,263 INFO L130 PetriNetUnfolder]: 2682/4324 cut-off events. [2023-08-31 23:39:10,263 INFO L131 PetriNetUnfolder]: For 9022/9022 co-relation queries the response was YES. [2023-08-31 23:39:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16903 conditions, 4324 events. 2682/4324 cut-off events. For 9022/9022 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 26535 event pairs, 848 based on Foata normal form. 4/3954 useless extension candidates. Maximal degree in co-relation 16886. Up to 3743 conditions per place. [2023-08-31 23:39:10,325 INFO L137 encePairwiseOnDemand]: 288/299 looper letters, 89 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2023-08-31 23:39:10,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 986 flow [2023-08-31 23:39:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:39:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:39:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1133 transitions. [2023-08-31 23:39:10,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37892976588628763 [2023-08-31 23:39:10,328 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1133 transitions. [2023-08-31 23:39:10,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1133 transitions. [2023-08-31 23:39:10,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:10,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1133 transitions. [2023-08-31 23:39:10,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.3) internal successors, (1133), 10 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:10,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 299.0) internal successors, (3289), 11 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:10,335 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 299.0) internal successors, (3289), 11 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:10,335 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 515 flow. Second operand 10 states and 1133 transitions. [2023-08-31 23:39:10,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 986 flow [2023-08-31 23:39:10,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 976 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:10,363 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 693 flow [2023-08-31 23:39:10,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=693, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2023-08-31 23:39:10,364 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-31 23:39:10,364 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 693 flow [2023-08-31 23:39:10,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:10,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:10,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:10,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:39:10,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:10,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 794716081, now seen corresponding path program 2 times [2023-08-31 23:39:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675964932] [2023-08-31 23:39:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:11,166 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:39:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675964932] [2023-08-31 23:39:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675964932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:39:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833693780] [2023-08-31 23:39:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:11,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:39:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:39:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:39:11,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 299 [2023-08-31 23:39:11,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 693 flow. Second operand has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:11,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:11,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 299 [2023-08-31 23:39:11,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:12,015 INFO L130 PetriNetUnfolder]: 2712/4443 cut-off events. [2023-08-31 23:39:12,016 INFO L131 PetriNetUnfolder]: For 9949/9949 co-relation queries the response was YES. [2023-08-31 23:39:12,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18128 conditions, 4443 events. 2712/4443 cut-off events. For 9949/9949 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 27883 event pairs, 361 based on Foata normal form. 24/4093 useless extension candidates. Maximal degree in co-relation 18105. Up to 3029 conditions per place. [2023-08-31 23:39:12,032 INFO L137 encePairwiseOnDemand]: 288/299 looper letters, 105 selfloop transitions, 50 changer transitions 0/156 dead transitions. [2023-08-31 23:39:12,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 156 transitions, 1618 flow [2023-08-31 23:39:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:39:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:39:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1371 transitions. [2023-08-31 23:39:12,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38210702341137126 [2023-08-31 23:39:12,035 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1371 transitions. [2023-08-31 23:39:12,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1371 transitions. [2023-08-31 23:39:12,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:12,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1371 transitions. [2023-08-31 23:39:12,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.25) internal successors, (1371), 12 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 299.0) internal successors, (3887), 13 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,042 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 299.0) internal successors, (3887), 13 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,042 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 693 flow. Second operand 12 states and 1371 transitions. [2023-08-31 23:39:12,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 156 transitions, 1618 flow [2023-08-31 23:39:12,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 156 transitions, 1608 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-31 23:39:12,064 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 1235 flow [2023-08-31 23:39:12,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1235, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2023-08-31 23:39:12,064 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 27 predicate places. [2023-08-31 23:39:12,065 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 1235 flow [2023-08-31 23:39:12,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:12,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:12,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:39:12,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:12,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1459335629, now seen corresponding path program 1 times [2023-08-31 23:39:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572682579] [2023-08-31 23:39:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:12,193 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:39:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:12,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572682579] [2023-08-31 23:39:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572682579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:12,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:39:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88245960] [2023-08-31 23:39:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:12,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:39:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:39:12,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:39:12,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 299 [2023-08-31 23:39:12,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 1235 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:12,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 299 [2023-08-31 23:39:12,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:12,699 INFO L130 PetriNetUnfolder]: 2303/3853 cut-off events. [2023-08-31 23:39:12,699 INFO L131 PetriNetUnfolder]: For 11510/11510 co-relation queries the response was YES. [2023-08-31 23:39:12,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16814 conditions, 3853 events. 2303/3853 cut-off events. For 11510/11510 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 23983 event pairs, 582 based on Foata normal form. 63/3700 useless extension candidates. Maximal degree in co-relation 16785. Up to 1174 conditions per place. [2023-08-31 23:39:12,718 INFO L137 encePairwiseOnDemand]: 286/299 looper letters, 106 selfloop transitions, 36 changer transitions 1/144 dead transitions. [2023-08-31 23:39:12,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 1835 flow [2023-08-31 23:39:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:39:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:39:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-08-31 23:39:12,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035674470457079 [2023-08-31 23:39:12,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-08-31 23:39:12,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-08-31 23:39:12,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:12,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-08-31 23:39:12,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,725 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 1235 flow. Second operand 6 states and 724 transitions. [2023-08-31 23:39:12,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 1835 flow [2023-08-31 23:39:12,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 144 transitions, 1797 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:12,766 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 1391 flow [2023-08-31 23:39:12,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1391, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2023-08-31 23:39:12,767 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2023-08-31 23:39:12,767 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 1391 flow [2023-08-31 23:39:12,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:12,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:12,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:39:12,768 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:12,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1459335578, now seen corresponding path program 1 times [2023-08-31 23:39:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465543087] [2023-08-31 23:39:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:13,025 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:39:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465543087] [2023-08-31 23:39:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465543087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:39:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146348341] [2023-08-31 23:39:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:13,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:39:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:39:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:39:13,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 299 [2023-08-31 23:39:13,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 1391 flow. Second operand has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:13,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 299 [2023-08-31 23:39:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:13,604 INFO L130 PetriNetUnfolder]: 1613/2777 cut-off events. [2023-08-31 23:39:13,604 INFO L131 PetriNetUnfolder]: For 11184/11205 co-relation queries the response was YES. [2023-08-31 23:39:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12589 conditions, 2777 events. 1613/2777 cut-off events. For 11184/11205 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16806 event pairs, 302 based on Foata normal form. 28/2771 useless extension candidates. Maximal degree in co-relation 12559. Up to 931 conditions per place. [2023-08-31 23:39:13,616 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 100 selfloop transitions, 21 changer transitions 6/142 dead transitions. [2023-08-31 23:39:13,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 142 transitions, 1839 flow [2023-08-31 23:39:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:39:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:39:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2023-08-31 23:39:13,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3965599617773531 [2023-08-31 23:39:13,618 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2023-08-31 23:39:13,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2023-08-31 23:39:13,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:13,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2023-08-31 23:39:13,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,623 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 1391 flow. Second operand 7 states and 830 transitions. [2023-08-31 23:39:13,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 142 transitions, 1839 flow [2023-08-31 23:39:13,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 142 transitions, 1783 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-31 23:39:13,659 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 1214 flow [2023-08-31 23:39:13,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1214, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2023-08-31 23:39:13,659 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2023-08-31 23:39:13,660 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 1214 flow [2023-08-31 23:39:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:13,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:39:13,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:13,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1199442476, now seen corresponding path program 1 times [2023-08-31 23:39:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344400453] [2023-08-31 23:39:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:13,811 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:39:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344400453] [2023-08-31 23:39:13,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344400453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:13,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:13,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205726007] [2023-08-31 23:39:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:13,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:13,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:13,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:13,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:13,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:13,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:13,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:13,988 INFO L130 PetriNetUnfolder]: 839/1587 cut-off events. [2023-08-31 23:39:13,988 INFO L131 PetriNetUnfolder]: For 6265/6274 co-relation queries the response was YES. [2023-08-31 23:39:13,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7313 conditions, 1587 events. 839/1587 cut-off events. For 6265/6274 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9547 event pairs, 183 based on Foata normal form. 29/1603 useless extension candidates. Maximal degree in co-relation 7283. Up to 1384 conditions per place. [2023-08-31 23:39:13,994 INFO L137 encePairwiseOnDemand]: 294/299 looper letters, 94 selfloop transitions, 4 changer transitions 4/117 dead transitions. [2023-08-31 23:39:13,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 1564 flow [2023-08-31 23:39:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-31 23:39:13,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44816053511705684 [2023-08-31 23:39:13,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-31 23:39:13,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-31 23:39:13,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:13,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-31 23:39:13,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:13,998 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 1214 flow. Second operand 3 states and 402 transitions. [2023-08-31 23:39:13,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 1564 flow [2023-08-31 23:39:14,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 117 transitions, 1508 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-31 23:39:14,016 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 1052 flow [2023-08-31 23:39:14,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2023-08-31 23:39:14,017 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2023-08-31 23:39:14,017 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 1052 flow [2023-08-31 23:39:14,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:14,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:14,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:39:14,018 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:14,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash -600316530, now seen corresponding path program 1 times [2023-08-31 23:39:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036621685] [2023-08-31 23:39:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:39:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036621685] [2023-08-31 23:39:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036621685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687228847] [2023-08-31 23:39:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:14,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:14,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 1052 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:14,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:14,238 INFO L130 PetriNetUnfolder]: 243/546 cut-off events. [2023-08-31 23:39:14,238 INFO L131 PetriNetUnfolder]: For 1907/1911 co-relation queries the response was YES. [2023-08-31 23:39:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 546 events. 243/546 cut-off events. For 1907/1911 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2704 event pairs, 23 based on Foata normal form. 37/579 useless extension candidates. Maximal degree in co-relation 2571. Up to 318 conditions per place. [2023-08-31 23:39:14,240 INFO L137 encePairwiseOnDemand]: 294/299 looper letters, 81 selfloop transitions, 7 changer transitions 16/113 dead transitions. [2023-08-31 23:39:14,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 113 transitions, 1349 flow [2023-08-31 23:39:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-31 23:39:14,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2023-08-31 23:39:14,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-31 23:39:14,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-31 23:39:14,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:14,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-31 23:39:14,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,245 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 1052 flow. Second operand 4 states and 533 transitions. [2023-08-31 23:39:14,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 113 transitions, 1349 flow [2023-08-31 23:39:14,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1327 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:14,250 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 685 flow [2023-08-31 23:39:14,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=685, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2023-08-31 23:39:14,251 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 27 predicate places. [2023-08-31 23:39:14,251 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 685 flow [2023-08-31 23:39:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:14,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:39:14,252 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:14,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1109809686, now seen corresponding path program 1 times [2023-08-31 23:39:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230412859] [2023-08-31 23:39:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:14,417 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:39:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230412859] [2023-08-31 23:39:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230412859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:14,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:14,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:39:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794247509] [2023-08-31 23:39:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:14,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:14,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 299 [2023-08-31 23:39:14,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 685 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:14,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 299 [2023-08-31 23:39:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:14,589 INFO L130 PetriNetUnfolder]: 457/993 cut-off events. [2023-08-31 23:39:14,590 INFO L131 PetriNetUnfolder]: For 3094/3099 co-relation queries the response was YES. [2023-08-31 23:39:14,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 993 events. 457/993 cut-off events. For 3094/3099 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5513 event pairs, 79 based on Foata normal form. 9/998 useless extension candidates. Maximal degree in co-relation 4438. Up to 460 conditions per place. [2023-08-31 23:39:14,593 INFO L137 encePairwiseOnDemand]: 295/299 looper letters, 99 selfloop transitions, 10 changer transitions 17/134 dead transitions. [2023-08-31 23:39:14,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 134 transitions, 1396 flow [2023-08-31 23:39:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:39:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:39:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-31 23:39:14,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45016722408026755 [2023-08-31 23:39:14,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-31 23:39:14,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-31 23:39:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:14,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-31 23:39:14,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,598 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,598 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 685 flow. Second operand 5 states and 673 transitions. [2023-08-31 23:39:14,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 134 transitions, 1396 flow [2023-08-31 23:39:14,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 134 transitions, 1301 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-31 23:39:14,605 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 674 flow [2023-08-31 23:39:14,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=674, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2023-08-31 23:39:14,606 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2023-08-31 23:39:14,606 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 674 flow [2023-08-31 23:39:14,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:14,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:14,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:39:14,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:14,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash 557625880, now seen corresponding path program 2 times [2023-08-31 23:39:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934411713] [2023-08-31 23:39:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:14,757 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:39:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934411713] [2023-08-31 23:39:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934411713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:39:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033896748] [2023-08-31 23:39:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:14,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:14,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:14,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:14,848 INFO L130 PetriNetUnfolder]: 173/398 cut-off events. [2023-08-31 23:39:14,848 INFO L131 PetriNetUnfolder]: For 1474/1506 co-relation queries the response was YES. [2023-08-31 23:39:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 398 events. 173/398 cut-off events. For 1474/1506 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2007 event pairs, 14 based on Foata normal form. 56/451 useless extension candidates. Maximal degree in co-relation 1796. Up to 160 conditions per place. [2023-08-31 23:39:14,850 INFO L137 encePairwiseOnDemand]: 294/299 looper letters, 37 selfloop transitions, 10 changer transitions 35/85 dead transitions. [2023-08-31 23:39:14,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 960 flow [2023-08-31 23:39:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:39:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:39:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-31 23:39:14,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354515050167224 [2023-08-31 23:39:14,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-31 23:39:14,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-31 23:39:14,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:14,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-31 23:39:14,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,855 INFO L175 Difference]: Start difference. First operand has 94 places, 69 transitions, 674 flow. Second operand 5 states and 651 transitions. [2023-08-31 23:39:14,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 960 flow [2023-08-31 23:39:14,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 778 flow, removed 12 selfloop flow, removed 18 redundant places. [2023-08-31 23:39:14,858 INFO L231 Difference]: Finished difference. Result has 72 places, 34 transitions, 235 flow [2023-08-31 23:39:14,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=72, PETRI_TRANSITIONS=34} [2023-08-31 23:39:14,858 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2023-08-31 23:39:14,858 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 34 transitions, 235 flow [2023-08-31 23:39:14,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:14,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:14,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:39:14,859 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:14,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1096445052, now seen corresponding path program 1 times [2023-08-31 23:39:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111705670] [2023-08-31 23:39:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:15,008 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:39:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:39:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111705670] [2023-08-31 23:39:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111705670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:15,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262894662] [2023-08-31 23:39:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:15,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:39:15,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:15,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2023-08-31 23:39:15,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 34 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:15,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:15,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2023-08-31 23:39:15,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:15,073 INFO L130 PetriNetUnfolder]: 149/308 cut-off events. [2023-08-31 23:39:15,073 INFO L131 PetriNetUnfolder]: For 720/720 co-relation queries the response was YES. [2023-08-31 23:39:15,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 308 events. 149/308 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1231 event pairs, 26 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 1246. Up to 133 conditions per place. [2023-08-31 23:39:15,074 INFO L137 encePairwiseOnDemand]: 296/299 looper letters, 36 selfloop transitions, 1 changer transitions 18/57 dead transitions. [2023-08-31 23:39:15,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 484 flow [2023-08-31 23:39:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-31 23:39:15,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43394648829431437 [2023-08-31 23:39:15,076 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-31 23:39:15,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-31 23:39:15,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:15,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-31 23:39:15,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:15,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:15,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:15,078 INFO L175 Difference]: Start difference. First operand has 72 places, 34 transitions, 235 flow. Second operand 4 states and 519 transitions. [2023-08-31 23:39:15,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 484 flow [2023-08-31 23:39:15,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 381 flow, removed 16 selfloop flow, removed 14 redundant places. [2023-08-31 23:39:15,080 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 171 flow [2023-08-31 23:39:15,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2023-08-31 23:39:15,080 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2023-08-31 23:39:15,081 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 171 flow [2023-08-31 23:39:15,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:15,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:15,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:15,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:39:15,081 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:15,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:15,082 INFO L85 PathProgramCache]: Analyzing trace with hash -716820236, now seen corresponding path program 2 times [2023-08-31 23:39:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:39:15,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889917991] [2023-08-31 23:39:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:39:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:39:15,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:39:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:39:15,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:39:15,210 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:39:15,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-08-31 23:39:15,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-08-31 23:39:15,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-08-31 23:39:15,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-08-31 23:39:15,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-08-31 23:39:15,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-08-31 23:39:15,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-08-31 23:39:15,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-08-31 23:39:15,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-08-31 23:39:15,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-08-31 23:39:15,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-08-31 23:39:15,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-08-31 23:39:15,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:39:15,219 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:15,224 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:39:15,224 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:39:15,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:39:15 BasicIcfg [2023-08-31 23:39:15,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:39:15,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:39:15,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:39:15,290 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:39:15,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:38:57" (3/4) ... [2023-08-31 23:39:15,292 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:39:15,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:39:15,292 INFO L158 Benchmark]: Toolchain (without parser) took 19481.16ms. Allocated memory was 73.4MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 49.6MB in the beginning and 641.3MB in the end (delta: -591.7MB). Peak memory consumption was 974.4MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,292 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory was 27.8MB in the beginning and 27.7MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:39:15,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.69ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 46.1MB in the end (delta: 3.3MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 73.4MB. Free memory was 46.1MB in the beginning and 43.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,293 INFO L158 Benchmark]: Boogie Preprocessor took 49.30ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 41.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,293 INFO L158 Benchmark]: RCFGBuilder took 874.21ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 41.4MB in the beginning and 61.7MB in the end (delta: -20.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,295 INFO L158 Benchmark]: TraceAbstraction took 18031.63ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 60.6MB in the beginning and 641.3MB in the end (delta: -580.7MB). Peak memory consumption was 963.9MB. Max. memory is 16.1GB. [2023-08-31 23:39:15,295 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 1.6GB. Free memory is still 641.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:39:15,296 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.14ms. Allocated memory is still 50.3MB. Free memory was 27.8MB in the beginning and 27.7MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.69ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 46.1MB in the end (delta: 3.3MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 73.4MB. Free memory was 46.1MB in the beginning and 43.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.30ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 41.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 874.21ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 41.4MB in the beginning and 61.7MB in the end (delta: -20.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18031.63ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 60.6MB in the beginning and 641.3MB in the end (delta: -580.7MB). Peak memory consumption was 963.9MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 1.6GB. Free memory is still 641.3MB. 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.1s, 162 PlacesBefore, 66 PlacesAfterwards, 154 TransitionsBefore, 57 TransitionsAfterwards, 4252 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 17189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6316, independent: 5881, independent conditional: 0, independent unconditional: 5881, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1983, independent: 1924, independent conditional: 0, independent unconditional: 1924, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6316, independent: 3957, independent conditional: 0, independent unconditional: 3957, dependent: 376, dependent conditional: 0, dependent unconditional: 376, unknown: 1983, unknown conditional: 0, unknown unconditional: 1983] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-2, t2213={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 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) [L765] EXPR 1 \read(y) [L765] 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) [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L779] 1 __unbuffered_p0_EBX = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L833] 0 pthread_t t2214; 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=-1, t2213={7:0}, t2214={8:0}, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=0, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice1=0, weak$$choice2=255, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L791] 2 x = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L803] 3 __unbuffered_p2_EAX = x 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L806] 3 y = 1 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice1=0, weak$$choice2=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] 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}, \result={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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=255, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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: -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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 198 locations, 53 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: 17.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1779 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1284 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3720 IncrementalHoareTripleChecker+Invalid, 3975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 150 mSDtfsCounter, 3720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1391occurred in iteration=15, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 2384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:39:15,325 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/safe018_rmo.oepc.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 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --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:39:17,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:39:17,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:39:17,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:39:17,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:39:17,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:39:17,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:39:17,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:39:17,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:39:17,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:39:17,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:39:17,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:39:17,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:39:17,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:39:17,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:39:17,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:39:17,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:39:17,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:39:17,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:39:17,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:39:17,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:39:17,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:39:17,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:39:17,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:39:17,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:39:17,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:39:17,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:39:17,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:39:17,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:39:17,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:39:17,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:39:17,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:39:17,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:39:17,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:39:17,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:39:17,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:39:17,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:39:17,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:39:17,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:39:17,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:39:17,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:39:17,354 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:39:17,379 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:39:17,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:39:17,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:39:17,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:39:17,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:39:17,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:39:17,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:39:17,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:39:17,382 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:39:17,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:39:17,383 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:39:17,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:39:17,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:39:17,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:39:17,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:39:17,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:39:17,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:39:17,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:39:17,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:39:17,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:39:17,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:39:17,386 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:39:17,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:39:17,387 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:39:17,387 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:39:17,387 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb 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:39:17,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:39:17,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:39:17,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:39:17,645 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:39:17,645 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:39:17,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-31 23:39:18,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:39:18,912 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:39:18,912 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2023-08-31 23:39:18,925 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e01422e/60dd97ea098d40d08639ff8bd24ce987/FLAG95b4d49fa [2023-08-31 23:39:18,934 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e01422e/60dd97ea098d40d08639ff8bd24ce987 [2023-08-31 23:39:18,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:39:18,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:39:18,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:39:18,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:39:18,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:39:18,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:39:18" (1/1) ... [2023-08-31 23:39:18,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659fd415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:18, skipping insertion in model container [2023-08-31 23:39:18,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:39:18" (1/1) ... [2023-08-31 23:39:18,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:39:18,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:39:19,097 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/safe018_rmo.oepc.i[993,1006] [2023-08-31 23:39:19,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:39:19,222 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:39:19,233 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/safe018_rmo.oepc.i[993,1006] [2023-08-31 23:39:19,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:39:19,308 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:39:19,309 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:39:19,313 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:39:19,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19 WrapperNode [2023-08-31 23:39:19,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:39:19,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:39:19,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:39:19,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:39:19,318 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:39:19" (1/1) ... [2023-08-31 23:39:19,347 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:39:19" (1/1) ... [2023-08-31 23:39:19,379 INFO L138 Inliner]: procedures = 180, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-31 23:39:19,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:39:19,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:39:19,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:39:19,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:39:19,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:39:19,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:39:19,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:39:19,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:39:19,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (1/1) ... [2023-08-31 23:39:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:39:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:39:19,463 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:39:19,475 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:39:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:39:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:39:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:39:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:39:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:39:19,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:39:19,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:39:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:39:19,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:39:19,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:39:19,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:39:19,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:39:19,498 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:39:19,606 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:39:19,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:39:19,968 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:39:20,184 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:39:20,185 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:39:20,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:39:20 BoogieIcfgContainer [2023-08-31 23:39:20,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:39:20,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:39:20,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:39:20,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:39:20,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:39:18" (1/3) ... [2023-08-31 23:39:20,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd1b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:39:20, skipping insertion in model container [2023-08-31 23:39:20,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:39:19" (2/3) ... [2023-08-31 23:39:20,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd1b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:39:20, skipping insertion in model container [2023-08-31 23:39:20,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:39:20" (3/3) ... [2023-08-31 23:39:20,193 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2023-08-31 23:39:20,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:39:20,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-31 23:39:20,207 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:39:20,289 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:39:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 331 flow [2023-08-31 23:39:20,387 INFO L130 PetriNetUnfolder]: 2/155 cut-off events. [2023-08-31 23:39:20,387 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:20,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 155 events. 2/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 183 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:39:20,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 158 transitions, 331 flow [2023-08-31 23:39:20,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 155 transitions, 319 flow [2023-08-31 23:39:20,401 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:39:20,410 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 155 transitions, 319 flow [2023-08-31 23:39:20,412 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 155 transitions, 319 flow [2023-08-31 23:39:20,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 155 transitions, 319 flow [2023-08-31 23:39:20,449 INFO L130 PetriNetUnfolder]: 2/155 cut-off events. [2023-08-31 23:39:20,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:20,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 155 events. 2/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 181 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:39:20,454 INFO L119 LiptonReduction]: Number of co-enabled transitions 4252 [2023-08-31 23:39:28,753 INFO L134 LiptonReduction]: Checked pairs total: 15568 [2023-08-31 23:39:28,753 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-31 23:39:28,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:39:28,766 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;@279dea24, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:39:28,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-08-31 23:39:28,767 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:39:28,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:28,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:28,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:39:28,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:28,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 788, now seen corresponding path program 1 times [2023-08-31 23:39:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688732272] [2023-08-31 23:39:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:28,779 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:39:28,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:28,781 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:39:28,794 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:39:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:28,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:39:28,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:28,875 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:39:28,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:28,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688732272] [2023-08-31 23:39:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688732272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:39:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917061484] [2023-08-31 23:39:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:39:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:39:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:39:28,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 301 [2023-08-31 23:39:28,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:28,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:28,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 301 [2023-08-31 23:39:28,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:29,655 INFO L130 PetriNetUnfolder]: 4714/6862 cut-off events. [2023-08-31 23:39:29,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:29,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 6862 events. 4714/6862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 41099 event pairs, 4714 based on Foata normal form. 0/3717 useless extension candidates. Maximal degree in co-relation 13698. Up to 6801 conditions per place. [2023-08-31 23:39:29,696 INFO L137 encePairwiseOnDemand]: 284/301 looper letters, 36 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-31 23:39:29,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 159 flow [2023-08-31 23:39:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:39:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:39:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2023-08-31 23:39:29,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066445182724253 [2023-08-31 23:39:29,710 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2023-08-31 23:39:29,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2023-08-31 23:39:29,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:29,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2023-08-31 23:39:29,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:29,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:29,723 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:29,724 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 305 transitions. [2023-08-31 23:39:29,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 159 flow [2023-08-31 23:39:29,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:29,732 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-08-31 23:39:29,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-31 23:39:29,736 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2023-08-31 23:39:29,737 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-08-31 23:39:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:29,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:29,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:39:29,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:39:29,968 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:39:29,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:29,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 775972, now seen corresponding path program 1 times [2023-08-31 23:39:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930679191] [2023-08-31 23:39:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:29,974 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:39:29,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:29,979 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:39:29,980 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:39:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:30,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:39:30,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:30,132 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:39:30,134 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:39:30,163 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:39:30,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:30,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930679191] [2023-08-31 23:39:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930679191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:30,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:30,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437939792] [2023-08-31 23:39:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:30,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 301 [2023-08-31 23:39:30,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:30,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:30,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 301 [2023-08-31 23:39:30,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:30,701 INFO L130 PetriNetUnfolder]: 3050/4481 cut-off events. [2023-08-31 23:39:30,701 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:39:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8973 conditions, 4481 events. 3050/4481 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 24713 event pairs, 1930 based on Foata normal form. 108/2917 useless extension candidates. Maximal degree in co-relation 8970. Up to 2501 conditions per place. [2023-08-31 23:39:30,720 INFO L137 encePairwiseOnDemand]: 293/301 looper letters, 44 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-31 23:39:30,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 194 flow [2023-08-31 23:39:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-31 23:39:30,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4629014396456257 [2023-08-31 23:39:30,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-31 23:39:30,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-31 23:39:30,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:30,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-31 23:39:30,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 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:39:30,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:30,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:30,728 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 418 transitions. [2023-08-31 23:39:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 194 flow [2023-08-31 23:39:30,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:39:30,730 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 94 flow [2023-08-31 23:39:30,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-31 23:39:30,731 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-31 23:39:30,731 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 94 flow [2023-08-31 23:39:30,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:30,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:30,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:39:30,753 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:39:30,939 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:39:30,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:30,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 775973, now seen corresponding path program 1 times [2023-08-31 23:39:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918936356] [2023-08-31 23:39:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:30,945 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:39:30,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:30,961 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:39:30,962 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:39:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:31,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:39:31,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:31,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:39:31,066 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:39:31,085 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:39:31,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:31,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918936356] [2023-08-31 23:39:31,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918936356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:39:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556664519] [2023-08-31 23:39:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:31,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:31,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:31,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 301 [2023-08-31 23:39:31,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:31,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 301 [2023-08-31 23:39:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:31,335 INFO L130 PetriNetUnfolder]: 1154/1772 cut-off events. [2023-08-31 23:39:31,335 INFO L131 PetriNetUnfolder]: For 105/129 co-relation queries the response was YES. [2023-08-31 23:39:31,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3808 conditions, 1772 events. 1154/1772 cut-off events. For 105/129 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8687 event pairs, 1154 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 3803. Up to 1737 conditions per place. [2023-08-31 23:39:31,344 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 27 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-31 23:39:31,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 138 flow [2023-08-31 23:39:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-31 23:39:31,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529346622369878 [2023-08-31 23:39:31,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-31 23:39:31,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-31 23:39:31,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:31,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-31 23:39:31,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,349 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 94 flow. Second operand 3 states and 409 transitions. [2023-08-31 23:39:31,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 138 flow [2023-08-31 23:39:31,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:31,351 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 80 flow [2023-08-31 23:39:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-31 23:39:31,352 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -24 predicate places. [2023-08-31 23:39:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 80 flow [2023-08-31 23:39:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:31,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:31,365 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:39:31,565 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:39:31,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:31,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1574023702, now seen corresponding path program 1 times [2023-08-31 23:39:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598153137] [2023-08-31 23:39:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:31,569 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:39:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:31,570 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:39:31,572 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:39:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:31,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:39:31,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:31,665 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:39:31,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:31,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598153137] [2023-08-31 23:39:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598153137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:39:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958767300] [2023-08-31 23:39:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:39:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:39:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:39:31,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 301 [2023-08-31 23:39:31,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:31,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 301 [2023-08-31 23:39:31,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:31,820 INFO L130 PetriNetUnfolder]: 588/988 cut-off events. [2023-08-31 23:39:31,820 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2023-08-31 23:39:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 988 events. 588/988 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4751 event pairs, 191 based on Foata normal form. 12/858 useless extension candidates. Maximal degree in co-relation 2105. Up to 921 conditions per place. [2023-08-31 23:39:31,824 INFO L137 encePairwiseOnDemand]: 296/301 looper letters, 37 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-31 23:39:31,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 192 flow [2023-08-31 23:39:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:39:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:39:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-31 23:39:31,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45182724252491696 [2023-08-31 23:39:31,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-31 23:39:31,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-31 23:39:31,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:31,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-31 23:39:31,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 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:39:31,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,828 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 80 flow. Second operand 3 states and 408 transitions. [2023-08-31 23:39:31,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 192 flow [2023-08-31 23:39:31,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:31,830 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 105 flow [2023-08-31 23:39:31,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-31 23:39:31,831 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2023-08-31 23:39:31,832 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 105 flow [2023-08-31 23:39:31,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:31,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:31,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:31,854 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:39:32,039 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:39:32,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:32,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1772889140, now seen corresponding path program 1 times [2023-08-31 23:39:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376449823] [2023-08-31 23:39:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:32,041 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:39:32,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:32,042 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:39:32,044 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:39:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:32,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:39:32,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:32,149 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:39:32,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:32,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376449823] [2023-08-31 23:39:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376449823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:32,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829195905] [2023-08-31 23:39:32,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:32,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:32,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:32,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 301 [2023-08-31 23:39:32,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:32,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 301 [2023-08-31 23:39:32,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:32,273 INFO L130 PetriNetUnfolder]: 161/333 cut-off events. [2023-08-31 23:39:32,273 INFO L131 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2023-08-31 23:39:32,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 333 events. 161/333 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1309 event pairs, 43 based on Foata normal form. 16/309 useless extension candidates. Maximal degree in co-relation 831. Up to 202 conditions per place. [2023-08-31 23:39:32,274 INFO L137 encePairwiseOnDemand]: 296/301 looper letters, 44 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-08-31 23:39:32,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 259 flow [2023-08-31 23:39:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-31 23:39:32,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485049833887043 [2023-08-31 23:39:32,276 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-31 23:39:32,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-31 23:39:32,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:32,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-31 23:39:32,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,280 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 105 flow. Second operand 4 states and 540 transitions. [2023-08-31 23:39:32,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 259 flow [2023-08-31 23:39:32,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:32,281 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 141 flow [2023-08-31 23:39:32,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-31 23:39:32,282 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2023-08-31 23:39:32,283 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 141 flow [2023-08-31 23:39:32,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:32,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:32,290 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:39:32,490 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:39:32,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:32,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 76908152, now seen corresponding path program 1 times [2023-08-31 23:39:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:32,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420403547] [2023-08-31 23:39:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:32,492 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:39:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:32,493 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:39:32,495 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:39:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:32,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:39:32,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:32,628 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:39:32,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:32,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420403547] [2023-08-31 23:39:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420403547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:32,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:39:32,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865961122] [2023-08-31 23:39:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:32,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 301 [2023-08-31 23:39:32,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:32,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 301 [2023-08-31 23:39:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:32,792 INFO L130 PetriNetUnfolder]: 82/171 cut-off events. [2023-08-31 23:39:32,792 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-08-31 23:39:32,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 171 events. 82/171 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 506 event pairs, 24 based on Foata normal form. 7/173 useless extension candidates. Maximal degree in co-relation 496. Up to 70 conditions per place. [2023-08-31 23:39:32,793 INFO L137 encePairwiseOnDemand]: 296/301 looper letters, 37 selfloop transitions, 10 changer transitions 1/50 dead transitions. [2023-08-31 23:39:32,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 261 flow [2023-08-31 23:39:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:39:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:39:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-31 23:39:32,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4378737541528239 [2023-08-31 23:39:32,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-31 23:39:32,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-31 23:39:32,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:32,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-31 23:39:32,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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:39:32,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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:39:32,798 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 141 flow. Second operand 5 states and 659 transitions. [2023-08-31 23:39:32,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 261 flow [2023-08-31 23:39:32,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 245 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:32,799 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 135 flow [2023-08-31 23:39:32,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:39:32,800 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2023-08-31 23:39:32,800 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 135 flow [2023-08-31 23:39:32,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:32,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:32,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:32,810 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:39:33,001 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:39:33,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:33,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash -872569543, now seen corresponding path program 1 times [2023-08-31 23:39:33,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:33,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656384277] [2023-08-31 23:39:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:33,018 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:39:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:33,020 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:39:33,022 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:39:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:33,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:39:33,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:33,150 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:39:33,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:33,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656384277] [2023-08-31 23:39:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656384277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:33,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:33,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67389696] [2023-08-31 23:39:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:33,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:39:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:39:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:39:33,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 301 [2023-08-31 23:39:33,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:33,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 301 [2023-08-31 23:39:33,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:33,296 INFO L130 PetriNetUnfolder]: 94/211 cut-off events. [2023-08-31 23:39:33,296 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2023-08-31 23:39:33,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 211 events. 94/211 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 728 event pairs, 13 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 588. Up to 139 conditions per place. [2023-08-31 23:39:33,297 INFO L137 encePairwiseOnDemand]: 298/301 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-31 23:39:33,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 275 flow [2023-08-31 23:39:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-31 23:39:33,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42940199335548174 [2023-08-31 23:39:33,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-31 23:39:33,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-31 23:39:33,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:33,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-31 23:39:33,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,301 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,301 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 135 flow. Second operand 4 states and 517 transitions. [2023-08-31 23:39:33,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 275 flow [2023-08-31 23:39:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 243 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:39:33,302 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 111 flow [2023-08-31 23:39:33,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-31 23:39:33,303 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -23 predicate places. [2023-08-31 23:39:33,303 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 111 flow [2023-08-31 23:39:33,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:33,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:33,323 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:39:33,511 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:39:33,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:33,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:33,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1040948540, now seen corresponding path program 1 times [2023-08-31 23:39:33,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:33,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469838597] [2023-08-31 23:39:33,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:33,513 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:39:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:33,513 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:39:33,515 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:39:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:33,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:39:33,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:33,675 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:39:33,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:33,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469838597] [2023-08-31 23:39:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469838597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:33,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:33,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:33,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175391000] [2023-08-31 23:39:33,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:33,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:33,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:33,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:33,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 301 [2023-08-31 23:39:33,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:33,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 301 [2023-08-31 23:39:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:33,826 INFO L130 PetriNetUnfolder]: 94/210 cut-off events. [2023-08-31 23:39:33,826 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2023-08-31 23:39:33,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 210 events. 94/210 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 729 event pairs, 13 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 569. Up to 141 conditions per place. [2023-08-31 23:39:33,827 INFO L137 encePairwiseOnDemand]: 298/301 looper letters, 41 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-31 23:39:33,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 243 flow [2023-08-31 23:39:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:39:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:39:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-31 23:39:33,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2023-08-31 23:39:33,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-31 23:39:33,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-31 23:39:33,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:33,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-31 23:39:33,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,831 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 111 flow. Second operand 4 states and 528 transitions. [2023-08-31 23:39:33,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 243 flow [2023-08-31 23:39:33,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:33,832 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 110 flow [2023-08-31 23:39:33,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:39:33,833 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -23 predicate places. [2023-08-31 23:39:33,833 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 110 flow [2023-08-31 23:39:33,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:33,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:33,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:33,841 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:39:34,040 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:39:34,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:34,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1040948358, now seen corresponding path program 1 times [2023-08-31 23:39:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433532352] [2023-08-31 23:39:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:39:34,042 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:39:34,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:34,042 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:39:34,044 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:39:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:39:34,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:39:34,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:34,197 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:39:34,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:34,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433532352] [2023-08-31 23:39:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433532352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:34,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:39:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744936060] [2023-08-31 23:39:34,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:34,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:34,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 301 [2023-08-31 23:39:34,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:34,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:34,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 301 [2023-08-31 23:39:34,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:34,334 INFO L130 PetriNetUnfolder]: 160/316 cut-off events. [2023-08-31 23:39:34,334 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-31 23:39:34,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 316 events. 160/316 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1184 event pairs, 26 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 913. Up to 139 conditions per place. [2023-08-31 23:39:34,335 INFO L137 encePairwiseOnDemand]: 297/301 looper letters, 67 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-31 23:39:34,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 409 flow [2023-08-31 23:39:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:39:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:39:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-31 23:39:34,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2023-08-31 23:39:34,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-31 23:39:34,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-31 23:39:34,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:34,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-31 23:39:34,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:34,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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:39:34,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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:39:34,340 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 110 flow. Second operand 5 states and 660 transitions. [2023-08-31 23:39:34,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 409 flow [2023-08-31 23:39:34,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:34,341 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 129 flow [2023-08-31 23:39:34,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-31 23:39:34,342 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2023-08-31 23:39:34,342 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 129 flow [2023-08-31 23:39:34,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:34,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:34,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:34,371 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:39:34,559 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:39:34,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:34,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 936485560, now seen corresponding path program 2 times [2023-08-31 23:39:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763603322] [2023-08-31 23:39:34,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:39:34,560 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:39:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:34,586 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:39:34,616 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:39:34,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:39:34,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:39:34,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:39:34,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:34,802 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:39:34,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:34,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763603322] [2023-08-31 23:39:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763603322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:34,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281227453] [2023-08-31 23:39:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:34,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:34,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 301 [2023-08-31 23:39:34,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:34,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:34,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 301 [2023-08-31 23:39:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:34,984 INFO L130 PetriNetUnfolder]: 121/279 cut-off events. [2023-08-31 23:39:34,984 INFO L131 PetriNetUnfolder]: For 307/319 co-relation queries the response was YES. [2023-08-31 23:39:34,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 279 events. 121/279 cut-off events. For 307/319 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1224 event pairs, 7 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 905. Up to 172 conditions per place. [2023-08-31 23:39:34,989 INFO L137 encePairwiseOnDemand]: 296/301 looper letters, 64 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2023-08-31 23:39:34,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 436 flow [2023-08-31 23:39:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:39:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:39:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2023-08-31 23:39:34,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4324473975636766 [2023-08-31 23:39:34,995 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2023-08-31 23:39:34,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2023-08-31 23:39:34,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:34,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2023-08-31 23:39:34,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,002 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 129 flow. Second operand 6 states and 781 transitions. [2023-08-31 23:39:35,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 436 flow [2023-08-31 23:39:35,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:39:35,007 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 158 flow [2023-08-31 23:39:35,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-08-31 23:39:35,010 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -12 predicate places. [2023-08-31 23:39:35,010 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 158 flow [2023-08-31 23:39:35,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:35,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:35,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-08-31 23:39:35,218 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:39:35,219 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:35,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1846294086, now seen corresponding path program 3 times [2023-08-31 23:39:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121278147] [2023-08-31 23:39:35,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:39:35,220 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:39:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:35,221 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:39:35,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:39:35,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:39:35,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:39:35,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:39:35,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:39:35,387 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:39:35,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:39:35,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:39:35,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121278147] [2023-08-31 23:39:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121278147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:39:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:39:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:39:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918979424] [2023-08-31 23:39:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:39:35,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:39:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:39:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:39:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:39:35,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 301 [2023-08-31 23:39:35,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:39:35,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 301 [2023-08-31 23:39:35,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:39:35,574 INFO L130 PetriNetUnfolder]: 144/359 cut-off events. [2023-08-31 23:39:35,574 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2023-08-31 23:39:35,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 359 events. 144/359 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1780 event pairs, 4 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1224. Up to 168 conditions per place. [2023-08-31 23:39:35,579 INFO L137 encePairwiseOnDemand]: 296/301 looper letters, 67 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2023-08-31 23:39:35,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 484 flow [2023-08-31 23:39:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:39:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:39:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-31 23:39:35,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43466223698781836 [2023-08-31 23:39:35,582 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-31 23:39:35,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-31 23:39:35,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:39:35,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-31 23:39:35,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,586 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 158 flow. Second operand 6 states and 785 transitions. [2023-08-31 23:39:35,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 484 flow [2023-08-31 23:39:35,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 474 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:39:35,588 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 192 flow [2023-08-31 23:39:35,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-08-31 23:39:35,588 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2023-08-31 23:39:35,588 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 192 flow [2023-08-31 23:39:35,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:39:35,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:39:35,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:35,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-08-31 23:39:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:39:35,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-31 23:39:35,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:39:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1336593800, now seen corresponding path program 4 times [2023-08-31 23:39:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:39:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807754176] [2023-08-31 23:39:35,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:39:35,798 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:39:35,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:39:35,798 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:39:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:39:35,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:39:35,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:39:35,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:39:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:39:36,081 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:39:36,081 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:39:36,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-08-31 23:39:36,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-08-31 23:39:36,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-08-31 23:39:36,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-08-31 23:39:36,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-08-31 23:39:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:39:36,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:39:36,287 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:39:36,292 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:39:36,292 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:39:36,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:39:36 BasicIcfg [2023-08-31 23:39:36,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:39:36,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:39:36,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:39:36,352 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:39:36,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:39:20" (3/4) ... [2023-08-31 23:39:36,355 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:39:36,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:39:36,355 INFO L158 Benchmark]: Toolchain (without parser) took 17418.88ms. Allocated memory was 60.8MB in the beginning and 507.5MB in the end (delta: 446.7MB). Free memory was 37.4MB in the beginning and 252.5MB in the end (delta: -215.1MB). Peak memory consumption was 234.5MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,355 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:39:36,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.55ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 27.4MB in the end (delta: 9.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.08ms. Allocated memory is still 60.8MB. Free memory was 27.4MB in the beginning and 39.9MB in the end (delta: -12.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,356 INFO L158 Benchmark]: Boogie Preprocessor took 54.01ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,356 INFO L158 Benchmark]: RCFGBuilder took 751.42ms. Allocated memory was 60.8MB in the beginning and 92.3MB in the end (delta: 31.5MB). Free memory was 37.6MB in the beginning and 65.3MB in the end (delta: -27.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,356 INFO L158 Benchmark]: TraceAbstraction took 16163.36ms. Allocated memory was 92.3MB in the beginning and 507.5MB in the end (delta: 415.2MB). Free memory was 64.8MB in the beginning and 252.5MB in the end (delta: -187.7MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2023-08-31 23:39:36,356 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 507.5MB. Free memory is still 252.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:39:36,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.55ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 27.4MB in the end (delta: 9.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.08ms. Allocated memory is still 60.8MB. Free memory was 27.4MB in the beginning and 39.9MB in the end (delta: -12.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.01ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 751.42ms. Allocated memory was 60.8MB in the beginning and 92.3MB in the end (delta: 31.5MB). Free memory was 37.6MB in the beginning and 65.3MB in the end (delta: -27.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16163.36ms. Allocated memory was 92.3MB in the beginning and 507.5MB in the end (delta: 415.2MB). Free memory was 64.8MB in the beginning and 252.5MB in the end (delta: -187.7MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 507.5MB. Free memory is still 252.5MB. 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: 8.3s, 163 PlacesBefore, 66 PlacesAfterwards, 155 TransitionsBefore, 57 TransitionsAfterwards, 4252 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 15568 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6405, independent: 6027, independent conditional: 0, independent unconditional: 6027, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2103, independent: 2044, independent conditional: 0, independent unconditional: 2044, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6405, independent: 3983, independent conditional: 0, independent unconditional: 3983, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 2103, unknown conditional: 0, unknown unconditional: 2103] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-1, t2213={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L833] 0 pthread_t t2214; 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={14: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L834] FCALL, FORK 0 pthread_create(&t2214, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=0, t2213={7:0}, t2214={14: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=1, t2213={7:0}, t2214={14:0}, t2215={15: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 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) [L765] EXPR 1 \read(y) [L765] 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) [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L779] 1 __unbuffered_p0_EBX = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L803] 3 __unbuffered_p2_EAX = x 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L806] 3 y = 1 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={14:0}, t2215={15: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] 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}, \result={0:0}, __unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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: -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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 199 locations, 53 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.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 51 mSDtfsCounter, 1169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=11, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 618 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:39:36,376 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