./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:23:06,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:23:06,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:23:06,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:23:06,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:23:06,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:23:06,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:23:06,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:23:06,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:23:06,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:23:06,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:23:06,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:23:06,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:23:06,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:23:06,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:23:06,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:23:06,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:23:06,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:23:06,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:23:06,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:23:06,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:23:06,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:23:06,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:23:06,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:23:06,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:23:06,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:23:06,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:23:06,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:23:06,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:23:06,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:23:06,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:23:06,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:23:06,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:23:06,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:23:06,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:23:06,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:23:06,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:23:06,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:23:06,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:23:06,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:23:06,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:23:06,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:23:06,603 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:23:06,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:23:06,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:23:06,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:23:06,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:23:06,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:23:06,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:23:06,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:23:06,606 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:23:06,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:23:06,607 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:23:06,607 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:23:06,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:23:06,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:23:06,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:23:06,608 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:23:06,608 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:23:06,608 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:23:06,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:23:06,609 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:23:06,609 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:23:06,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:23:06,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:23:06,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:23:06,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:23:06,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:06,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:23:06,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:23:06,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:23:06,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:23:06,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:23:06,611 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:23:06,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:23:06,611 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:23:06,612 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 -> AFTER [2023-08-29 20:23:06,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:23:06,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:23:06,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:23:06,927 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:23:06,928 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:23:06,929 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-29 20:23:08,133 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:23:08,355 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:23:08,355 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-29 20:23:08,366 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e05d32b/26bd2118c0d9401687d452c6a1057adf/FLAG17c88215f [2023-08-29 20:23:08,377 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e05d32b/26bd2118c0d9401687d452c6a1057adf [2023-08-29 20:23:08,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:23:08,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:23:08,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:08,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:23:08,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:23:08,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:08,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bab40a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08, skipping insertion in model container [2023-08-29 20:23:08,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:08,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:23:08,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:23:08,581 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-29 20:23:08,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:08,822 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:23:08,834 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-29 20:23:08,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:08,933 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:08,933 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:08,939 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:23:08,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08 WrapperNode [2023-08-29 20:23:08,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:08,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:08,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:23:08,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:23:08,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:08,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,009 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-29 20:23:09,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:09,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:23:09,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:23:09,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:23:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:23:09,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:23:09,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:23:09,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:23:09,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (1/1) ... [2023-08-29 20:23:09,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:23:09,079 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-29 20:23:09,089 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-29 20:23:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:23:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:23:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:23:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:23:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:23:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:23:09,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:23:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:23:09,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:23:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:23:09,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:23:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:23:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:23:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:23:09,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:23:09,118 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:23:09,222 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:23:09,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:23:09,627 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:23:09,758 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:23:09,758 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:23:09,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:09 BoogieIcfgContainer [2023-08-29 20:23:09,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:23:09,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:23:09,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:23:09,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:23:09,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:23:08" (1/3) ... [2023-08-29 20:23:09,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77408104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:09, skipping insertion in model container [2023-08-29 20:23:09,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:08" (2/3) ... [2023-08-29 20:23:09,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77408104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:09, skipping insertion in model container [2023-08-29 20:23:09,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:09" (3/3) ... [2023-08-29 20:23:09,766 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-08-29 20:23:09,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:23:09,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:23:09,781 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:23:09,833 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:23:09,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:23:09,930 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:23:09,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:09,934 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-29 20:23:09,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:23:09,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-29 20:23:09,942 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:23:09,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:23:09,957 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:23:09,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-29 20:23:09,997 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:23:09,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:09,998 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-29 20:23:10,000 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-29 20:23:13,747 INFO L134 LiptonReduction]: Checked pairs total: 5482 [2023-08-29 20:23:13,748 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-29 20:23:13,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:23:13,776 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;@6a6e28b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:23:13,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:23:13,777 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:23:13,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:13,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:13,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:23:13,779 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-29 20:23:13,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2023-08-29 20:23:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:13,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342945822] [2023-08-29 20:23:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:13,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:13,893 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-29 20:23:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342945822] [2023-08-29 20:23:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342945822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:23:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731594345] [2023-08-29 20:23:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:23:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:23:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:23:13,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-08-29 20:23:13,932 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-29 20:23:13,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:13,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-08-29 20:23:13,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:14,187 INFO L130 PetriNetUnfolder]: 1263/1922 cut-off events. [2023-08-29 20:23:14,188 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:23:14,191 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-29 20:23:14,199 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:23:14,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:23:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:23:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:23:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-29 20:23:14,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-29 20:23:14,255 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-29 20:23:14,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-29 20:23:14,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:14,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-29 20:23:14,290 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-29 20:23:14,293 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-29 20:23:14,293 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-29 20:23:14,294 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 240 transitions. [2023-08-29 20:23:14,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:23:14,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:14,303 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:23:14,304 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-29 20:23:14,308 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:23:14,309 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:23:14,309 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-29 20:23:14,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:14,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:14,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:23:14,310 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-29 20:23:14,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 767703198, now seen corresponding path program 1 times [2023-08-29 20:23:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:14,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675246272] [2023-08-29 20:23:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:14,635 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-29 20:23:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675246272] [2023-08-29 20:23:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675246272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:23:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955303090] [2023-08-29 20:23:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:14,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:14,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:14,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:14,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 234 [2023-08-29 20:23:14,641 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-29 20:23:14,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:14,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 234 [2023-08-29 20:23:14,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:14,858 INFO L130 PetriNetUnfolder]: 1043/1654 cut-off events. [2023-08-29 20:23:14,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:14,860 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-29 20:23:14,865 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-29 20:23:14,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-29 20:23:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-29 20:23:14,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943019943019943 [2023-08-29 20:23:14,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-29 20:23:14,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-29 20:23:14,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:14,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-29 20:23:14,871 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-29 20:23:14,873 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-29 20:23:14,874 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-29 20:23:14,874 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 347 transitions. [2023-08-29 20:23:14,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-29 20:23:14,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:23:14,875 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:23:14,875 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-29 20:23:14,876 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:23:14,876 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:23:14,876 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-29 20:23:14,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:14,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:14,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:23:14,877 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-29 20:23:14,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash -52759260, now seen corresponding path program 1 times [2023-08-29 20:23:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93380874] [2023-08-29 20:23:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:15,238 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-29 20:23:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93380874] [2023-08-29 20:23:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93380874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693118937] [2023-08-29 20:23:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:15,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:15,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 234 [2023-08-29 20:23:15,360 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-29 20:23:15,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:15,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 234 [2023-08-29 20:23:15,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:15,545 INFO L130 PetriNetUnfolder]: 644/1015 cut-off events. [2023-08-29 20:23:15,546 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 20:23:15,547 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-29 20:23:15,551 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-29 20:23:15,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 120 flow [2023-08-29 20:23:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-08-29 20:23:15,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2023-08-29 20:23:15,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-08-29 20:23:15,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-08-29 20:23:15,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:15,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-08-29 20:23:15,556 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-29 20:23:15,558 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-29 20:23:15,559 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-29 20:23:15,559 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 477 transitions. [2023-08-29 20:23:15,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 120 flow [2023-08-29 20:23:15,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:15,561 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 56 flow [2023-08-29 20:23:15,561 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-29 20:23:15,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:23:15,562 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 56 flow [2023-08-29 20:23:15,562 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-29 20:23:15,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:15,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:15,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:23:15,562 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-29 20:23:15,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash -52759315, now seen corresponding path program 1 times [2023-08-29 20:23:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782898838] [2023-08-29 20:23:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:16,357 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-29 20:23:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782898838] [2023-08-29 20:23:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782898838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466368188] [2023-08-29 20:23:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:16,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-29 20:23:16,412 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-29 20:23:16,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:16,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-29 20:23:16,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:16,818 INFO L130 PetriNetUnfolder]: 1399/2148 cut-off events. [2023-08-29 20:23:16,818 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:23:16,821 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-29 20:23:16,827 INFO L137 encePairwiseOnDemand]: 224/234 looper letters, 31 selfloop transitions, 8 changer transitions 26/66 dead transitions. [2023-08-29 20:23:16,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 274 flow [2023-08-29 20:23:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2023-08-29 20:23:16,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4432234432234432 [2023-08-29 20:23:16,831 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2023-08-29 20:23:16,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2023-08-29 20:23:16,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:16,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2023-08-29 20:23:16,833 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-29 20:23:16,836 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-29 20:23:16,837 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-29 20:23:16,837 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 56 flow. Second operand 7 states and 726 transitions. [2023-08-29 20:23:16,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 274 flow [2023-08-29 20:23:16,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 269 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:16,838 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 127 flow [2023-08-29 20:23:16,839 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-29 20:23:16,839 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 20:23:16,839 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 127 flow [2023-08-29 20:23:16,840 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-29 20:23:16,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:16,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:16,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:23:16,841 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-29 20:23:16,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 933752434, now seen corresponding path program 1 times [2023-08-29 20:23:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839968557] [2023-08-29 20:23:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:17,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:17,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839968557] [2023-08-29 20:23:17,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839968557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:17,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:17,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:17,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969065697] [2023-08-29 20:23:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:17,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:17,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-29 20:23:17,073 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-29 20:23:17,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:17,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-29 20:23:17,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:17,378 INFO L130 PetriNetUnfolder]: 1141/1881 cut-off events. [2023-08-29 20:23:17,378 INFO L131 PetriNetUnfolder]: For 2284/2285 co-relation queries the response was YES. [2023-08-29 20:23:17,383 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-29 20:23:17,391 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 35 selfloop transitions, 4 changer transitions 17/59 dead transitions. [2023-08-29 20:23:17,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 372 flow [2023-08-29 20:23:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-29 20:23:17,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735042735042735 [2023-08-29 20:23:17,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-29 20:23:17,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-29 20:23:17,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:17,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-29 20:23:17,396 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-29 20:23:17,398 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-29 20:23:17,399 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-29 20:23:17,399 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 127 flow. Second operand 5 states and 554 transitions. [2023-08-29 20:23:17,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 372 flow [2023-08-29 20:23:17,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 365 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:17,406 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 167 flow [2023-08-29 20:23:17,406 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-29 20:23:17,407 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 20:23:17,407 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 167 flow [2023-08-29 20:23:17,407 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-29 20:23:17,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:17,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:23:17,408 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-29 20:23:17,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1118487322, now seen corresponding path program 1 times [2023-08-29 20:23:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063235988] [2023-08-29 20:23:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:17,702 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-29 20:23:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063235988] [2023-08-29 20:23:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063235988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:17,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179522995] [2023-08-29 20:23:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:17,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-29 20:23:17,715 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-29 20:23:17,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:17,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-29 20:23:17,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:17,861 INFO L130 PetriNetUnfolder]: 527/906 cut-off events. [2023-08-29 20:23:17,861 INFO L131 PetriNetUnfolder]: For 1254/1291 co-relation queries the response was YES. [2023-08-29 20:23:17,863 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-29 20:23:17,867 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 37 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-29 20:23:17,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 326 flow [2023-08-29 20:23:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-29 20:23:17,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-29 20:23:17,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-29 20:23:17,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-29 20:23:17,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:17,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-29 20:23:17,871 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-29 20:23:17,872 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-29 20:23:17,872 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-29 20:23:17,873 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 167 flow. Second operand 3 states and 336 transitions. [2023-08-29 20:23:17,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 326 flow [2023-08-29 20:23:17,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 315 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:17,878 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 183 flow [2023-08-29 20:23:17,878 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-29 20:23:17,880 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 20:23:17,880 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 183 flow [2023-08-29 20:23:17,880 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-29 20:23:17,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:17,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:17,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:23:17,882 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-29 20:23:17,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1885836371, now seen corresponding path program 1 times [2023-08-29 20:23:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:17,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560902395] [2023-08-29 20:23:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:18,639 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-29 20:23:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560902395] [2023-08-29 20:23:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560902395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841088633] [2023-08-29 20:23:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:18,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:18,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-29 20:23:18,683 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-29 20:23:18,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:18,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-29 20:23:18,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:18,953 INFO L130 PetriNetUnfolder]: 768/1333 cut-off events. [2023-08-29 20:23:18,954 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2023-08-29 20:23:18,957 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-29 20:23:18,961 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 45 selfloop transitions, 9 changer transitions 17/72 dead transitions. [2023-08-29 20:23:18,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 507 flow [2023-08-29 20:23:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:23:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:23:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2023-08-29 20:23:18,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44373219373219375 [2023-08-29 20:23:18,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 623 transitions. [2023-08-29 20:23:18,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions. [2023-08-29 20:23:18,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:18,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions. [2023-08-29 20:23:18,965 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-29 20:23:18,967 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-29 20:23:18,968 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-29 20:23:18,968 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 183 flow. Second operand 6 states and 623 transitions. [2023-08-29 20:23:18,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 507 flow [2023-08-29 20:23:18,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 496 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 20:23:18,972 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 225 flow [2023-08-29 20:23:18,972 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-29 20:23:18,972 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-29 20:23:18,972 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 225 flow [2023-08-29 20:23:18,973 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-29 20:23:18,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:18,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:18,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:23:18,973 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-29 20:23:18,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1322754691, now seen corresponding path program 1 times [2023-08-29 20:23:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661652302] [2023-08-29 20:23:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:19,227 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-29 20:23:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661652302] [2023-08-29 20:23:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661652302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072112622] [2023-08-29 20:23:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:19,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-29 20:23:19,238 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-29 20:23:19,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:19,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-29 20:23:19,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:19,347 INFO L130 PetriNetUnfolder]: 256/504 cut-off events. [2023-08-29 20:23:19,347 INFO L131 PetriNetUnfolder]: For 914/932 co-relation queries the response was YES. [2023-08-29 20:23:19,349 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-29 20:23:19,351 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 46 selfloop transitions, 7 changer transitions 4/64 dead transitions. [2023-08-29 20:23:19,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 491 flow [2023-08-29 20:23:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-29 20:23:19,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-29 20:23:19,353 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-29 20:23:19,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-29 20:23:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:19,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-29 20:23:19,354 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-29 20:23:19,356 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-29 20:23:19,356 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-29 20:23:19,356 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 225 flow. Second operand 4 states and 448 transitions. [2023-08-29 20:23:19,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 491 flow [2023-08-29 20:23:19,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 475 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:19,359 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 247 flow [2023-08-29 20:23:19,360 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-29 20:23:19,360 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-29 20:23:19,360 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 247 flow [2023-08-29 20:23:19,361 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-29 20:23:19,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:19,361 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-29 20:23:19,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:23:19,361 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-29 20:23:19,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1476560480, now seen corresponding path program 1 times [2023-08-29 20:23:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326320196] [2023-08-29 20:23:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326320196] [2023-08-29 20:23:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326320196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:19,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15852438] [2023-08-29 20:23:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:19,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-29 20:23:19,627 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-29 20:23:19,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:19,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-29 20:23:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:19,732 INFO L130 PetriNetUnfolder]: 184/366 cut-off events. [2023-08-29 20:23:19,732 INFO L131 PetriNetUnfolder]: For 841/861 co-relation queries the response was YES. [2023-08-29 20:23:19,734 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-29 20:23:19,735 INFO L137 encePairwiseOnDemand]: 229/234 looper letters, 38 selfloop transitions, 10 changer transitions 7/61 dead transitions. [2023-08-29 20:23:19,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 479 flow [2023-08-29 20:23:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-29 20:23:19,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2023-08-29 20:23:19,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-29 20:23:19,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-29 20:23:19,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:19,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-29 20:23:19,739 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-29 20:23:19,741 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-29 20:23:19,741 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-29 20:23:19,741 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 247 flow. Second operand 5 states and 549 transitions. [2023-08-29 20:23:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 479 flow [2023-08-29 20:23:19,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 449 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:19,744 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 213 flow [2023-08-29 20:23:19,744 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-29 20:23:19,745 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-29 20:23:19,745 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 213 flow [2023-08-29 20:23:19,745 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-29 20:23:19,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:19,746 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-29 20:23:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:23:19,746 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-29 20:23:19,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1603443425, now seen corresponding path program 1 times [2023-08-29 20:23:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50505293] [2023-08-29 20:23:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:20,422 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-29 20:23:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50505293] [2023-08-29 20:23:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50505293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433448396] [2023-08-29 20:23:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:20,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 234 [2023-08-29 20:23:20,470 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-29 20:23:20,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:20,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 234 [2023-08-29 20:23:20,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:20,698 INFO L130 PetriNetUnfolder]: 134/281 cut-off events. [2023-08-29 20:23:20,698 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2023-08-29 20:23:20,699 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-29 20:23:20,699 INFO L137 encePairwiseOnDemand]: 224/234 looper letters, 29 selfloop transitions, 6 changer transitions 35/71 dead transitions. [2023-08-29 20:23:20,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 586 flow [2023-08-29 20:23:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-08-29 20:23:20,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249084249084249 [2023-08-29 20:23:20,702 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-08-29 20:23:20,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-08-29 20:23:20,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:20,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-08-29 20:23:20,704 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-29 20:23:20,706 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-29 20:23:20,707 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-29 20:23:20,707 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 213 flow. Second operand 7 states and 696 transitions. [2023-08-29 20:23:20,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 586 flow [2023-08-29 20:23:20,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 481 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-08-29 20:23:20,710 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 170 flow [2023-08-29 20:23:20,711 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-29 20:23:20,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-29 20:23:20,711 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 170 flow [2023-08-29 20:23:20,712 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-29 20:23:20,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:20,712 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-29 20:23:20,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:23:20,712 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-29 20:23:20,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 812918817, now seen corresponding path program 2 times [2023-08-29 20:23:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953099017] [2023-08-29 20:23:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:21,711 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-29 20:23:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:21,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953099017] [2023-08-29 20:23:21,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953099017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:21,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:23:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90193926] [2023-08-29 20:23:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:23:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:23:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:23:21,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-08-29 20:23:21,777 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-29 20:23:21,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:21,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-08-29 20:23:21,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:21,981 INFO L130 PetriNetUnfolder]: 50/128 cut-off events. [2023-08-29 20:23:21,981 INFO L131 PetriNetUnfolder]: For 258/259 co-relation queries the response was YES. [2023-08-29 20:23:21,982 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-29 20:23:21,982 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 26 selfloop transitions, 5 changer transitions 12/45 dead transitions. [2023-08-29 20:23:21,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 331 flow [2023-08-29 20:23:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:23:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:23:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2023-08-29 20:23:21,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2023-08-29 20:23:21,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions. [2023-08-29 20:23:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions. [2023-08-29 20:23:21,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions. [2023-08-29 20:23:21,987 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-29 20:23:21,999 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-29 20:23:22,000 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-29 20:23:22,000 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 170 flow. Second operand 6 states and 630 transitions. [2023-08-29 20:23:22,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 331 flow [2023-08-29 20:23:22,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 296 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-08-29 20:23:22,003 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 143 flow [2023-08-29 20:23:22,003 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-29 20:23:22,003 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-29 20:23:22,003 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 143 flow [2023-08-29 20:23:22,004 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-29 20:23:22,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:22,004 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-29 20:23:22,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:23:22,004 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-29 20:23:22,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1727383823, now seen corresponding path program 3 times [2023-08-29 20:23:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093106832] [2023-08-29 20:23:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:23:22,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:23:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:23:22,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:23:22,112 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:23:22,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:23:22,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:23:22,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:23:22,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:23:22,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:23:22,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:23:22,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:23:22,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:23:22,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:23:22,116 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:22,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:23:22,120 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:23:22,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:23:22 BasicIcfg [2023-08-29 20:23:22,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:23:22,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:23:22,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:23:22,167 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:23:22,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:09" (3/4) ... [2023-08-29 20:23:22,169 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:23:22,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:23:22,169 INFO L158 Benchmark]: Toolchain (without parser) took 13789.29ms. Allocated memory was 62.9MB in the beginning and 297.8MB in the end (delta: 234.9MB). Free memory was 40.0MB in the beginning and 215.9MB in the end (delta: -175.9MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,170 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 62.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:22,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.46ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 39.9MB in the beginning and 45.6MB in the end (delta: -5.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.70ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 42.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,170 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 77.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,171 INFO L158 Benchmark]: RCFGBuilder took 712.29ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 48.2MB in the end (delta: -7.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,171 INFO L158 Benchmark]: TraceAbstraction took 12404.51ms. Allocated memory was 77.6MB in the beginning and 297.8MB in the end (delta: 220.2MB). Free memory was 47.4MB in the beginning and 215.9MB in the end (delta: -168.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2023-08-29 20:23:22,172 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 297.8MB. Free memory is still 215.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:22,173 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.20ms. Allocated memory is still 62.9MB. Free memory is still 40.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.46ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 39.9MB in the beginning and 45.6MB in the end (delta: -5.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.70ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 42.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 77.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.29ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 48.2MB in the end (delta: -7.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12404.51ms. Allocated memory was 77.6MB in the beginning and 297.8MB in the end (delta: 220.2MB). Free memory was 47.4MB in the beginning and 215.9MB in the end (delta: -168.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 297.8MB. Free memory is still 215.9MB. 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: 12.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, 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.6s 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.4s SatisfiabilityAnalysisTime, 4.5s 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-29 20:23:22,193 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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:23:23,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:23:23,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:23:24,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:23:24,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:23:24,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:23:24,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:23:24,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:23:24,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:23:24,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:23:24,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:23:24,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:23:24,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:23:24,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:23:24,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:23:24,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:23:24,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:23:24,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:23:24,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:23:24,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:23:24,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:23:24,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:23:24,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:23:24,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:23:24,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:23:24,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:23:24,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:23:24,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:23:24,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:23:24,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:23:24,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:23:24,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:23:24,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:23:24,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:23:24,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:23:24,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:23:24,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:23:24,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:23:24,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:23:24,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:23:24,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:23:24,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:23:24,109 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:23:24,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:23:24,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:23:24,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:23:24,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:23:24,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:23:24,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:23:24,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:23:24,113 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:23:24,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:23:24,114 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:23:24,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:23:24,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:23:24,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:23:24,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:23:24,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:23:24,116 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:23:24,116 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:23:24,116 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:23:24,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:23:24,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:23:24,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:23:24,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:24,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:23:24,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:23:24,117 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:23:24,117 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:23:24,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:23:24,118 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:23:24,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:23:24,118 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:23:24,118 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:23:24,118 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 -> AFTER [2023-08-29 20:23:24,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:23:24,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:23:24,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:23:24,442 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:23:24,443 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:23:24,444 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-29 20:23:25,564 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:23:25,847 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:23:25,847 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2023-08-29 20:23:25,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf37b521/fed4b060791d4bd08c10eafefac91925/FLAGe58f60d6c [2023-08-29 20:23:25,870 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf37b521/fed4b060791d4bd08c10eafefac91925 [2023-08-29 20:23:25,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:23:25,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:23:25,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:25,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:23:25,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:23:25,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:25" (1/1) ... [2023-08-29 20:23:25,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69db0fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:25, skipping insertion in model container [2023-08-29 20:23:25,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:25" (1/1) ... [2023-08-29 20:23:25,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:23:25,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:23:26,109 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-29 20:23:26,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:26,347 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:23:26,360 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-29 20:23:26,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:26,461 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:26,462 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:26,467 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:23:26,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26 WrapperNode [2023-08-29 20:23:26,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:26,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:26,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:23:26,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:23:26,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,538 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-29 20:23:26,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:26,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:23:26,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:23:26,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:23:26,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,592 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:23:26,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:23:26,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:23:26,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:23:26,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (1/1) ... [2023-08-29 20:23:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:23:26,632 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-29 20:23:26,645 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-29 20:23:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:23:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:23:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:23:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:23:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:23:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:23:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:23:26,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:23:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:23:26,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:23:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:23:26,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:23:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:23:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:23:26,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:23:26,677 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:23:26,836 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:23:26,838 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:23:27,186 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:23:27,445 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:23:27,446 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:23:27,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:27 BoogieIcfgContainer [2023-08-29 20:23:27,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:23:27,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:23:27,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:23:27,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:23:27,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:23:25" (1/3) ... [2023-08-29 20:23:27,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1417d820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:27, skipping insertion in model container [2023-08-29 20:23:27,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:26" (2/3) ... [2023-08-29 20:23:27,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1417d820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:27, skipping insertion in model container [2023-08-29 20:23:27,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:27" (3/3) ... [2023-08-29 20:23:27,458 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-08-29 20:23:27,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:23:27,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:23:27,472 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:23:27,536 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:23:27,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:23:27,618 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:23:27,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:27,623 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-29 20:23:27,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:23:27,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-29 20:23:27,632 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:23:27,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:23:27,648 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:23:27,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-29 20:23:27,687 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:23:27,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:27,689 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-29 20:23:27,691 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-29 20:23:33,633 INFO L134 LiptonReduction]: Checked pairs total: 5469 [2023-08-29 20:23:33,634 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-29 20:23:33,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:23:33,650 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;@26494606, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:23:33,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:23:33,652 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:23:33,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:33,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:33,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:23:33,653 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-29 20:23:33,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2023-08-29 20:23:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34462010] [2023-08-29 20:23:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:33,667 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-29 20:23:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:33,673 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-29 20:23:33,692 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-29 20:23:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:33,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:23:33,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:33,754 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-29 20:23:33,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:33,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34462010] [2023-08-29 20:23:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34462010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:33,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:23:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032914487] [2023-08-29 20:23:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:33,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:23:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:23:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:23:33,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 20:23:33,785 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-29 20:23:33,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:33,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 20:23:33,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:34,238 INFO L130 PetriNetUnfolder]: 1263/1910 cut-off events. [2023-08-29 20:23:34,238 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:23:34,256 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-29 20:23:34,266 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:23:34,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:23:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:23:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:23:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2023-08-29 20:23:34,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2023-08-29 20:23:34,282 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2023-08-29 20:23:34,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2023-08-29 20:23:34,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:34,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2023-08-29 20:23:34,290 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-29 20:23:34,294 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-29 20:23:34,294 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-29 20:23:34,296 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 242 transitions. [2023-08-29 20:23:34,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:23:34,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:34,300 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:23:34,302 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-29 20:23:34,304 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:23:34,305 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:23:34,305 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-29 20:23:34,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:34,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:34,317 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-29 20:23:34,514 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-29 20:23:34,514 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-29 20:23:34,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -919123429, now seen corresponding path program 1 times [2023-08-29 20:23:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582832136] [2023-08-29 20:23:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:34,516 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-29 20:23:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:34,519 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-29 20:23:34,522 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-29 20:23:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:34,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:23:34,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:34,632 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-29 20:23:34,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:34,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582832136] [2023-08-29 20:23:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582832136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:23:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041777594] [2023-08-29 20:23:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:34,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:34,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-29 20:23:34,640 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-29 20:23:34,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:34,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-29 20:23:34,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:34,889 INFO L130 PetriNetUnfolder]: 1043/1654 cut-off events. [2023-08-29 20:23:34,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:34,892 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-29 20:23:34,897 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-29 20:23:34,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-29 20:23:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-29 20:23:34,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2023-08-29 20:23:34,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-29 20:23:34,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-29 20:23:34,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:34,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-29 20:23:34,904 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-29 20:23:34,907 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-29 20:23:34,908 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-29 20:23:34,908 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 350 transitions. [2023-08-29 20:23:34,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-29 20:23:34,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:23:34,909 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:23:34,910 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-29 20:23:34,910 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:23:34,911 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:23:34,911 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-29 20:23:34,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:34,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:34,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:23:35,120 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-29 20:23:35,121 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-29 20:23:35,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1187380401, now seen corresponding path program 1 times [2023-08-29 20:23:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972208023] [2023-08-29 20:23:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:35,122 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-29 20:23:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:35,124 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-29 20:23:35,127 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-29 20:23:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:35,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:23:35,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:35,238 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-29 20:23:35,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:35,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972208023] [2023-08-29 20:23:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972208023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649439285] [2023-08-29 20:23:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:35,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:35,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:35,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-29 20:23:35,248 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-29 20:23:35,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:35,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-29 20:23:35,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:35,377 INFO L130 PetriNetUnfolder]: 417/697 cut-off events. [2023-08-29 20:23:35,378 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-29 20:23:35,379 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-29 20:23:35,381 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-08-29 20:23:35,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 154 flow [2023-08-29 20:23:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-29 20:23:35,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48226950354609927 [2023-08-29 20:23:35,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-29 20:23:35,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-29 20:23:35,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:35,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-29 20:23:35,385 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-29 20:23:35,386 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-29 20:23:35,387 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-29 20:23:35,387 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 3 states and 340 transitions. [2023-08-29 20:23:35,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 154 flow [2023-08-29 20:23:35,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:35,388 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 78 flow [2023-08-29 20:23:35,389 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-29 20:23:35,389 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:23:35,389 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 78 flow [2023-08-29 20:23:35,390 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-29 20:23:35,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:35,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:35,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:23:35,599 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-29 20:23:35,599 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-29 20:23:35,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 196004735, now seen corresponding path program 1 times [2023-08-29 20:23:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146936364] [2023-08-29 20:23:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:35,601 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-29 20:23:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:35,604 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-29 20:23:35,606 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-29 20:23:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:35,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:23:35,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:35,748 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-29 20:23:35,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:35,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146936364] [2023-08-29 20:23:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146936364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:35,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788106228] [2023-08-29 20:23:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:35,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:35,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:35,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-29 20:23:35,764 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-29 20:23:35,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:35,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-29 20:23:35,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:35,893 INFO L130 PetriNetUnfolder]: 157/307 cut-off events. [2023-08-29 20:23:35,893 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-08-29 20:23:35,894 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-29 20:23:35,895 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-29 20:23:35,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 220 flow [2023-08-29 20:23:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-29 20:23:35,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819148936170213 [2023-08-29 20:23:35,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-29 20:23:35,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-29 20:23:35,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:35,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-29 20:23:35,898 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-29 20:23:35,900 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-29 20:23:35,900 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-29 20:23:35,901 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 78 flow. Second operand 4 states and 453 transitions. [2023-08-29 20:23:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 220 flow [2023-08-29 20:23:35,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:23:35,903 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2023-08-29 20:23:35,903 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-29 20:23:35,904 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-08-29 20:23:35,905 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2023-08-29 20:23:35,905 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-29 20:23:35,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:35,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:35,918 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-29 20:23:36,115 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-29 20:23:36,116 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-29 20:23:36,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 190478922, now seen corresponding path program 1 times [2023-08-29 20:23:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559694980] [2023-08-29 20:23:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:36,117 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-29 20:23:36,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:36,119 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-29 20:23:36,121 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-29 20:23:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:36,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:23:36,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:36,247 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-29 20:23:36,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:36,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559694980] [2023-08-29 20:23:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559694980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000444511] [2023-08-29 20:23:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:36,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:36,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-29 20:23:36,261 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-29 20:23:36,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:36,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-29 20:23:36,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:36,415 INFO L130 PetriNetUnfolder]: 112/217 cut-off events. [2023-08-29 20:23:36,415 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-29 20:23:36,416 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-29 20:23:36,417 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 34 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-29 20:23:36,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 244 flow [2023-08-29 20:23:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-29 20:23:36,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-08-29 20:23:36,420 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-29 20:23:36,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-29 20:23:36,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:36,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-29 20:23:36,426 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-29 20:23:36,428 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-29 20:23:36,428 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-29 20:23:36,429 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 5 states and 555 transitions. [2023-08-29 20:23:36,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 244 flow [2023-08-29 20:23:36,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 230 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:36,431 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 128 flow [2023-08-29 20:23:36,431 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-29 20:23:36,432 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:23:36,432 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 128 flow [2023-08-29 20:23:36,432 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-29 20:23:36,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:36,433 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-29 20:23:36,445 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-29 20:23:36,642 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-29 20:23:36,642 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-29 20:23:36,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1903840447, now seen corresponding path program 1 times [2023-08-29 20:23:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034862111] [2023-08-29 20:23:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:36,644 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-29 20:23:36,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:36,645 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-29 20:23:36,645 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-29 20:23:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:36,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:23:36,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:36,864 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-29 20:23:36,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:36,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034862111] [2023-08-29 20:23:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034862111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:36,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632801888] [2023-08-29 20:23:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:36,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:36,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-29 20:23:36,877 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-29 20:23:36,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:36,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-29 20:23:36,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:37,022 INFO L130 PetriNetUnfolder]: 202/392 cut-off events. [2023-08-29 20:23:37,022 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2023-08-29 20:23:37,022 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-29 20:23:37,024 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 46 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-29 20:23:37,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 334 flow [2023-08-29 20:23:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-29 20:23:37,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474468085106383 [2023-08-29 20:23:37,026 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-29 20:23:37,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-29 20:23:37,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:37,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-29 20:23:37,028 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-29 20:23:37,029 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-29 20:23:37,030 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-29 20:23:37,030 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 128 flow. Second operand 4 states and 446 transitions. [2023-08-29 20:23:37,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 334 flow [2023-08-29 20:23:37,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 284 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:37,033 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 122 flow [2023-08-29 20:23:37,034 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-29 20:23:37,034 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:23:37,034 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 122 flow [2023-08-29 20:23:37,035 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-29 20:23:37,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:37,035 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-29 20:23:37,045 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-29 20:23:37,244 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-29 20:23:37,245 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-29 20:23:37,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash -230729426, now seen corresponding path program 1 times [2023-08-29 20:23:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452798120] [2023-08-29 20:23:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:37,246 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-29 20:23:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:37,247 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-29 20:23:37,248 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-29 20:23:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:37,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:23:37,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:37,669 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-29 20:23:37,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:37,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452798120] [2023-08-29 20:23:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452798120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469689740] [2023-08-29 20:23:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:37,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:37,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 235 [2023-08-29 20:23:37,814 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-29 20:23:37,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:37,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 235 [2023-08-29 20:23:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:37,988 INFO L130 PetriNetUnfolder]: 162/321 cut-off events. [2023-08-29 20:23:37,988 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2023-08-29 20:23:37,989 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-29 20:23:37,990 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 3 changer transitions 3/40 dead transitions. [2023-08-29 20:23:37,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 239 flow [2023-08-29 20:23:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-08-29 20:23:37,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40595744680851065 [2023-08-29 20:23:37,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-08-29 20:23:37,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-08-29 20:23:37,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:37,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-08-29 20:23:37,994 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-29 20:23:37,996 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-29 20:23:37,996 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-29 20:23:37,996 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 122 flow. Second operand 5 states and 477 transitions. [2023-08-29 20:23:37,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 239 flow [2023-08-29 20:23:38,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:23:38,002 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 114 flow [2023-08-29 20:23:38,002 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-29 20:23:38,002 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 20:23:38,003 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 114 flow [2023-08-29 20:23:38,003 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-29 20:23:38,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:38,003 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-29 20:23:38,013 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-29 20:23:38,213 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-29 20:23:38,214 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-29 20:23:38,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash -470257343, now seen corresponding path program 2 times [2023-08-29 20:23:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:38,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065005809] [2023-08-29 20:23:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:23:38,215 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-29 20:23:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:38,216 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-29 20:23:38,218 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-29 20:23:38,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:23:38,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:23:38,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:23:38,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:38,805 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-29 20:23:38,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:38,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065005809] [2023-08-29 20:23:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065005809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217971222] [2023-08-29 20:23:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:38,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-29 20:23:38,824 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-29 20:23:38,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:38,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-29 20:23:38,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:38,976 INFO L130 PetriNetUnfolder]: 106/241 cut-off events. [2023-08-29 20:23:38,977 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2023-08-29 20:23:38,977 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-29 20:23:38,978 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 27 selfloop transitions, 1 changer transitions 22/52 dead transitions. [2023-08-29 20:23:38,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 314 flow [2023-08-29 20:23:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-29 20:23:38,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46297872340425533 [2023-08-29 20:23:38,980 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-29 20:23:38,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-29 20:23:38,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:38,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-29 20:23:38,982 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-29 20:23:38,984 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-29 20:23:38,984 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-29 20:23:38,985 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 114 flow. Second operand 5 states and 544 transitions. [2023-08-29 20:23:38,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 314 flow [2023-08-29 20:23:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 297 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:23:38,988 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 112 flow [2023-08-29 20:23:38,988 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-29 20:23:38,991 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 20:23:38,991 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 112 flow [2023-08-29 20:23:38,991 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-29 20:23:38,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:38,991 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-29 20:23:39,007 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-29 20:23:39,201 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-29 20:23:39,201 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-29 20:23:39,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1815875437, now seen corresponding path program 3 times [2023-08-29 20:23:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403132025] [2023-08-29 20:23:39,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:23:39,202 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-29 20:23:39,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:39,207 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-29 20:23:39,211 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-29 20:23:39,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:23:39,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:23:39,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 20:23:39,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:23:39,562 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-29 20:23:39,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:23:39,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:23:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403132025] [2023-08-29 20:23:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403132025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783072769] [2023-08-29 20:23:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:39,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:23:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:23:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:23:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:23:39,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-29 20:23:39,595 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-29 20:23:39,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:39,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-29 20:23:39,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:39,712 INFO L130 PetriNetUnfolder]: 105/227 cut-off events. [2023-08-29 20:23:39,712 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2023-08-29 20:23:39,713 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-29 20:23:39,713 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 28 selfloop transitions, 3 changer transitions 13/46 dead transitions. [2023-08-29 20:23:39,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-08-29 20:23:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-29 20:23:39,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621276595744681 [2023-08-29 20:23:39,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-29 20:23:39,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-29 20:23:39,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:39,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-29 20:23:39,718 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-29 20:23:39,719 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-29 20:23:39,720 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-29 20:23:39,720 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 112 flow. Second operand 5 states and 543 transitions. [2023-08-29 20:23:39,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-08-29 20:23:39,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 270 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:39,723 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 121 flow [2023-08-29 20:23:39,723 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-29 20:23:39,724 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-29 20:23:39,724 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 121 flow [2023-08-29 20:23:39,724 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-29 20:23:39,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:39,724 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-29 20:23:39,739 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-29 20:23:39,939 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-29 20:23:39,939 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-29 20:23:39,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -981010739, now seen corresponding path program 4 times [2023-08-29 20:23:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:23:39,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905597184] [2023-08-29 20:23:39,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:23:39,941 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-29 20:23:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:23:39,942 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-29 20:23:39,945 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-29 20:23:40,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:23:40,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:23:40,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:23:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:23:40,179 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:23:40,180 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:23:40,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:23:40,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:23:40,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:23:40,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:23:40,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:23:40,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:23:40,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:23:40,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:23:40,197 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-29 20:23:40,394 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-29 20:23:40,394 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:40,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:23:40,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:23:40,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:23:40 BasicIcfg [2023-08-29 20:23:40,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:23:40,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:23:40,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:23:40,469 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:23:40,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:27" (3/4) ... [2023-08-29 20:23:40,471 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:23:40,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:23:40,472 INFO L158 Benchmark]: Toolchain (without parser) took 14599.08ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 47.7MB in the beginning and 35.0MB in the end (delta: 12.7MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,472 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:40,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.56ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 56.7MB in the end (delta: -9.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.26ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 53.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,473 INFO L158 Benchmark]: Boogie Preprocessor took 62.61ms. Allocated memory is still 86.0MB. Free memory was 53.7MB in the beginning and 51.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,473 INFO L158 Benchmark]: RCFGBuilder took 845.00ms. Allocated memory is still 86.0MB. Free memory was 51.4MB in the beginning and 51.2MB in the end (delta: 140.2kB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,473 INFO L158 Benchmark]: TraceAbstraction took 13019.25ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 50.8MB in the beginning and 35.0MB in the end (delta: 15.8MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2023-08-29 20:23:40,474 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 125.8MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:40,475 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.19ms. Allocated memory is still 71.3MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.56ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 56.7MB in the end (delta: -9.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.26ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 53.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.61ms. Allocated memory is still 86.0MB. Free memory was 53.7MB in the beginning and 51.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.00ms. Allocated memory is still 86.0MB. Free memory was 51.4MB in the beginning and 51.2MB in the end (delta: 140.2kB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13019.25ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 50.8MB in the beginning and 35.0MB in the end (delta: 15.8MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 125.8MB. Free memory is still 35.0MB. 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: 6.0s, 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.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, 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.3s 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-29 20:23:40,497 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