./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.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/mix028_tso.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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --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:17:08,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:17:08,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:17:08,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:17:08,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:17:08,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:17:08,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:17:08,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:17:08,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:17:08,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:17:08,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:17:08,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:17:08,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:17:08,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:17:08,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:17:08,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:17:08,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:17:08,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:17:08,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:17:08,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:17:08,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:17:08,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:17:08,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:17:08,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:17:08,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:17:08,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:17:08,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:17:08,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:17:08,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:17:08,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:17:08,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:17:08,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:17:08,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:17:08,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:17:08,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:17:08,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:17:08,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:17:08,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:17:08,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:17:08,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:17:08,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:17:08,516 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:17:08,557 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:17:08,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:17:08,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:17:08,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:17:08,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:17:08,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:17:08,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:17:08,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:17:08,561 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:17:08,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:17:08,562 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:17:08,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:17:08,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:17:08,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:17:08,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:17:08,563 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:17:08,563 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:17:08,563 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:17:08,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:17:08,564 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:17:08,564 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:17:08,564 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:17:08,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:17:08,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:17:08,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:17:08,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:08,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:17:08,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:17:08,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:17:08,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:17:08,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:17:08,566 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:17:08,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:17:08,567 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:17:08,567 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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a 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:17:08,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:17:08,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:17:08,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:17:08,898 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:17:08,898 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:17:08,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-31 23:17:10,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:17:10,329 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:17:10,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-31 23:17:10,353 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1418a7b80/6ce7e388a35c4fe2ada915a2b0b89bbe/FLAGe0c113159 [2023-08-31 23:17:10,368 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1418a7b80/6ce7e388a35c4fe2ada915a2b0b89bbe [2023-08-31 23:17:10,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:17:10,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:17:10,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:10,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:17:10,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:17:10,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8961fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10, skipping insertion in model container [2023-08-31 23:17:10,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:17:10,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:17:10,566 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/mix028_tso.i[944,957] [2023-08-31 23:17:10,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:10,817 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:17:10,828 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/mix028_tso.i[944,957] [2023-08-31 23:17:10,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:10,963 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:10,964 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:10,969 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:17:10,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10 WrapperNode [2023-08-31 23:17:10,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:10,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:10,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:17:10,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:17:10,978 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:17:10" (1/1) ... [2023-08-31 23:17:10,996 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:17:10" (1/1) ... [2023-08-31 23:17:11,020 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-31 23:17:11,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:11,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:17:11,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:17:11,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:17:11,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:17:11,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:17:11,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:17:11,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:17:11,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:11,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:17:11,086 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:17:11,101 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:17:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:17:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:17:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:17:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:17:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:17:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:17:11,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:17:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:17:11,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:17:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:17:11,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:17:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:17:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:17:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:17:11,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:17:11,136 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:17:11,254 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:17:11,256 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:17:11,652 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:17:11,781 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:17:11,784 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:17:11,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11 BoogieIcfgContainer [2023-08-31 23:17:11,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:17:11,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:17:11,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:17:11,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:17:11,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:17:10" (1/3) ... [2023-08-31 23:17:11,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b97835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:11, skipping insertion in model container [2023-08-31 23:17:11,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (2/3) ... [2023-08-31 23:17:11,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b97835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:11, skipping insertion in model container [2023-08-31 23:17:11,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11" (3/3) ... [2023-08-31 23:17:11,793 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-08-31 23:17:11,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:17:11,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:17:11,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:17:11,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:17:11,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:17:12,015 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:17:12,015 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:17:12,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:17:12,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:17:12,033 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:17:12,045 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:17:12,058 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:17:12,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:17:12,086 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:17:12,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:12,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:17:12,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-31 23:17:15,835 INFO L134 LiptonReduction]: Checked pairs total: 5482 [2023-08-31 23:17:15,836 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-31 23:17:15,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:17:15,857 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;@4e85a0df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:17:15,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:17:15,858 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:17:15,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:15,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:15,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:17:15,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:15,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2023-08-31 23:17:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702178666] [2023-08-31 23:17:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702178666] [2023-08-31 23:17:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702178666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:17:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382785291] [2023-08-31 23:17:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:16,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:17:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:16,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:17:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:17:16,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-08-31 23:17:16,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:16,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-08-31 23:17:16,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:16,361 INFO L130 PetriNetUnfolder]: 1263/1922 cut-off events. [2023-08-31 23:17:16,362 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 23:17:16,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1922 events. 1263/1922 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9455 event pairs, 1263 based on Foata normal form. 72/1666 useless extension candidates. Maximal degree in co-relation 3818. Up to 1871 conditions per place. [2023-08-31 23:17:16,380 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-31 23:17:16,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-31 23:17:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:17:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:17:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-31 23:17:16,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-31 23:17:16,397 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-31 23:17:16,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-31 23:17:16,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:16,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-31 23:17:16,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,412 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,414 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 240 transitions. [2023-08-31 23:17:16,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-31 23:17:16,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:16,419 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-31 23:17:16,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-31 23:17:16,424 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-31 23:17:16,424 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-31 23:17:16,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:16,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:16,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:17:16,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:16,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 767703198, now seen corresponding path program 1 times [2023-08-31 23:17:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987693918] [2023-08-31 23:17:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:16,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:16,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987693918] [2023-08-31 23:17:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987693918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:16,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:17:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792522928] [2023-08-31 23:17:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:16,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 234 [2023-08-31 23:17:16,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:16,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 234 [2023-08-31 23:17:16,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:17,090 INFO L130 PetriNetUnfolder]: 1043/1654 cut-off events. [2023-08-31 23:17:17,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:17,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1654 events. 1043/1654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8524 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3240. Up to 1265 conditions per place. [2023-08-31 23:17:17,098 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-31 23:17:17,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-31 23:17:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-31 23:17:17,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943019943019943 [2023-08-31 23:17:17,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-31 23:17:17,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-31 23:17:17,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:17,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-31 23:17:17,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,114 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 347 transitions. [2023-08-31 23:17:17,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-31 23:17:17,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:17:17,115 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-31 23:17:17,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-31 23:17:17,116 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-31 23:17:17,116 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-31 23:17:17,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:17,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:17,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:17:17,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:17,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -52759260, now seen corresponding path program 1 times [2023-08-31 23:17:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789061967] [2023-08-31 23:17:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789061967] [2023-08-31 23:17:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789061967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:17,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029303806] [2023-08-31 23:17:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:17,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:17,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:17,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 234 [2023-08-31 23:17:17,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:17,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 234 [2023-08-31 23:17:17,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:18,007 INFO L130 PetriNetUnfolder]: 644/1015 cut-off events. [2023-08-31 23:17:18,007 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-31 23:17:18,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 1015 events. 644/1015 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4600 event pairs, 196 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 2083. Up to 946 conditions per place. [2023-08-31 23:17:18,012 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-31 23:17:18,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 120 flow [2023-08-31 23:17:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-08-31 23:17:18,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2023-08-31 23:17:18,015 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-08-31 23:17:18,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-08-31 23:17:18,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:18,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-08-31 23:17:18,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,020 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 477 transitions. [2023-08-31 23:17:18,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 120 flow [2023-08-31 23:17:18,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:18,022 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 56 flow [2023-08-31 23:17:18,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-31 23:17:18,023 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-31 23:17:18,024 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 56 flow [2023-08-31 23:17:18,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:18,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:18,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:17:18,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:18,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -52759315, now seen corresponding path program 1 times [2023-08-31 23:17:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567466632] [2023-08-31 23:17:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567466632] [2023-08-31 23:17:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567466632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909136480] [2023-08-31 23:17:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:18,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-31 23:17:18,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:18,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-31 23:17:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:19,480 INFO L130 PetriNetUnfolder]: 1399/2148 cut-off events. [2023-08-31 23:17:19,480 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-31 23:17:19,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 2148 events. 1399/2148 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10143 event pairs, 311 based on Foata normal form. 128/2272 useless extension candidates. Maximal degree in co-relation 4355. Up to 1137 conditions per place. [2023-08-31 23:17:19,489 INFO L137 encePairwiseOnDemand]: 224/234 looper letters, 31 selfloop transitions, 8 changer transitions 26/66 dead transitions. [2023-08-31 23:17:19,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 274 flow [2023-08-31 23:17:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2023-08-31 23:17:19,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4432234432234432 [2023-08-31 23:17:19,492 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2023-08-31 23:17:19,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2023-08-31 23:17:19,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:19,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2023-08-31 23:17:19,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,502 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,502 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 56 flow. Second operand 7 states and 726 transitions. [2023-08-31 23:17:19,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 274 flow [2023-08-31 23:17:19,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 269 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:19,505 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 127 flow [2023-08-31 23:17:19,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-31 23:17:19,507 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-31 23:17:19,508 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 127 flow [2023-08-31 23:17:19,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:19,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:19,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:17:19,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:19,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 933752434, now seen corresponding path program 1 times [2023-08-31 23:17:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448911268] [2023-08-31 23:17:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:19,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448911268] [2023-08-31 23:17:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448911268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:19,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298952831] [2023-08-31 23:17:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:19,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:19,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-31 23:17:19,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:19,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-31 23:17:19,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:20,130 INFO L130 PetriNetUnfolder]: 1141/1881 cut-off events. [2023-08-31 23:17:20,130 INFO L131 PetriNetUnfolder]: For 2284/2285 co-relation queries the response was YES. [2023-08-31 23:17:20,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 1881 events. 1141/1881 cut-off events. For 2284/2285 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9663 event pairs, 442 based on Foata normal form. 93/1961 useless extension candidates. Maximal degree in co-relation 5640. Up to 1455 conditions per place. [2023-08-31 23:17:20,141 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 35 selfloop transitions, 4 changer transitions 17/59 dead transitions. [2023-08-31 23:17:20,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 372 flow [2023-08-31 23:17:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-31 23:17:20,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735042735042735 [2023-08-31 23:17:20,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-31 23:17:20,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-31 23:17:20,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:20,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-31 23:17:20,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,148 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 127 flow. Second operand 5 states and 554 transitions. [2023-08-31 23:17:20,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 372 flow [2023-08-31 23:17:20,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 365 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:20,158 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 167 flow [2023-08-31 23:17:20,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-31 23:17:20,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-31 23:17:20,160 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 167 flow [2023-08-31 23:17:20,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:20,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:20,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:17:20,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:20,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1118487322, now seen corresponding path program 1 times [2023-08-31 23:17:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413113113] [2023-08-31 23:17:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413113113] [2023-08-31 23:17:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413113113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910523578] [2023-08-31 23:17:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:20,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-31 23:17:20,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:20,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-31 23:17:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:20,648 INFO L130 PetriNetUnfolder]: 527/906 cut-off events. [2023-08-31 23:17:20,648 INFO L131 PetriNetUnfolder]: For 1254/1291 co-relation queries the response was YES. [2023-08-31 23:17:20,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 906 events. 527/906 cut-off events. For 1254/1291 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4196 event pairs, 151 based on Foata normal form. 38/927 useless extension candidates. Maximal degree in co-relation 2971. Up to 720 conditions per place. [2023-08-31 23:17:20,655 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 37 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-31 23:17:20,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 326 flow [2023-08-31 23:17:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-31 23:17:20,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-31 23:17:20,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-31 23:17:20,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-31 23:17:20,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:20,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-31 23:17:20,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,660 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 167 flow. Second operand 3 states and 336 transitions. [2023-08-31 23:17:20,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 326 flow [2023-08-31 23:17:20,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 315 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:20,663 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 183 flow [2023-08-31 23:17:20,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=157, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-31 23:17:20,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-31 23:17:20,664 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 183 flow [2023-08-31 23:17:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:20,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:20,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:17:20,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:20,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1885836371, now seen corresponding path program 1 times [2023-08-31 23:17:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082338045] [2023-08-31 23:17:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082338045] [2023-08-31 23:17:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082338045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278080568] [2023-08-31 23:17:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:21,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-31 23:17:21,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:21,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-31 23:17:21,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:21,765 INFO L130 PetriNetUnfolder]: 768/1333 cut-off events. [2023-08-31 23:17:21,766 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2023-08-31 23:17:21,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4798 conditions, 1333 events. 768/1333 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6634 event pairs, 244 based on Foata normal form. 38/1371 useless extension candidates. Maximal degree in co-relation 4787. Up to 643 conditions per place. [2023-08-31 23:17:21,774 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 45 selfloop transitions, 9 changer transitions 17/72 dead transitions. [2023-08-31 23:17:21,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 507 flow [2023-08-31 23:17:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2023-08-31 23:17:21,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44373219373219375 [2023-08-31 23:17:21,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 623 transitions. [2023-08-31 23:17:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions. [2023-08-31 23:17:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:21,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions. [2023-08-31 23:17:21,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 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:17:21,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,781 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,781 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 183 flow. Second operand 6 states and 623 transitions. [2023-08-31 23:17:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 507 flow [2023-08-31 23:17:21,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 496 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:21,786 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 225 flow [2023-08-31 23:17:21,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-08-31 23:17:21,787 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-31 23:17:21,787 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 225 flow [2023-08-31 23:17:21,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:21,788 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:17:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:17:21,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:21,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1322754691, now seen corresponding path program 1 times [2023-08-31 23:17:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913100196] [2023-08-31 23:17:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:22,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:17:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913100196] [2023-08-31 23:17:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913100196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948504309] [2023-08-31 23:17:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:22,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:22,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-31 23:17:22,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 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:17:22,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:22,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-31 23:17:22,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:22,208 INFO L130 PetriNetUnfolder]: 256/504 cut-off events. [2023-08-31 23:17:22,209 INFO L131 PetriNetUnfolder]: For 914/932 co-relation queries the response was YES. [2023-08-31 23:17:22,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 504 events. 256/504 cut-off events. For 914/932 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2308 event pairs, 62 based on Foata normal form. 64/562 useless extension candidates. Maximal degree in co-relation 1862. Up to 199 conditions per place. [2023-08-31 23:17:22,212 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 46 selfloop transitions, 7 changer transitions 4/64 dead transitions. [2023-08-31 23:17:22,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 491 flow [2023-08-31 23:17:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-31 23:17:22,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-31 23:17:22,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-31 23:17:22,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-31 23:17:22,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:22,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-31 23:17:22,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,218 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 225 flow. Second operand 4 states and 448 transitions. [2023-08-31 23:17:22,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 491 flow [2023-08-31 23:17:22,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 475 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:22,222 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 247 flow [2023-08-31 23:17:22,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-31 23:17:22,224 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-31 23:17:22,224 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 247 flow [2023-08-31 23:17:22,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 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:17:22,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:22,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:22,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:17:22,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:22,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1476560480, now seen corresponding path program 1 times [2023-08-31 23:17:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420967527] [2023-08-31 23:17:22,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420967527] [2023-08-31 23:17:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420967527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:22,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555641800] [2023-08-31 23:17:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:22,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-31 23:17:22,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:22,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-31 23:17:22,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:22,647 INFO L130 PetriNetUnfolder]: 184/366 cut-off events. [2023-08-31 23:17:22,648 INFO L131 PetriNetUnfolder]: For 841/861 co-relation queries the response was YES. [2023-08-31 23:17:22,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 366 events. 184/366 cut-off events. For 841/861 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1611 event pairs, 49 based on Foata normal form. 39/400 useless extension candidates. Maximal degree in co-relation 1480. Up to 140 conditions per place. [2023-08-31 23:17:22,650 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 38 selfloop transitions, 10 changer transitions 7/61 dead transitions. [2023-08-31 23:17:22,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 479 flow [2023-08-31 23:17:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-31 23:17:22,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2023-08-31 23:17:22,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-31 23:17:22,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-31 23:17:22,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:22,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-31 23:17:22,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,658 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 247 flow. Second operand 5 states and 549 transitions. [2023-08-31 23:17:22,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 479 flow [2023-08-31 23:17:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 449 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:22,661 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 213 flow [2023-08-31 23:17:22,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-31 23:17:22,662 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-31 23:17:22,662 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 213 flow [2023-08-31 23:17:22,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:22,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:22,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:17:22,663 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:22,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1603443425, now seen corresponding path program 1 times [2023-08-31 23:17:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347634944] [2023-08-31 23:17:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347634944] [2023-08-31 23:17:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347634944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468725490] [2023-08-31 23:17:23,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:23,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:23,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 234 [2023-08-31 23:17:23,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:23,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 234 [2023-08-31 23:17:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:23,718 INFO L130 PetriNetUnfolder]: 134/281 cut-off events. [2023-08-31 23:17:23,718 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2023-08-31 23:17:23,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 281 events. 134/281 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1031 event pairs, 13 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 1193. Up to 143 conditions per place. [2023-08-31 23:17:23,720 INFO L137 encePairwiseOnDemand]: 224/234 looper letters, 29 selfloop transitions, 6 changer transitions 35/71 dead transitions. [2023-08-31 23:17:23,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 586 flow [2023-08-31 23:17:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-08-31 23:17:23,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249084249084249 [2023-08-31 23:17:23,723 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-08-31 23:17:23,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-08-31 23:17:23,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:23,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-08-31 23:17:23,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,729 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,729 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 213 flow. Second operand 7 states and 696 transitions. [2023-08-31 23:17:23,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 586 flow [2023-08-31 23:17:23,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 481 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-08-31 23:17:23,735 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 170 flow [2023-08-31 23:17:23,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-31 23:17:23,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-31 23:17:23,736 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 170 flow [2023-08-31 23:17:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:23,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:23,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:17:23,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:23,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 812918817, now seen corresponding path program 2 times [2023-08-31 23:17:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949534426] [2023-08-31 23:17:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949534426] [2023-08-31 23:17:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949534426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:17:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626045261] [2023-08-31 23:17:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:24,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:17:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:17:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:17:24,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-08-31 23:17:24,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 170 flow. Second operand has 9 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:24,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:24,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-08-31 23:17:24,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:25,068 INFO L130 PetriNetUnfolder]: 50/128 cut-off events. [2023-08-31 23:17:25,068 INFO L131 PetriNetUnfolder]: For 258/259 co-relation queries the response was YES. [2023-08-31 23:17:25,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 128 events. 50/128 cut-off events. For 258/259 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 367 event pairs, 12 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 495. Up to 71 conditions per place. [2023-08-31 23:17:25,069 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 26 selfloop transitions, 5 changer transitions 12/45 dead transitions. [2023-08-31 23:17:25,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 331 flow [2023-08-31 23:17:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2023-08-31 23:17:25,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2023-08-31 23:17:25,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions. [2023-08-31 23:17:25,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions. [2023-08-31 23:17:25,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:25,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions. [2023-08-31 23:17:25,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,077 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 170 flow. Second operand 6 states and 630 transitions. [2023-08-31 23:17:25,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 331 flow [2023-08-31 23:17:25,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 296 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-08-31 23:17:25,079 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 143 flow [2023-08-31 23:17:25,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-08-31 23:17:25,080 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-31 23:17:25,080 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 143 flow [2023-08-31 23:17:25,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:25,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, 1, 1] [2023-08-31 23:17:25,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:17:25,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:25,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1727383823, now seen corresponding path program 3 times [2023-08-31 23:17:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909332173] [2023-08-31 23:17:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:25,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:25,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:17:25,226 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:25,226 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:17:25,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:17:25,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:17:25,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:17:25,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:17:25,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:17:25,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:17:25,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:17:25,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:17:25,230 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:25,236 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:25,237 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:25,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:25 BasicIcfg [2023-08-31 23:17:25,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:25,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:25,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:25,315 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:25,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11" (3/4) ... [2023-08-31 23:17:25,318 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:25,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:25,319 INFO L158 Benchmark]: Toolchain (without parser) took 14948.35ms. Allocated memory was 81.8MB in the beginning and 293.6MB in the end (delta: 211.8MB). Free memory was 58.7MB in the beginning and 134.6MB in the end (delta: -75.9MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,319 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:25,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.85ms. Allocated memory is still 81.8MB. Free memory was 58.5MB in the beginning and 54.1MB in the end (delta: 4.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.99ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 51.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,320 INFO L158 Benchmark]: Boogie Preprocessor took 26.48ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,320 INFO L158 Benchmark]: RCFGBuilder took 738.43ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 33.5MB in the end (delta: 15.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,321 INFO L158 Benchmark]: TraceAbstraction took 13524.14ms. Allocated memory was 81.8MB in the beginning and 293.6MB in the end (delta: 211.8MB). Free memory was 33.1MB in the beginning and 134.6MB in the end (delta: -101.5MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2023-08-31 23:17:25,321 INFO L158 Benchmark]: Witness Printer took 6.13ms. Allocated memory is still 293.6MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:25,322 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.26ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.85ms. Allocated memory is still 81.8MB. Free memory was 58.5MB in the beginning and 54.1MB in the end (delta: 4.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.99ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 51.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.48ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 738.43ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 33.5MB in the end (delta: 15.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13524.14ms. Allocated memory was 81.8MB in the beginning and 293.6MB in the end (delta: 211.8MB). Free memory was 33.1MB in the beginning and 134.6MB in the end (delta: -101.5MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. * Witness Printer took 6.13ms. Allocated memory is still 293.6MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 123 PlacesBefore, 42 PlacesAfterwards, 115 TransitionsBefore, 33 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2372, independent: 2208, independent conditional: 0, independent unconditional: 2208, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1085, independent: 1054, independent conditional: 0, independent unconditional: 1054, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2372, independent: 1154, independent conditional: 0, independent unconditional: 1154, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1085, unknown conditional: 0, unknown unconditional: 1085] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-3, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-2, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=-1, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [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}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 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: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 29 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=8, InterpolantAutomatonStates: 53, 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.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:25,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --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:17:27,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:17:27,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:17:27,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:17:27,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:17:27,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:17:27,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:17:27,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:17:27,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:17:27,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:17:27,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:17:27,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:17:27,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:17:27,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:17:27,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:17:27,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:17:27,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:17:27,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:17:27,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:17:27,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:17:27,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:17:27,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:17:27,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:17:27,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:17:27,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:17:27,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:17:27,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:17:27,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:17:27,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:17:27,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:17:27,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:17:27,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:17:27,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:17:27,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:17:27,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:17:27,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:17:27,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:17:27,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:17:27,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:17:27,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:17:27,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:17:27,311 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:17:27,350 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:17:27,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:17:27,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:17:27,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:17:27,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:17:27,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:17:27,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:17:27,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:17:27,354 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:17:27,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:17:27,355 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:17:27,355 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:17:27,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:17:27,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:17:27,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:17:27,356 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:17:27,356 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:17:27,357 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:17:27,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:17:27,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:17:27,357 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:17:27,357 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:17:27,358 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:17:27,358 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:17:27,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:17:27,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:17:27,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:17:27,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:27,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:17:27,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:17:27,360 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:17:27,360 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:17:27,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:17:27,360 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:17:27,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:17:27,361 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:17:27,361 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:17:27,361 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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a 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:17:27,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:17:27,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:17:27,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:17:27,731 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:17:27,731 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:17:27,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-31 23:17:29,013 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:17:29,253 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:17:29,253 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-31 23:17:29,265 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5efe2fd/192d93117cf3416f929822b0069d5599/FLAGf7ffbf31d [2023-08-31 23:17:29,279 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5efe2fd/192d93117cf3416f929822b0069d5599 [2023-08-31 23:17:29,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:17:29,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:17:29,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:29,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:17:29,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:17:29,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590f5ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29, skipping insertion in model container [2023-08-31 23:17:29,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:17:29,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:17:29,450 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/mix028_tso.i[944,957] [2023-08-31 23:17:29,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:29,603 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:17:29,613 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/mix028_tso.i[944,957] [2023-08-31 23:17:29,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:29,684 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:29,684 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:29,690 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:17:29,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29 WrapperNode [2023-08-31 23:17:29,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:29,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:29,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:17:29,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:17:29,698 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:17:29" (1/1) ... [2023-08-31 23:17:29,713 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:17:29" (1/1) ... [2023-08-31 23:17:29,737 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-31 23:17:29,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:29,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:17:29,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:17:29,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:17:29,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:17:29,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:17:29,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:17:29,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:17:29,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (1/1) ... [2023-08-31 23:17:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:29,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:17:29,801 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:17:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:17:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:17:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:17:29,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:17:29,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:17:29,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:17:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:17:29,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:17:29,831 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:17:29,828 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:17:29,991 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:17:29,992 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:17:30,395 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:17:30,526 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:17:30,526 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:17:30,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:30 BoogieIcfgContainer [2023-08-31 23:17:30,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:17:30,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:17:30,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:17:30,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:17:30,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:17:29" (1/3) ... [2023-08-31 23:17:30,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:30, skipping insertion in model container [2023-08-31 23:17:30,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:29" (2/3) ... [2023-08-31 23:17:30,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:30, skipping insertion in model container [2023-08-31 23:17:30,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:30" (3/3) ... [2023-08-31 23:17:30,535 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-08-31 23:17:30,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:17:30,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:17:30,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:17:30,617 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:17:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:17:30,713 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:17:30,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:17:30,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:17:30,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-31 23:17:30,726 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:17:30,738 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:17:30,740 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:17:30,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-31 23:17:30,759 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:17:30,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:17:30,762 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-31 23:17:36,640 INFO L134 LiptonReduction]: Checked pairs total: 5469 [2023-08-31 23:17:36,641 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-31 23:17:36,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:17:36,659 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;@94e90d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:17:36,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:17:36,661 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:17:36,662 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:36,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:36,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:17:36,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:36,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2023-08-31 23:17:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539489528] [2023-08-31 23:17:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:36,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:36,683 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:17:36,689 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:17:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:36,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:17:36,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:36,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:36,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539489528] [2023-08-31 23:17:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539489528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:17:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666027495] [2023-08-31 23:17:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:36,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:17:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:17:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:17:36,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-31 23:17:36,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:36,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:36,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-31 23:17:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:37,210 INFO L130 PetriNetUnfolder]: 1263/1910 cut-off events. [2023-08-31 23:17:37,210 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 23:17:37,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 1910 events. 1263/1910 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9334 event pairs, 1263 based on Foata normal form. 72/1654 useless extension candidates. Maximal degree in co-relation 3806. Up to 1871 conditions per place. [2023-08-31 23:17:37,228 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-31 23:17:37,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-31 23:17:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:17:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:17:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2023-08-31 23:17:37,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2023-08-31 23:17:37,239 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2023-08-31 23:17:37,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2023-08-31 23:17:37,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:37,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2023-08-31 23:17:37,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,249 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,251 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 242 transitions. [2023-08-31 23:17:37,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-31 23:17:37,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:37,255 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-31 23:17:37,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-31 23:17:37,260 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-31 23:17:37,260 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-31 23:17:37,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:37,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:37,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:37,471 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:17:37,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:37,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash -919123429, now seen corresponding path program 1 times [2023-08-31 23:17:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544904980] [2023-08-31 23:17:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:37,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:37,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:37,475 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:17:37,480 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:17:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:37,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:37,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:37,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:37,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:37,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544904980] [2023-08-31 23:17:37,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544904980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:37,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:37,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:17:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818362778] [2023-08-31 23:17:37,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:37,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:37,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-31 23:17:37,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:37,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-31 23:17:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:37,823 INFO L130 PetriNetUnfolder]: 1043/1654 cut-off events. [2023-08-31 23:17:37,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:37,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1654 events. 1043/1654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8652 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3240. Up to 1265 conditions per place. [2023-08-31 23:17:37,831 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-31 23:17:37,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-31 23:17:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-31 23:17:37,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2023-08-31 23:17:37,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-31 23:17:37,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-31 23:17:37,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:37,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-31 23:17:37,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,843 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 350 transitions. [2023-08-31 23:17:37,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-31 23:17:37,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:17:37,844 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-31 23:17:37,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-31 23:17:37,845 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-31 23:17:37,846 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-31 23:17:37,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:37,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:37,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:37,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:17:38,057 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:17:38,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:38,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1187380401, now seen corresponding path program 1 times [2023-08-31 23:17:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941430085] [2023-08-31 23:17:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:38,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:38,066 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:17:38,067 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:17:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:38,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:38,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:38,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941430085] [2023-08-31 23:17:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941430085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502870757] [2023-08-31 23:17:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:38,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:38,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:38,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 23:17:38,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:38,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 23:17:38,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:38,326 INFO L130 PetriNetUnfolder]: 417/697 cut-off events. [2023-08-31 23:17:38,327 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-31 23:17:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 697 events. 417/697 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3046 event pairs, 95 based on Foata normal form. 24/682 useless extension candidates. Maximal degree in co-relation 1460. Up to 609 conditions per place. [2023-08-31 23:17:38,331 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-08-31 23:17:38,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 154 flow [2023-08-31 23:17:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-31 23:17:38,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48226950354609927 [2023-08-31 23:17:38,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-31 23:17:38,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-31 23:17:38,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:38,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-31 23:17:38,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,337 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 3 states and 340 transitions. [2023-08-31 23:17:38,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 154 flow [2023-08-31 23:17:38,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:38,339 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 78 flow [2023-08-31 23:17:38,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-31 23:17:38,340 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-31 23:17:38,340 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 78 flow [2023-08-31 23:17:38,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:38,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:38,350 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 (4)] Ended with exit code 0 [2023-08-31 23:17:38,550 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:17:38,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:38,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 196004735, now seen corresponding path program 1 times [2023-08-31 23:17:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957678837] [2023-08-31 23:17:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:38,554 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:17:38,556 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:17:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:38,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:38,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:38,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:38,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957678837] [2023-08-31 23:17:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957678837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:38,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551531989] [2023-08-31 23:17:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:38,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:38,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:38,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 23:17:38,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:38,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 23:17:38,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:38,841 INFO L130 PetriNetUnfolder]: 157/307 cut-off events. [2023-08-31 23:17:38,841 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-08-31 23:17:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 307 events. 157/307 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1152 event pairs, 44 based on Foata normal form. 26/320 useless extension candidates. Maximal degree in co-relation 764. Up to 129 conditions per place. [2023-08-31 23:17:38,843 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-31 23:17:38,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 220 flow [2023-08-31 23:17:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-31 23:17:38,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819148936170213 [2023-08-31 23:17:38,845 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-31 23:17:38,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-31 23:17:38,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:38,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-31 23:17:38,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,849 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,849 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 78 flow. Second operand 4 states and 453 transitions. [2023-08-31 23:17:38,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 220 flow [2023-08-31 23:17:38,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:38,852 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2023-08-31 23:17:38,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-31 23:17:38,853 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-08-31 23:17:38,854 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2023-08-31 23:17:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:38,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:38,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:38,868 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:17:39,063 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:17:39,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:39,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 190478922, now seen corresponding path program 1 times [2023-08-31 23:17:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296871652] [2023-08-31 23:17:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:39,067 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:17:39,069 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:17:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:39,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:17:39,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:39,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:39,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296871652] [2023-08-31 23:17:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296871652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:39,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152920071] [2023-08-31 23:17:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:39,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 23:17:39,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:39,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 23:17:39,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:39,368 INFO L130 PetriNetUnfolder]: 112/217 cut-off events. [2023-08-31 23:17:39,368 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-31 23:17:39,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 217 events. 112/217 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 760 event pairs, 39 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 609. Up to 90 conditions per place. [2023-08-31 23:17:39,370 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 34 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-31 23:17:39,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 244 flow [2023-08-31 23:17:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-31 23:17:39,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-08-31 23:17:39,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-31 23:17:39,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-31 23:17:39,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:39,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-31 23:17:39,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,378 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,378 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 5 states and 555 transitions. [2023-08-31 23:17:39,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 244 flow [2023-08-31 23:17:39,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 230 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:39,380 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 128 flow [2023-08-31 23:17:39,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-31 23:17:39,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-31 23:17:39,381 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 128 flow [2023-08-31 23:17:39,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:39,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:39,397 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:17:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:39,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:39,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1903840447, now seen corresponding path program 1 times [2023-08-31 23:17:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245834612] [2023-08-31 23:17:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:39,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:39,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:17:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:39,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:39,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:39,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:39,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245834612] [2023-08-31 23:17:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245834612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319582179] [2023-08-31 23:17:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:39,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:39,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 23:17:39,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:39,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 23:17:39,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:39,967 INFO L130 PetriNetUnfolder]: 202/392 cut-off events. [2023-08-31 23:17:39,968 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2023-08-31 23:17:39,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 392 events. 202/392 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1710 event pairs, 95 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 1137. Up to 231 conditions per place. [2023-08-31 23:17:39,970 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 46 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-31 23:17:39,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 334 flow [2023-08-31 23:17:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-31 23:17:39,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474468085106383 [2023-08-31 23:17:39,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-31 23:17:39,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-31 23:17:39,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:39,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-31 23:17:39,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,977 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 128 flow. Second operand 4 states and 446 transitions. [2023-08-31 23:17:39,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 334 flow [2023-08-31 23:17:39,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 284 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:39,980 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 122 flow [2023-08-31 23:17:39,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-31 23:17:39,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-31 23:17:39,981 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 122 flow [2023-08-31 23:17:39,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:39,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:39,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:39,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:40,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:40,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:40,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash -230729426, now seen corresponding path program 1 times [2023-08-31 23:17:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641537056] [2023-08-31 23:17:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:40,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:40,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:17:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:40,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:17:40,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:40,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:40,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641537056] [2023-08-31 23:17:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641537056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:40,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:40,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286599850] [2023-08-31 23:17:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:40,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 235 [2023-08-31 23:17:40,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:40,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:40,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 235 [2023-08-31 23:17:40,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:41,049 INFO L130 PetriNetUnfolder]: 162/321 cut-off events. [2023-08-31 23:17:41,050 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2023-08-31 23:17:41,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 321 events. 162/321 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1325 event pairs, 46 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 924. Up to 265 conditions per place. [2023-08-31 23:17:41,051 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 3 changer transitions 3/40 dead transitions. [2023-08-31 23:17:41,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 239 flow [2023-08-31 23:17:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-08-31 23:17:41,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40595744680851065 [2023-08-31 23:17:41,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-08-31 23:17:41,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-08-31 23:17:41,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:41,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-08-31 23:17:41,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:41,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:41,057 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:41,057 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 122 flow. Second operand 5 states and 477 transitions. [2023-08-31 23:17:41,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 239 flow [2023-08-31 23:17:41,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:17:41,059 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 114 flow [2023-08-31 23:17:41,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-31 23:17:41,060 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-31 23:17:41,060 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 114 flow [2023-08-31 23:17:41,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:41,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:41,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:41,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:41,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:41,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -470257343, now seen corresponding path program 2 times [2023-08-31 23:17:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420573475] [2023-08-31 23:17:41,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:17:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:41,274 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:41,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:17:41,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:41,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:41,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:41,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:41,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:41,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420573475] [2023-08-31 23:17:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420573475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129792672] [2023-08-31 23:17:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:41,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:41,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-31 23:17:41,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:41,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:41,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-31 23:17:41,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:42,047 INFO L130 PetriNetUnfolder]: 106/241 cut-off events. [2023-08-31 23:17:42,047 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2023-08-31 23:17:42,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 241 events. 106/241 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 916 event pairs, 16 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 702. Up to 148 conditions per place. [2023-08-31 23:17:42,048 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 27 selfloop transitions, 1 changer transitions 22/52 dead transitions. [2023-08-31 23:17:42,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 314 flow [2023-08-31 23:17:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-31 23:17:42,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46297872340425533 [2023-08-31 23:17:42,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-31 23:17:42,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-31 23:17:42,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:42,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-31 23:17:42,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,056 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 114 flow. Second operand 5 states and 544 transitions. [2023-08-31 23:17:42,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 314 flow [2023-08-31 23:17:42,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 297 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-31 23:17:42,058 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 112 flow [2023-08-31 23:17:42,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-08-31 23:17:42,061 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-31 23:17:42,061 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 112 flow [2023-08-31 23:17:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:42,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:42,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:42,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:42,271 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:42,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1815875437, now seen corresponding path program 3 times [2023-08-31 23:17:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:42,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444698867] [2023-08-31 23:17:42,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:17:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:42,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:17:42,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:17:42,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:42,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 23:17:42,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:42,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:42,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444698867] [2023-08-31 23:17:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444698867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322229691] [2023-08-31 23:17:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:42,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:42,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 23:17:42,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:42,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 23:17:42,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:42,802 INFO L130 PetriNetUnfolder]: 105/227 cut-off events. [2023-08-31 23:17:42,802 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2023-08-31 23:17:42,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 227 events. 105/227 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 765 event pairs, 38 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 689. Up to 125 conditions per place. [2023-08-31 23:17:42,803 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 28 selfloop transitions, 3 changer transitions 13/46 dead transitions. [2023-08-31 23:17:42,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-08-31 23:17:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-31 23:17:42,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621276595744681 [2023-08-31 23:17:42,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-31 23:17:42,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-31 23:17:42,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:42,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-31 23:17:42,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,809 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,810 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 112 flow. Second operand 5 states and 543 transitions. [2023-08-31 23:17:42,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-08-31 23:17:42,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 270 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:42,813 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 121 flow [2023-08-31 23:17:42,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-31 23:17:42,814 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-31 23:17:42,814 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 121 flow [2023-08-31 23:17:42,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:42,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:42,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:42,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:43,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:43,025 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:17:43,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash -981010739, now seen corresponding path program 4 times [2023-08-31 23:17:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862313066] [2023-08-31 23:17:43,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:17:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:43,027 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:43,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:17:43,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:17:43,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:17:43,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:43,326 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:17:43,327 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:43,328 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:17:43,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:17:43,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:17:43,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:17:43,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:17:43,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:17:43,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:17:43,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:17:43,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:43,543 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:43,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:43,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:43,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:43 BasicIcfg [2023-08-31 23:17:43,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:43,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:43,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:43,622 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:43,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:30" (3/4) ... [2023-08-31 23:17:43,628 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:43,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:43,629 INFO L158 Benchmark]: Toolchain (without parser) took 14347.05ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 67.0MB in the beginning and 91.1MB in the end (delta: -24.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,629 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory is still 43.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:43,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.26ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 64.0MB in the end (delta: 3.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,630 INFO L158 Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,630 INFO L158 Benchmark]: RCFGBuilder took 760.65ms. Allocated memory is still 90.2MB. Free memory was 59.0MB in the beginning and 37.3MB in the end (delta: 21.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,630 INFO L158 Benchmark]: TraceAbstraction took 13091.30ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 36.8MB in the beginning and 91.1MB in the end (delta: -54.3MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2023-08-31 23:17:43,631 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 132.1MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:43,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory is still 43.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.26ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 64.0MB in the end (delta: 3.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.02ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.65ms. Allocated memory is still 90.2MB. Free memory was 59.0MB in the beginning and 37.3MB in the end (delta: 21.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13091.30ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 36.8MB in the beginning and 91.1MB in the end (delta: -54.3MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 132.1MB. Free memory is still 91.1MB. 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.9s, 124 PlacesBefore, 42 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5469 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2406, independent: 2241, independent conditional: 0, independent unconditional: 2241, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, independent: 1046, independent conditional: 0, independent unconditional: 1046, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2406, independent: 1195, independent conditional: 0, independent unconditional: 1195, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=0, t763={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=1, t763={-6:0}, t764={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=2, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [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) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 3 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 1.4s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 13 QuantifiedInterpolants, 1077 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1150 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:43,655 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