./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi004.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/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --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:32:06,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:32:06,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:32:06,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:32:06,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:32:06,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:32:06,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:32:06,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:32:06,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:32:06,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:32:06,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:32:06,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:32:06,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:32:06,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:32:06,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:32:06,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:32:06,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:32:06,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:32:06,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:32:06,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:32:06,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:32:06,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:32:06,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:32:06,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:32:06,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:32:06,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:32:06,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:32:06,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:32:06,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:32:06,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:32:06,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:32:06,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:32:06,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:32:06,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:32:06,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:32:06,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:32:06,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:32:06,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:32:06,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:32:06,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:32:06,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:32:06,826 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:32:06,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:32:06,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:32:06,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:32:06,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:32:06,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:32:06,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:32:06,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:32:06,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:32:06,863 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:32:06,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:32:06,864 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:32:06,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:32:06,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:32:06,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:32:06,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:32:06,865 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:32:06,866 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:32:06,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:32:06,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:32:06,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:32:06,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:06,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:32:06,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:32:06,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:32:06,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:32:06,868 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:32:06,869 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:32:06,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:32:06,869 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:32:06,869 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 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:32:07,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:32:07,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:32:07,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:32:07,191 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:32:07,191 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:32:07,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-29 20:32:08,407 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:32:08,677 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:32:08,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-29 20:32:08,692 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ede44270/0d30bffcdd56433b982af71552ae5543/FLAGeb443ffd8 [2023-08-29 20:32:08,708 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ede44270/0d30bffcdd56433b982af71552ae5543 [2023-08-29 20:32:08,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:32:08,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:32:08,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:08,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:32:08,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:32:08,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:08" (1/1) ... [2023-08-29 20:32:08,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560e66d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:08, skipping insertion in model container [2023-08-29 20:32:08,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:08" (1/1) ... [2023-08-29 20:32:08,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:32:08,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:32:08,937 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/rfi004.i[983,996] [2023-08-29 20:32:09,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:09,165 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:32:09,177 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/rfi004.i[983,996] [2023-08-29 20:32:09,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:09,281 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:09,281 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:09,304 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:32:09,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09 WrapperNode [2023-08-29 20:32:09,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:09,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:09,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:32:09,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:32:09,312 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:32:09" (1/1) ... [2023-08-29 20:32:09,342 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:32:09" (1/1) ... [2023-08-29 20:32:09,377 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2023-08-29 20:32:09,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:09,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:32:09,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:32:09,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:32:09,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,426 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:32:09,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:32:09,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:32:09,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:32:09,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (1/1) ... [2023-08-29 20:32:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:32:09,478 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:32:09,505 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:32:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:32:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:32:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:32:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:32:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:32:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:32:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:32:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:32:09,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:32:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:32:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:32:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:32:09,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:32:09,521 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:32:09,638 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:32:09,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:32:09,929 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:32:10,054 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:32:10,055 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:32:10,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:10 BoogieIcfgContainer [2023-08-29 20:32:10,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:32:10,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:32:10,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:32:10,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:32:10,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:32:08" (1/3) ... [2023-08-29 20:32:10,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e2a8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:10, skipping insertion in model container [2023-08-29 20:32:10,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:09" (2/3) ... [2023-08-29 20:32:10,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e2a8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:10, skipping insertion in model container [2023-08-29 20:32:10,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:10" (3/3) ... [2023-08-29 20:32:10,069 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2023-08-29 20:32:10,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:32:10,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:32:10,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:32:10,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:32:10,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:32:10,238 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:32:10,239 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:10,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:32:10,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:32:10,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2023-08-29 20:32:10,256 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:32:10,264 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:32:10,267 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:32:10,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 200 flow [2023-08-29 20:32:10,288 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:32:10,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:10,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:32:10,293 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-29 20:32:13,783 INFO L134 LiptonReduction]: Checked pairs total: 2941 [2023-08-29 20:32:13,784 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-29 20:32:13,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:32:13,801 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;@153bf244, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:32:13,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:32:13,803 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:32:13,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:13,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:13,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:32:13,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:13,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash 435, now seen corresponding path program 1 times [2023-08-29 20:32:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153530686] [2023-08-29 20:32:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:13,901 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:32:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153530686] [2023-08-29 20:32:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153530686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:32:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908791191] [2023-08-29 20:32:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:32:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:32:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:32:13,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 193 [2023-08-29 20:32:13,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:32:13,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:13,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 193 [2023-08-29 20:32:13,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:14,083 INFO L130 PetriNetUnfolder]: 287/500 cut-off events. [2023-08-29 20:32:14,084 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:32:14,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 500 events. 287/500 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2015 event pairs, 287 based on Foata normal form. 24/416 useless extension candidates. Maximal degree in co-relation 992. Up to 489 conditions per place. [2023-08-29 20:32:14,089 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-29 20:32:14,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-08-29 20:32:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:32:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:32:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-08-29 20:32:14,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233160621761658 [2023-08-29 20:32:14,101 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-08-29 20:32:14,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-08-29 20:32:14,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:14,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-08-29 20:32:14,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:32:14,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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:32:14,129 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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:32:14,131 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 202 transitions. [2023-08-29 20:32:14,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-08-29 20:32:14,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:14,135 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-29 20:32:14,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-29 20:32:14,139 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:32:14,140 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-29 20:32:14,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:32:14,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:14,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:32:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:32:14,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:14,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 412238597, now seen corresponding path program 1 times [2023-08-29 20:32:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059994852] [2023-08-29 20:32:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:14,449 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:32:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059994852] [2023-08-29 20:32:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059994852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:14,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398880508] [2023-08-29 20:32:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:14,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 193 [2023-08-29 20:32:14,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:32:14,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:14,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 193 [2023-08-29 20:32:14,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:14,546 INFO L130 PetriNetUnfolder]: 235/436 cut-off events. [2023-08-29 20:32:14,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:14,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 436 events. 235/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1857 event pairs, 27 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 850. Up to 337 conditions per place. [2023-08-29 20:32:14,549 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 22 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-29 20:32:14,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 118 flow [2023-08-29 20:32:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-29 20:32:14,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060449050086355 [2023-08-29 20:32:14,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-29 20:32:14,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-29 20:32:14,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:14,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-29 20:32:14,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:32:14,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:32:14,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:32:14,556 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 293 transitions. [2023-08-29 20:32:14,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 118 flow [2023-08-29 20:32:14,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:32:14,558 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2023-08-29 20:32:14,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-08-29 20:32:14,558 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:32:14,559 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 42 flow [2023-08-29 20:32:14,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:32:14,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:14,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:32:14,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:14,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1690946211, now seen corresponding path program 1 times [2023-08-29 20:32:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78993280] [2023-08-29 20:32:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:14,877 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:32:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78993280] [2023-08-29 20:32:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78993280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:14,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816349633] [2023-08-29 20:32:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:14,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:14,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 193 [2023-08-29 20:32:14,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:32:14,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:14,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 193 [2023-08-29 20:32:14,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:15,051 INFO L130 PetriNetUnfolder]: 142/271 cut-off events. [2023-08-29 20:32:15,051 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:32:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 271 events. 142/271 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 975 event pairs, 16 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 553. Up to 153 conditions per place. [2023-08-29 20:32:15,055 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-29 20:32:15,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 110 flow [2023-08-29 20:32:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-08-29 20:32:15,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42694300518134715 [2023-08-29 20:32:15,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-08-29 20:32:15,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-08-29 20:32:15,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:15,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-08-29 20:32:15,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:15,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,065 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 42 flow. Second operand 5 states and 412 transitions. [2023-08-29 20:32:15,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 110 flow [2023-08-29 20:32:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:15,067 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 42 flow [2023-08-29 20:32:15,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2023-08-29 20:32:15,068 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:32:15,071 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 42 flow [2023-08-29 20:32:15,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:32:15,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:15,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:15,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:32:15,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:15,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1690946179, now seen corresponding path program 1 times [2023-08-29 20:32:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480832592] [2023-08-29 20:32:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:15,265 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:32:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480832592] [2023-08-29 20:32:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480832592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:15,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:32:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601572748] [2023-08-29 20:32:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:15,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:15,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:15,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193 [2023-08-29 20:32:15,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 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:32:15,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:15,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193 [2023-08-29 20:32:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:15,392 INFO L130 PetriNetUnfolder]: 175/320 cut-off events. [2023-08-29 20:32:15,392 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 20:32:15,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 320 events. 175/320 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1150 event pairs, 67 based on Foata normal form. 24/344 useless extension candidates. Maximal degree in co-relation 675. Up to 251 conditions per place. [2023-08-29 20:32:15,394 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 21 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-08-29 20:32:15,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 37 transitions, 168 flow [2023-08-29 20:32:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-08-29 20:32:15,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47046632124352333 [2023-08-29 20:32:15,398 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-08-29 20:32:15,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-08-29 20:32:15,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:15,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-08-29 20:32:15,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:32:15,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,402 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 42 flow. Second operand 5 states and 454 transitions. [2023-08-29 20:32:15,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 37 transitions, 168 flow [2023-08-29 20:32:15,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:15,404 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 65 flow [2023-08-29 20:32:15,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-08-29 20:32:15,405 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-29 20:32:15,405 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 65 flow [2023-08-29 20:32:15,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 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:32:15,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:15,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:32:15,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:15,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1329239564, now seen corresponding path program 1 times [2023-08-29 20:32:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363438289] [2023-08-29 20:32:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:15,603 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:32:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363438289] [2023-08-29 20:32:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363438289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772143801] [2023-08-29 20:32:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:15,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:15,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193 [2023-08-29 20:32:15,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:15,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:15,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193 [2023-08-29 20:32:15,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:15,719 INFO L130 PetriNetUnfolder]: 153/278 cut-off events. [2023-08-29 20:32:15,719 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-08-29 20:32:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 278 events. 153/278 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 900 event pairs, 53 based on Foata normal form. 12/290 useless extension candidates. Maximal degree in co-relation 717. Up to 197 conditions per place. [2023-08-29 20:32:15,721 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 19 selfloop transitions, 3 changer transitions 8/30 dead transitions. [2023-08-29 20:32:15,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 156 flow [2023-08-29 20:32:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2023-08-29 20:32:15,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46217616580310883 [2023-08-29 20:32:15,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2023-08-29 20:32:15,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2023-08-29 20:32:15,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:15,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2023-08-29 20:32:15,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 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:32:15,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:15,729 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 65 flow. Second operand 5 states and 446 transitions. [2023-08-29 20:32:15,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 156 flow [2023-08-29 20:32:15,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 147 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:15,733 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 73 flow [2023-08-29 20:32:15,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-29 20:32:15,735 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-29 20:32:15,736 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 73 flow [2023-08-29 20:32:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:15,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:15,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:32:15,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:15,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -467374195, now seen corresponding path program 1 times [2023-08-29 20:32:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429466244] [2023-08-29 20:32:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:15,956 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:32:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429466244] [2023-08-29 20:32:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429466244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:32:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555853514] [2023-08-29 20:32:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:15,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:15,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:15,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:15,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-08-29 20:32:15,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:32:15,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:15,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-08-29 20:32:15,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:16,019 INFO L130 PetriNetUnfolder]: 42/102 cut-off events. [2023-08-29 20:32:16,020 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 20:32:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 102 events. 42/102 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 273 event pairs, 12 based on Foata normal form. 12/114 useless extension candidates. Maximal degree in co-relation 285. Up to 71 conditions per place. [2023-08-29 20:32:16,021 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 23 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-08-29 20:32:16,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 155 flow [2023-08-29 20:32:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-29 20:32:16,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48877374784110533 [2023-08-29 20:32:16,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-29 20:32:16,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-29 20:32:16,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:16,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-29 20:32:16,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:32:16,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:32:16,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:32:16,026 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 73 flow. Second operand 3 states and 283 transitions. [2023-08-29 20:32:16,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 155 flow [2023-08-29 20:32:16,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 143 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:32:16,028 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2023-08-29 20:32:16,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-29 20:32:16,029 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-29 20:32:16,029 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2023-08-29 20:32:16,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:32:16,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:16,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:16,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:32:16,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:16,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 19558005, now seen corresponding path program 1 times [2023-08-29 20:32:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949484842] [2023-08-29 20:32:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:16,271 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:32:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949484842] [2023-08-29 20:32:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949484842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:16,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995308999] [2023-08-29 20:32:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:16,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-08-29 20:32:16,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:32:16,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:16,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-08-29 20:32:16,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:16,328 INFO L130 PetriNetUnfolder]: 18/54 cut-off events. [2023-08-29 20:32:16,329 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:32:16,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 54 events. 18/54 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 8 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 163. Up to 29 conditions per place. [2023-08-29 20:32:16,330 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-29 20:32:16,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 158 flow [2023-08-29 20:32:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-08-29 20:32:16,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47797927461139894 [2023-08-29 20:32:16,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-08-29 20:32:16,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-08-29 20:32:16,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:16,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-08-29 20:32:16,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:16,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states 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:32:16,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states 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:32:16,335 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 4 states and 369 transitions. [2023-08-29 20:32:16,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 158 flow [2023-08-29 20:32:16,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 141 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:16,337 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 84 flow [2023-08-29 20:32:16,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-29 20:32:16,337 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-29 20:32:16,338 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 84 flow [2023-08-29 20:32:16,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:32:16,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:16,338 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:32:16,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:32:16,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:16,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1063409861, now seen corresponding path program 1 times [2023-08-29 20:32:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923764923] [2023-08-29 20:32:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:16,601 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:32:16,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923764923] [2023-08-29 20:32:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923764923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:16,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:16,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910440148] [2023-08-29 20:32:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:16,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:16,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 193 [2023-08-29 20:32:16,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:16,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:16,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 193 [2023-08-29 20:32:16,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:16,708 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2023-08-29 20:32:16,708 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-29 20:32:16,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 73 events. 24/73 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 186 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 222. Up to 42 conditions per place. [2023-08-29 20:32:16,709 INFO L137 encePairwiseOnDemand]: 186/193 looper letters, 22 selfloop transitions, 7 changer transitions 11/40 dead transitions. [2023-08-29 20:32:16,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 242 flow [2023-08-29 20:32:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:32:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:32:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2023-08-29 20:32:16,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45077720207253885 [2023-08-29 20:32:16,711 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 522 transitions. [2023-08-29 20:32:16,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 522 transitions. [2023-08-29 20:32:16,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:16,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 522 transitions. [2023-08-29 20:32:16,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.0) internal successors, (522), 6 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:32:16,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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:32:16,715 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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:32:16,715 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 84 flow. Second operand 6 states and 522 transitions. [2023-08-29 20:32:16,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 242 flow [2023-08-29 20:32:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 223 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:16,717 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 108 flow [2023-08-29 20:32:16,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-29 20:32:16,718 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-29 20:32:16,718 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 108 flow [2023-08-29 20:32:16,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:16,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:16,718 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:32:16,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:32:16,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:16,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1534782195, now seen corresponding path program 2 times [2023-08-29 20:32:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395289222] [2023-08-29 20:32:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:16,966 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:32:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395289222] [2023-08-29 20:32:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395289222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820484181] [2023-08-29 20:32:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:16,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:16,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 193 [2023-08-29 20:32:16,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:16,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:16,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 193 [2023-08-29 20:32:16,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:17,066 INFO L130 PetriNetUnfolder]: 17/66 cut-off events. [2023-08-29 20:32:17,066 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-29 20:32:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 66 events. 17/66 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 178 event pairs, 3 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 221. Up to 30 conditions per place. [2023-08-29 20:32:17,067 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 19 selfloop transitions, 1 changer transitions 15/35 dead transitions. [2023-08-29 20:32:17,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 228 flow [2023-08-29 20:32:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2023-08-29 20:32:17,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46735751295336786 [2023-08-29 20:32:17,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 451 transitions. [2023-08-29 20:32:17,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 451 transitions. [2023-08-29 20:32:17,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:17,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 451 transitions. [2023-08-29 20:32:17,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:32:17,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:17,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:32:17,073 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 108 flow. Second operand 5 states and 451 transitions. [2023-08-29 20:32:17,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 228 flow [2023-08-29 20:32:17,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 223 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:17,075 INFO L231 Difference]: Finished difference. Result has 40 places, 18 transitions, 82 flow [2023-08-29 20:32:17,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2023-08-29 20:32:17,075 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-29 20:32:17,076 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 18 transitions, 82 flow [2023-08-29 20:32:17,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:17,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:17,076 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:32:17,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:32:17,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:17,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 151234547, now seen corresponding path program 3 times [2023-08-29 20:32:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286047403] [2023-08-29 20:32:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:17,839 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:32:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:32:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286047403] [2023-08-29 20:32:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286047403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:32:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697540709] [2023-08-29 20:32:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:17,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:32:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:32:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:32:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:32:17,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 193 [2023-08-29 20:32:17,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 18 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 77.28571428571429) internal successors, (541), 7 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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:32:17,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:17,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 193 [2023-08-29 20:32:17,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:18,223 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2023-08-29 20:32:18,223 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-08-29 20:32:18,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 38 events. 6/38 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 131. Up to 13 conditions per place. [2023-08-29 20:32:18,223 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 14 selfloop transitions, 5 changer transitions 9/28 dead transitions. [2023-08-29 20:32:18,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 191 flow [2023-08-29 20:32:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:32:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:32:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 700 transitions. [2023-08-29 20:32:18,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4029936672423719 [2023-08-29 20:32:18,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 700 transitions. [2023-08-29 20:32:18,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 700 transitions. [2023-08-29 20:32:18,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:18,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 700 transitions. [2023-08-29 20:32:18,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.77777777777777) internal successors, (700), 9 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:32:18,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states 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:32:18,231 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states 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:32:18,231 INFO L175 Difference]: Start difference. First operand has 40 places, 18 transitions, 82 flow. Second operand 9 states and 700 transitions. [2023-08-29 20:32:18,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 191 flow [2023-08-29 20:32:18,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 167 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-29 20:32:18,232 INFO L231 Difference]: Finished difference. Result has 42 places, 18 transitions, 87 flow [2023-08-29 20:32:18,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=18} [2023-08-29 20:32:18,233 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-29 20:32:18,233 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 18 transitions, 87 flow [2023-08-29 20:32:18,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.28571428571429) internal successors, (541), 7 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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:32:18,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:18,233 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:32:18,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:32:18,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:18,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -208687045, now seen corresponding path program 4 times [2023-08-29 20:32:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:32:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605494413] [2023-08-29 20:32:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:32:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:18,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:32:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:18,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:32:18,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:32:18,321 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:32:18,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:32:18,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:32:18,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:32:18,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:32:18,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:32:18,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:32:18,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:32:18,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:32:18,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:32:18,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:32:18,328 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:18,333 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:32:18,333 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:32:18,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:32:18 BasicIcfg [2023-08-29 20:32:18,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:32:18,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:32:18,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:32:18,407 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:32:18,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:10" (3/4) ... [2023-08-29 20:32:18,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:32:18,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:32:18,410 INFO L158 Benchmark]: Toolchain (without parser) took 9698.90ms. Allocated memory was 81.8MB in the beginning and 205.5MB in the end (delta: 123.7MB). Free memory was 58.7MB in the beginning and 146.4MB in the end (delta: -87.6MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,410 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 62.9MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:18,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.25ms. Allocated memory is still 81.8MB. Free memory was 58.5MB in the beginning and 56.0MB in the end (delta: 2.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.89ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,411 INFO L158 Benchmark]: Boogie Preprocessor took 58.57ms. Allocated memory is still 81.8MB. Free memory was 53.5MB in the beginning and 51.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,411 INFO L158 Benchmark]: RCFGBuilder took 623.26ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 48.2MB in the end (delta: 3.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,412 INFO L158 Benchmark]: TraceAbstraction took 8343.42ms. Allocated memory was 81.8MB in the beginning and 205.5MB in the end (delta: 123.7MB). Free memory was 47.3MB in the beginning and 146.4MB in the end (delta: -99.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-29 20:32:18,412 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 205.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:18,413 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.42ms. Allocated memory is still 62.9MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.25ms. Allocated memory is still 81.8MB. Free memory was 58.5MB in the beginning and 56.0MB in the end (delta: 2.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.89ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.57ms. Allocated memory is still 81.8MB. Free memory was 53.5MB in the beginning and 51.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.26ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 48.2MB in the end (delta: 3.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8343.42ms. Allocated memory was 81.8MB in the beginning and 205.5MB in the end (delta: 123.7MB). Free memory was 47.3MB in the beginning and 146.4MB in the end (delta: -99.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 205.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 102 PlacesBefore, 31 PlacesAfterwards, 97 TransitionsBefore, 25 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 2941 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1532, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 632, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1532, independent: 782, independent conditional: 0, independent unconditional: 782, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 632, unknown conditional: 0, unknown unconditional: 632] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [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; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={5:0}, t1650={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] 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) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 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 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3: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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 118 locations, 10 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 779 IncrementalHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 16 mSDtfsCounter, 779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:32:18,452 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/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --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:32:20,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:32:20,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:32:20,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:32:20,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:32:20,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:32:20,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:32:20,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:32:20,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:32:20,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:32:20,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:32:20,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:32:20,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:32:20,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:32:20,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:32:20,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:32:20,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:32:20,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:32:20,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:32:20,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:32:20,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:32:20,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:32:20,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:32:20,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:32:20,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:32:20,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:32:20,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:32:20,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:32:20,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:32:20,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:32:20,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:32:20,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:32:20,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:32:20,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:32:20,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:32:20,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:32:20,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:32:20,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:32:20,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:32:20,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:32:20,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:32:20,483 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:32:20,506 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:32:20,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:32:20,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:32:20,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:32:20,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:32:20,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:32:20,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:32:20,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:32:20,511 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:32:20,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:32:20,511 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:32:20,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:32:20,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:32:20,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:32:20,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:32:20,512 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:32:20,513 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:32:20,513 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:32:20,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:32:20,513 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:32:20,513 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:32:20,514 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:32:20,514 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:32:20,514 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:32:20,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:32:20,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:32:20,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:32:20,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:20,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:32:20,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:32:20,515 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:32:20,516 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:32:20,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:32:20,516 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:32:20,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:32:20,516 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:32:20,517 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:32:20,517 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 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:32:20,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:32:20,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:32:20,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:32:20,822 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:32:20,822 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:32:20,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-29 20:32:21,910 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:32:22,206 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:32:22,206 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2023-08-29 20:32:22,217 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b415ee043/1bc974d41612433695ca13289114c232/FLAG3ee8070f9 [2023-08-29 20:32:22,232 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b415ee043/1bc974d41612433695ca13289114c232 [2023-08-29 20:32:22,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:32:22,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:32:22,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:22,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:32:22,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:32:22,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5686dc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22, skipping insertion in model container [2023-08-29 20:32:22,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:32:22,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:32:22,470 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/rfi004.i[983,996] [2023-08-29 20:32:22,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:22,687 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:32:22,699 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/rfi004.i[983,996] [2023-08-29 20:32:22,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:32:22,782 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:22,782 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:32:22,788 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:32:22,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22 WrapperNode [2023-08-29 20:32:22,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:32:22,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:22,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:32:22,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:32:22,796 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:32:22" (1/1) ... [2023-08-29 20:32:22,817 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:32:22" (1/1) ... [2023-08-29 20:32:22,843 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2023-08-29 20:32:22,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:32:22,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:32:22,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:32:22,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:32:22,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,868 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:32:22,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:32:22,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:32:22,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:32:22,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (1/1) ... [2023-08-29 20:32:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:32:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:32:22,910 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:32:22,924 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:32:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:32:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:32:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:32:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:32:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:32:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:32:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:32:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:32:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:32:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:32:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:32:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:32:22,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:32:22,955 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:32:23,096 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:32:23,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:32:23,370 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:32:23,499 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:32:23,507 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:32:23,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:23 BoogieIcfgContainer [2023-08-29 20:32:23,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:32:23,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:32:23,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:32:23,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:32:23,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:32:22" (1/3) ... [2023-08-29 20:32:23,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26490e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:23, skipping insertion in model container [2023-08-29 20:32:23,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:32:22" (2/3) ... [2023-08-29 20:32:23,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26490e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:32:23, skipping insertion in model container [2023-08-29 20:32:23,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:23" (3/3) ... [2023-08-29 20:32:23,517 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2023-08-29 20:32:23,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:32:23,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:32:23,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:32:23,607 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:32:23,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 210 flow [2023-08-29 20:32:23,703 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-29 20:32:23,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:23,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:32:23,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 210 flow [2023-08-29 20:32:23,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 202 flow [2023-08-29 20:32:23,714 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:32:23,728 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-29 20:32:23,731 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-29 20:32:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 202 flow [2023-08-29 20:32:23,766 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-29 20:32:23,766 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:23,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:32:23,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-29 20:32:28,879 INFO L134 LiptonReduction]: Checked pairs total: 2735 [2023-08-29 20:32:28,880 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-29 20:32:28,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:32:28,896 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;@188b5d64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:32:28,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:32:28,899 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:32:28,899 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:28,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:28,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:32:28,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:28,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash 441, now seen corresponding path program 1 times [2023-08-29 20:32:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:28,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751280732] [2023-08-29 20:32:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:32:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:28,919 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:32:28,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:32:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:28,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:32:28,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:28,987 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:32:28,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:28,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751280732] [2023-08-29 20:32:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751280732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:28,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:32:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670889468] [2023-08-29 20:32:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:28,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:32:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:32:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:32:29,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 197 [2023-08-29 20:32:29,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:32:29,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:29,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 197 [2023-08-29 20:32:29,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:29,234 INFO L130 PetriNetUnfolder]: 287/504 cut-off events. [2023-08-29 20:32:29,234 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:32:29,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 504 events. 287/504 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2051 event pairs, 287 based on Foata normal form. 24/420 useless extension candidates. Maximal degree in co-relation 996. Up to 489 conditions per place. [2023-08-29 20:32:29,246 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-29 20:32:29,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-08-29 20:32:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:32:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:32:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2023-08-29 20:32:29,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177664974619289 [2023-08-29 20:32:29,264 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 204 transitions. [2023-08-29 20:32:29,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 204 transitions. [2023-08-29 20:32:29,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:29,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 204 transitions. [2023-08-29 20:32:29,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:32:29,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:32:29,279 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:32:29,281 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 204 transitions. [2023-08-29 20:32:29,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-08-29 20:32:29,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:29,285 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-29 20:32:29,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-29 20:32:29,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:32:29,293 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-29 20:32:29,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:32:29,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:29,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:32:29,309 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:32:29,505 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:32:29,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:29,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 415999053, now seen corresponding path program 1 times [2023-08-29 20:32:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055785689] [2023-08-29 20:32:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:29,508 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:32:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:29,513 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:32:29,516 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:32:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:29,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:29,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:29,634 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:32:29,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:29,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055785689] [2023-08-29 20:32:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055785689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:29,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:29,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:32:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641989711] [2023-08-29 20:32:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:29,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:29,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 197 [2023-08-29 20:32:29,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:32:29,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:29,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 197 [2023-08-29 20:32:29,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:29,789 INFO L130 PetriNetUnfolder]: 235/436 cut-off events. [2023-08-29 20:32:29,790 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:29,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 436 events. 235/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1824 event pairs, 27 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 850. Up to 337 conditions per place. [2023-08-29 20:32:29,792 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 22 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-29 20:32:29,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 118 flow [2023-08-29 20:32:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-29 20:32:29,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008460236886633 [2023-08-29 20:32:29,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-29 20:32:29,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-29 20:32:29,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:29,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-29 20:32:29,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:32:29,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:29,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:29,808 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 296 transitions. [2023-08-29 20:32:29,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 118 flow [2023-08-29 20:32:29,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:32:29,809 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2023-08-29 20:32:29,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-08-29 20:32:29,810 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:32:29,810 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 42 flow [2023-08-29 20:32:29,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:32:29,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:29,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:29,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-29 20:32:30,020 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:32:30,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:30,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2049454791, now seen corresponding path program 1 times [2023-08-29 20:32:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333778017] [2023-08-29 20:32:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:30,023 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:32:30,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:30,024 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:32:30,057 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:32:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:30,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:30,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:30,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:30,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333778017] [2023-08-29 20:32:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333778017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:32:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319494616] [2023-08-29 20:32:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:30,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:32:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:32:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:32:30,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-29 20:32:30,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:32:30,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:30,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-29 20:32:30,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:30,249 INFO L130 PetriNetUnfolder]: 53/125 cut-off events. [2023-08-29 20:32:30,249 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 20:32:30,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 125 events. 53/125 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 366 event pairs, 15 based on Foata normal form. 12/129 useless extension candidates. Maximal degree in co-relation 267. Up to 94 conditions per place. [2023-08-29 20:32:30,251 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-29 20:32:30,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 114 flow [2023-08-29 20:32:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-29 20:32:30,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4856175972927242 [2023-08-29 20:32:30,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-29 20:32:30,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-29 20:32:30,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:30,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-29 20:32:30,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:32:30,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:30,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:32:30,276 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 42 flow. Second operand 3 states and 287 transitions. [2023-08-29 20:32:30,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 114 flow [2023-08-29 20:32:30,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:30,277 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 57 flow [2023-08-29 20:32:30,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-29 20:32:30,278 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:32:30,278 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 57 flow [2023-08-29 20:32:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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:32:30,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:30,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:30,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:30,488 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:32:30,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:30,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1346681834, now seen corresponding path program 1 times [2023-08-29 20:32:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459400350] [2023-08-29 20:32:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:30,490 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:32:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:30,491 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:32:30,493 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:32:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:30,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:32:30,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:30,625 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:32:30,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:30,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459400350] [2023-08-29 20:32:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459400350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922822756] [2023-08-29 20:32:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:30,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-29 20:32:30,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:32:30,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:30,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-29 20:32:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:30,726 INFO L130 PetriNetUnfolder]: 18/55 cut-off events. [2023-08-29 20:32:30,726 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:32:30,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 55 events. 18/55 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 10 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 139. Up to 29 conditions per place. [2023-08-29 20:32:30,729 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 20 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-29 20:32:30,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 123 flow [2023-08-29 20:32:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-29 20:32:30,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746192893401015 [2023-08-29 20:32:30,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-29 20:32:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-29 20:32:30,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:30,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-29 20:32:30,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:32:30,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states 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:32:30,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states 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:32:30,734 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 57 flow. Second operand 4 states and 374 transitions. [2023-08-29 20:32:30,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 123 flow [2023-08-29 20:32:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:32:30,736 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 70 flow [2023-08-29 20:32:30,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-08-29 20:32:30,738 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-29 20:32:30,738 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 70 flow [2023-08-29 20:32:30,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:32:30,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:30,738 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:32:30,755 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:32:30,955 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:32:30,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:30,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash -808770149, now seen corresponding path program 1 times [2023-08-29 20:32:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713033586] [2023-08-29 20:32:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:30,957 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:32:30,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:30,958 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:32:30,959 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:32:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:31,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:32:31,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:31,276 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:32:31,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:31,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713033586] [2023-08-29 20:32:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713033586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:32:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578334699] [2023-08-29 20:32:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:31,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:31,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-29 20:32:31,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:32:31,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:31,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-29 20:32:31,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:31,460 INFO L130 PetriNetUnfolder]: 18/55 cut-off events. [2023-08-29 20:32:31,460 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 20:32:31,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 55 events. 18/55 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 144. Up to 46 conditions per place. [2023-08-29 20:32:31,461 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-29 20:32:31,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 119 flow [2023-08-29 20:32:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2023-08-29 20:32:31,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4200507614213198 [2023-08-29 20:32:31,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 331 transitions. [2023-08-29 20:32:31,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions. [2023-08-29 20:32:31,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:31,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions. [2023-08-29 20:32:31,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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:32:31,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states 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:32:31,466 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states 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:32:31,466 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 70 flow. Second operand 4 states and 331 transitions. [2023-08-29 20:32:31,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 119 flow [2023-08-29 20:32:31,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 108 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:31,467 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 62 flow [2023-08-29 20:32:31,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-29 20:32:31,468 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-29 20:32:31,468 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 62 flow [2023-08-29 20:32:31,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:32:31,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:31,469 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:32:31,483 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:32:31,679 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:32:31,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:31,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 799102733, now seen corresponding path program 1 times [2023-08-29 20:32:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260063437] [2023-08-29 20:32:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:31,680 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:32:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:31,681 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:32:31,682 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:32:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:31,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:32:31,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:31,806 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:32:31,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:31,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260063437] [2023-08-29 20:32:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260063437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264641858] [2023-08-29 20:32:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:31,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-29 20:32:31,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:32:31,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:31,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-29 20:32:31,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:31,962 INFO L130 PetriNetUnfolder]: 24/73 cut-off events. [2023-08-29 20:32:31,962 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 20:32:31,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 73 events. 24/73 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 197 event pairs, 0 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 198. Up to 46 conditions per place. [2023-08-29 20:32:31,963 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 19 selfloop transitions, 1 changer transitions 14/34 dead transitions. [2023-08-29 20:32:31,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 186 flow [2023-08-29 20:32:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2023-08-29 20:32:31,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46294416243654823 [2023-08-29 20:32:31,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 456 transitions. [2023-08-29 20:32:31,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 456 transitions. [2023-08-29 20:32:31,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:31,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 456 transitions. [2023-08-29 20:32:31,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:32:31,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states 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:32:31,969 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states 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:32:31,969 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 62 flow. Second operand 5 states and 456 transitions. [2023-08-29 20:32:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 186 flow [2023-08-29 20:32:31,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:31,970 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 68 flow [2023-08-29 20:32:31,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2023-08-29 20:32:31,971 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-29 20:32:31,971 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 68 flow [2023-08-29 20:32:31,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:32:31,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:31,972 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:32:31,983 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:32:32,172 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:32:32,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:32,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1952542607, now seen corresponding path program 2 times [2023-08-29 20:32:32,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:32,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347999414] [2023-08-29 20:32:32,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:32:32,174 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:32:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:32,175 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:32:32,176 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:32:32,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:32:32,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:32:32,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 20:32:32,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:32,392 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:32:32,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:32,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347999414] [2023-08-29 20:32:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347999414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:32:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497168224] [2023-08-29 20:32:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:32,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:32:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:32:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:32:32,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-29 20:32:32,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:32:32,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:32,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-29 20:32:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:32,568 INFO L130 PetriNetUnfolder]: 18/62 cut-off events. [2023-08-29 20:32:32,568 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-08-29 20:32:32,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 62 events. 18/62 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 6 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 182. Up to 22 conditions per place. [2023-08-29 20:32:32,569 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 14 selfloop transitions, 4 changer transitions 12/31 dead transitions. [2023-08-29 20:32:32,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 186 flow [2023-08-29 20:32:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:32:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:32:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 691 transitions. [2023-08-29 20:32:32,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4384517766497462 [2023-08-29 20:32:32,571 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 691 transitions. [2023-08-29 20:32:32,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 691 transitions. [2023-08-29 20:32:32,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:32,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 691 transitions. [2023-08-29 20:32:32,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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:32:32,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states 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:32:32,575 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states 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:32:32,575 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 68 flow. Second operand 8 states and 691 transitions. [2023-08-29 20:32:32,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 186 flow [2023-08-29 20:32:32,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 177 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:32,577 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 79 flow [2023-08-29 20:32:32,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=79, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2023-08-29 20:32:32,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-29 20:32:32,578 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 79 flow [2023-08-29 20:32:32,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:32:32,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:32,578 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:32:32,592 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:32:32,789 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:32:32,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:32:32,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash 847918517, now seen corresponding path program 3 times [2023-08-29 20:32:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484762992] [2023-08-29 20:32:32,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:32:32,790 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:32:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:32,791 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:32:32,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:32:32,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:32:32,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:32:32,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:32:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:32,975 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:32:32,975 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:32:32,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:32:32,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:32:32,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:32:32,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:32:32,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:32:32,992 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:32:33,179 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:32:33,180 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:32:33,184 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:32:33,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:32:33,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:32:33 BasicIcfg [2023-08-29 20:32:33,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:32:33,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:32:33,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:32:33,238 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:32:33,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:32:23" (3/4) ... [2023-08-29 20:32:33,246 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:32:33,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:32:33,247 INFO L158 Benchmark]: Toolchain (without parser) took 11011.43ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 51.6MB in the beginning and 53.3MB in the end (delta: -1.7MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,247 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:33,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.05ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.0MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 45.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,248 INFO L158 Benchmark]: Boogie Preprocessor took 26.72ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 43.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,248 INFO L158 Benchmark]: RCFGBuilder took 636.39ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 32.3MB in the end (delta: 11.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,249 INFO L158 Benchmark]: TraceAbstraction took 9724.93ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 31.5MB in the beginning and 53.3MB in the end (delta: -21.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2023-08-29 20:32:33,251 INFO L158 Benchmark]: Witness Printer took 8.66ms. Allocated memory is still 111.1MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:33,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.05ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.0MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 45.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.72ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 43.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.39ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 32.3MB in the end (delta: 11.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9724.93ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 31.5MB in the beginning and 53.3MB in the end (delta: -21.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 8.66ms. Allocated memory is still 111.1MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 103 PlacesBefore, 31 PlacesAfterwards, 98 TransitionsBefore, 25 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 2735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1410, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 631, independent: 610, independent conditional: 0, independent unconditional: 610, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1410, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 631, unknown conditional: 0, unknown unconditional: 631] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [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; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={3:0}, t1650={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] 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) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 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 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={3:0}, t1650={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 119 locations, 10 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: 9.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 42 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 13 QuantifiedInterpolants, 532 SizeOfPredicates, 5 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:32:33,277 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