./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:20:07,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:20:07,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:20:07,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:20:07,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:20:07,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:20:07,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:20:07,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:20:07,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:20:07,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:20:07,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:20:07,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:20:07,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:20:07,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:20:07,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:20:07,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:20:07,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:20:07,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:20:07,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:20:07,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:20:07,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:20:07,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:20:07,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:20:07,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:20:07,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:20:07,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:20:07,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:20:07,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:20:07,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:20:07,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:20:07,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:20:07,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:20:07,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:20:07,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:20:07,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:20:07,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:20:07,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:20:07,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:20:07,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:20:07,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:20:07,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:20:07,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:20:07,936 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:20:07,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:20:07,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:20:07,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:20:07,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:20:07,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:20:07,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:20:07,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:20:07,939 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:20:07,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:20:07,939 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:20:07,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:20:07,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:20:07,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:20:07,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:20:07,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:20:07,943 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:20:07,943 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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:20:08,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:20:08,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:20:08,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:20:08,176 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:20:08,176 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:20:08,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-31 23:20:09,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:20:09,323 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:20:09,323 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-31 23:20:09,333 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f78f394/2f2eefdb878842d79067f8e42601ea30/FLAGf72727ea0 [2023-08-31 23:20:09,343 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f78f394/2f2eefdb878842d79067f8e42601ea30 [2023-08-31 23:20:09,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:20:09,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:20:09,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:20:09,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:20:09,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:20:09,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d98ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09, skipping insertion in model container [2023-08-31 23:20:09,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:20:09,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:20:09,498 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/mix039.oepc.i[945,958] [2023-08-31 23:20:09,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:20:09,690 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:20:09,702 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/mix039.oepc.i[945,958] [2023-08-31 23:20:09,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:20:09,781 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:20:09,782 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:20:09,787 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:20:09,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09 WrapperNode [2023-08-31 23:20:09,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:20:09,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:20:09,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:20:09,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:20:09,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,851 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:20:09,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:20:09,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:20:09,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:20:09,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:20:09,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:20:09,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:20:09,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:20:09,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:20:09,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (1/1) ... [2023-08-31 23:20:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:20:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:20:09,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:20:09,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:20:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:20:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:20:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:20:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:20:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:20:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:20:09,954 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:20:10,060 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:20:10,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:20:10,404 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:20:10,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:20:10,475 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:20:10,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:10 BoogieIcfgContainer [2023-08-31 23:20:10,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:20:10,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:20:10,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:20:10,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:20:10,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:20:09" (1/3) ... [2023-08-31 23:20:10,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b08be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:20:10, skipping insertion in model container [2023-08-31 23:20:10,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:09" (2/3) ... [2023-08-31 23:20:10,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b08be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:20:10, skipping insertion in model container [2023-08-31 23:20:10,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:10" (3/3) ... [2023-08-31 23:20:10,486 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-08-31 23:20:10,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:20:10,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:20:10,496 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:20:10,531 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:20:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:20:10,590 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:20:10,590 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:10,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:20:10,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:20:10,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-31 23:20:10,599 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:20:10,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:20:10,610 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:20:10,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-31 23:20:10,628 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:20:10,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:20:10,630 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-31 23:20:14,296 INFO L134 LiptonReduction]: Checked pairs total: 10048 [2023-08-31 23:20:14,296 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-31 23:20:14,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:20:14,313 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;@280ad39c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:20:14,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:20:14,320 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:20:14,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:14,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:14,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:20:14,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:14,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-31 23:20:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136861005] [2023-08-31 23:20:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:14,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136861005] [2023-08-31 23:20:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136861005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:14,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:14,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:20:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297522730] [2023-08-31 23:20:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:14,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:20:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:20:14,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:20:14,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-31 23:20:14,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:14,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:14,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-31 23:20:14,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:15,357 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-31 23:20:15,357 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:20:15,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52520 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-31 23:20:15,410 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:20:15,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-31 23:20:15,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:20:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:20:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:20:15,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-31 23:20:15,425 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:20:15,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:20:15,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:15,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:20:15,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:15,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:15,435 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:15,437 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:20:15,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-31 23:20:15,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:15,442 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:20:15,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:20:15,460 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:20:15,461 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:20:15,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:15,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:15,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:20:15,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:20:15,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:15,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash 605298, now seen corresponding path program 1 times [2023-08-31 23:20:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332633118] [2023-08-31 23:20:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:15,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332633118] [2023-08-31 23:20:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332633118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:15,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:20:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386034552] [2023-08-31 23:20:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:15,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:20:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:15,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:20:15,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:20:15,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-31 23:20:15,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:15,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:15,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-31 23:20:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:16,332 INFO L130 PetriNetUnfolder]: 5879/8050 cut-off events. [2023-08-31 23:20:16,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:16,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16191 conditions, 8050 events. 5879/8050 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39630 event pairs, 3031 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 16188. Up to 6367 conditions per place. [2023-08-31 23:20:16,365 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-31 23:20:16,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-31 23:20:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:20:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:20:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-31 23:20:16,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123674911660777 [2023-08-31 23:20:16,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-31 23:20:16,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-31 23:20:16,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:16,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-31 23:20:16,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:16,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:16,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:16,373 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 435 transitions. [2023-08-31 23:20:16,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-31 23:20:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:20:16,375 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:20:16,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:20:16,376 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:20:16,376 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:20:16,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:16,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:16,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:20:16,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:16,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -587374610, now seen corresponding path program 1 times [2023-08-31 23:20:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537204212] [2023-08-31 23:20:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:16,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537204212] [2023-08-31 23:20:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537204212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:16,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:16,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:20:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789716080] [2023-08-31 23:20:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:16,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:20:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:16,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:20:16,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:20:16,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-31 23:20:16,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:16,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:16,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-31 23:20:16,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:18,380 INFO L130 PetriNetUnfolder]: 18905/25584 cut-off events. [2023-08-31 23:20:18,380 INFO L131 PetriNetUnfolder]: For 1301/1301 co-relation queries the response was YES. [2023-08-31 23:20:18,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52943 conditions, 25584 events. 18905/25584 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 136186 event pairs, 6836 based on Foata normal form. 0/24854 useless extension candidates. Maximal degree in co-relation 52939. Up to 16530 conditions per place. [2023-08-31 23:20:18,473 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-31 23:20:18,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2023-08-31 23:20:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:20:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:20:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:20:18,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48998822143698467 [2023-08-31 23:20:18,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:20:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:20:18,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:18,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:20:18,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:18,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:18,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:18,479 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:20:18,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2023-08-31 23:20:18,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:18,480 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-08-31 23:20:18,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-31 23:20:18,481 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-31 23:20:18,481 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-08-31 23:20:18,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:18,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:18,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:20:18,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:18,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -587374603, now seen corresponding path program 1 times [2023-08-31 23:20:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025461520] [2023-08-31 23:20:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:18,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:18,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025461520] [2023-08-31 23:20:18,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025461520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:18,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:18,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34359581] [2023-08-31 23:20:18,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:18,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:20:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:20:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:20:19,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-31 23:20:19,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:19,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:19,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-31 23:20:19,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:20,564 INFO L130 PetriNetUnfolder]: 12839/18060 cut-off events. [2023-08-31 23:20:20,564 INFO L131 PetriNetUnfolder]: For 5564/5631 co-relation queries the response was YES. [2023-08-31 23:20:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42684 conditions, 18060 events. 12839/18060 cut-off events. For 5564/5631 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 101537 event pairs, 2097 based on Foata normal form. 498/18369 useless extension candidates. Maximal degree in co-relation 42679. Up to 13127 conditions per place. [2023-08-31 23:20:20,636 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 55 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2023-08-31 23:20:20,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 324 flow [2023-08-31 23:20:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-31 23:20:20,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43286219081272087 [2023-08-31 23:20:20,638 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-31 23:20:20,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-31 23:20:20,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:20,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-31 23:20:20,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:20,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:20,643 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:20,643 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 6 states and 735 transitions. [2023-08-31 23:20:20,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 324 flow [2023-08-31 23:20:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:20,675 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 133 flow [2023-08-31 23:20:20,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-31 23:20:20,676 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:20:20,676 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 133 flow [2023-08-31 23:20:20,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:20,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:20,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:20,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:20:20,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:20,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1834465806, now seen corresponding path program 1 times [2023-08-31 23:20:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412866493] [2023-08-31 23:20:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412866493] [2023-08-31 23:20:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412866493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:21,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036509267] [2023-08-31 23:20:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:21,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:20:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:21,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:20:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:20:21,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 283 [2023-08-31 23:20:21,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:21,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:21,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 283 [2023-08-31 23:20:21,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:22,098 INFO L130 PetriNetUnfolder]: 9725/13780 cut-off events. [2023-08-31 23:20:22,099 INFO L131 PetriNetUnfolder]: For 3937/4202 co-relation queries the response was YES. [2023-08-31 23:20:22,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31311 conditions, 13780 events. 9725/13780 cut-off events. For 3937/4202 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 77864 event pairs, 3875 based on Foata normal form. 322/13634 useless extension candidates. Maximal degree in co-relation 31305. Up to 12724 conditions per place. [2023-08-31 23:20:22,147 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-31 23:20:22,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 253 flow [2023-08-31 23:20:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:20:22,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175500588928151 [2023-08-31 23:20:22,149 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:20:22,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:20:22,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:22,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:20:22,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:22,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:22,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:22,154 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 133 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:20:22,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 253 flow [2023-08-31 23:20:22,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 241 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:20:22,156 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 117 flow [2023-08-31 23:20:22,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-31 23:20:22,157 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-31 23:20:22,157 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 117 flow [2023-08-31 23:20:22,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:22,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:22,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:22,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:20:22,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:22,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1109423498, now seen corresponding path program 1 times [2023-08-31 23:20:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200455913] [2023-08-31 23:20:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200455913] [2023-08-31 23:20:22,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200455913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:22,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:22,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082695142] [2023-08-31 23:20:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:22,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:22,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-31 23:20:22,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:22,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:22,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-31 23:20:22,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:23,188 INFO L130 PetriNetUnfolder]: 8336/12323 cut-off events. [2023-08-31 23:20:23,188 INFO L131 PetriNetUnfolder]: For 2218/2460 co-relation queries the response was YES. [2023-08-31 23:20:23,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27661 conditions, 12323 events. 8336/12323 cut-off events. For 2218/2460 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 76444 event pairs, 1591 based on Foata normal form. 941/12890 useless extension candidates. Maximal degree in co-relation 27655. Up to 5261 conditions per place. [2023-08-31 23:20:23,221 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 57 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-31 23:20:23,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 346 flow [2023-08-31 23:20:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:20:23,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48674911660777387 [2023-08-31 23:20:23,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:20:23,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:20:23,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:23,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:20:23,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:23,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:23,226 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:23,226 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 117 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:20:23,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 346 flow [2023-08-31 23:20:23,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:23,228 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 156 flow [2023-08-31 23:20:23,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-31 23:20:23,229 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:20:23,229 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 156 flow [2023-08-31 23:20:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:23,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:23,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:20:23,230 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:23,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 980542762, now seen corresponding path program 1 times [2023-08-31 23:20:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:23,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817692068] [2023-08-31 23:20:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817692068] [2023-08-31 23:20:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817692068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:20:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058530824] [2023-08-31 23:20:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:23,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:23,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-31 23:20:23,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:23,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:23,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-31 23:20:23,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:24,358 INFO L130 PetriNetUnfolder]: 11390/16089 cut-off events. [2023-08-31 23:20:24,359 INFO L131 PetriNetUnfolder]: For 8600/8600 co-relation queries the response was YES. [2023-08-31 23:20:24,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46420 conditions, 16089 events. 11390/16089 cut-off events. For 8600/8600 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 88157 event pairs, 1721 based on Foata normal form. 16/16105 useless extension candidates. Maximal degree in co-relation 46412. Up to 10599 conditions per place. [2023-08-31 23:20:24,401 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 70 selfloop transitions, 11 changer transitions 3/84 dead transitions. [2023-08-31 23:20:24,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 498 flow [2023-08-31 23:20:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-31 23:20:24,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840989399293286 [2023-08-31 23:20:24,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-31 23:20:24,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-31 23:20:24,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:24,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-31 23:20:24,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:24,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:24,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:24,410 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 156 flow. Second operand 4 states and 548 transitions. [2023-08-31 23:20:24,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 498 flow [2023-08-31 23:20:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:20:24,414 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 214 flow [2023-08-31 23:20:24,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-31 23:20:24,415 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-31 23:20:24,415 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 214 flow [2023-08-31 23:20:24,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:24,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:24,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:24,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:20:24,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:24,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 518998510, now seen corresponding path program 1 times [2023-08-31 23:20:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553222373] [2023-08-31 23:20:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553222373] [2023-08-31 23:20:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553222373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:24,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182570343] [2023-08-31 23:20:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:24,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-31 23:20:24,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:24,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:24,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-31 23:20:24,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:25,781 INFO L130 PetriNetUnfolder]: 10544/15064 cut-off events. [2023-08-31 23:20:25,781 INFO L131 PetriNetUnfolder]: For 12952/12952 co-relation queries the response was YES. [2023-08-31 23:20:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46168 conditions, 15064 events. 10544/15064 cut-off events. For 12952/12952 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 82574 event pairs, 2947 based on Foata normal form. 204/15268 useless extension candidates. Maximal degree in co-relation 46158. Up to 8404 conditions per place. [2023-08-31 23:20:25,833 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 66 selfloop transitions, 9 changer transitions 1/76 dead transitions. [2023-08-31 23:20:25,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 485 flow [2023-08-31 23:20:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-31 23:20:25,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796819787985866 [2023-08-31 23:20:25,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-31 23:20:25,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-31 23:20:25,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:25,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-31 23:20:25,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:25,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:25,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:25,842 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 214 flow. Second operand 4 states and 543 transitions. [2023-08-31 23:20:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 485 flow [2023-08-31 23:20:25,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 471 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:20:25,862 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 232 flow [2023-08-31 23:20:25,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-31 23:20:25,864 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:20:25,864 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 232 flow [2023-08-31 23:20:25,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:25,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:25,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:25,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:20:25,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:25,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1445054118, now seen corresponding path program 1 times [2023-08-31 23:20:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120301260] [2023-08-31 23:20:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120301260] [2023-08-31 23:20:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120301260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011919582] [2023-08-31 23:20:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:26,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:20:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:20:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:20:26,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-31 23:20:26,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:26,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:26,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-31 23:20:26,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:27,756 INFO L130 PetriNetUnfolder]: 15446/22211 cut-off events. [2023-08-31 23:20:27,756 INFO L131 PetriNetUnfolder]: For 21902/21902 co-relation queries the response was YES. [2023-08-31 23:20:27,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65763 conditions, 22211 events. 15446/22211 cut-off events. For 21902/21902 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 134106 event pairs, 1217 based on Foata normal form. 204/22415 useless extension candidates. Maximal degree in co-relation 65752. Up to 8401 conditions per place. [2023-08-31 23:20:27,805 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 94 selfloop transitions, 19 changer transitions 14/127 dead transitions. [2023-08-31 23:20:27,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 848 flow [2023-08-31 23:20:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-08-31 23:20:27,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746760895170789 [2023-08-31 23:20:27,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-08-31 23:20:27,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-08-31 23:20:27,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:27,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-08-31 23:20:27,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:27,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:27,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:27,812 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 232 flow. Second operand 6 states and 806 transitions. [2023-08-31 23:20:27,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 848 flow [2023-08-31 23:20:27,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 794 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:27,835 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 345 flow [2023-08-31 23:20:27,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-31 23:20:27,836 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-31 23:20:27,836 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 345 flow [2023-08-31 23:20:27,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:27,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:27,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:20:27,837 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:27,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 743772084, now seen corresponding path program 2 times [2023-08-31 23:20:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566459800] [2023-08-31 23:20:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566459800] [2023-08-31 23:20:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566459800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:28,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:28,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843731230] [2023-08-31 23:20:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:20:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:20:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:20:28,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-31 23:20:28,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:28,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:28,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-31 23:20:28,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:28,955 INFO L130 PetriNetUnfolder]: 7606/12058 cut-off events. [2023-08-31 23:20:28,956 INFO L131 PetriNetUnfolder]: For 9141/9726 co-relation queries the response was YES. [2023-08-31 23:20:28,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34331 conditions, 12058 events. 7606/12058 cut-off events. For 9141/9726 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 82794 event pairs, 919 based on Foata normal form. 1406/13222 useless extension candidates. Maximal degree in co-relation 34317. Up to 4374 conditions per place. [2023-08-31 23:20:28,998 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 86 selfloop transitions, 10 changer transitions 4/117 dead transitions. [2023-08-31 23:20:28,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 117 transitions, 854 flow [2023-08-31 23:20:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:20:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:20:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-31 23:20:29,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488339222614841 [2023-08-31 23:20:29,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-31 23:20:29,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-31 23:20:29,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:29,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-31 23:20:29,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 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-31 23:20:29,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:29,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:29,004 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 345 flow. Second operand 5 states and 691 transitions. [2023-08-31 23:20:29,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 117 transitions, 854 flow [2023-08-31 23:20:29,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 854 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:20:29,015 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 404 flow [2023-08-31 23:20:29,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-08-31 23:20:29,016 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-31 23:20:29,016 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 404 flow [2023-08-31 23:20:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:29,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:29,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:20:29,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:29,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 718394409, now seen corresponding path program 1 times [2023-08-31 23:20:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212883165] [2023-08-31 23:20:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212883165] [2023-08-31 23:20:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212883165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:20:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179801775] [2023-08-31 23:20:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:29,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:20:29,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:29,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:20:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:20:29,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-31 23:20:29,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:29,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:29,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-31 23:20:29,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:30,113 INFO L130 PetriNetUnfolder]: 6667/10671 cut-off events. [2023-08-31 23:20:30,113 INFO L131 PetriNetUnfolder]: For 15137/15506 co-relation queries the response was YES. [2023-08-31 23:20:30,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36425 conditions, 10671 events. 6667/10671 cut-off events. For 15137/15506 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 72976 event pairs, 891 based on Foata normal form. 563/11009 useless extension candidates. Maximal degree in co-relation 36408. Up to 4330 conditions per place. [2023-08-31 23:20:30,151 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 94 selfloop transitions, 14 changer transitions 4/128 dead transitions. [2023-08-31 23:20:30,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 968 flow [2023-08-31 23:20:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2023-08-31 23:20:30,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48881036513545345 [2023-08-31 23:20:30,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 830 transitions. [2023-08-31 23:20:30,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 830 transitions. [2023-08-31 23:20:30,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:30,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 830 transitions. [2023-08-31 23:20:30,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:30,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:30,157 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:30,157 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 404 flow. Second operand 6 states and 830 transitions. [2023-08-31 23:20:30,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 968 flow [2023-08-31 23:20:30,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 920 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:30,173 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 446 flow [2023-08-31 23:20:30,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-08-31 23:20:30,174 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-31 23:20:30,174 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 446 flow [2023-08-31 23:20:30,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:30,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:30,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:20:30,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:30,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 896834294, now seen corresponding path program 1 times [2023-08-31 23:20:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670113181] [2023-08-31 23:20:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670113181] [2023-08-31 23:20:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670113181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:20:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589584878] [2023-08-31 23:20:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:30,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:20:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:20:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:20:30,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-31 23:20:30,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:30,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:30,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-31 23:20:30,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:32,277 INFO L130 PetriNetUnfolder]: 13410/20249 cut-off events. [2023-08-31 23:20:32,277 INFO L131 PetriNetUnfolder]: For 57454/57454 co-relation queries the response was YES. [2023-08-31 23:20:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75570 conditions, 20249 events. 13410/20249 cut-off events. For 57454/57454 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 132612 event pairs, 1565 based on Foata normal form. 11/20260 useless extension candidates. Maximal degree in co-relation 75553. Up to 10237 conditions per place. [2023-08-31 23:20:32,346 INFO L137 encePairwiseOnDemand]: 270/283 looper letters, 141 selfloop transitions, 49 changer transitions 59/249 dead transitions. [2023-08-31 23:20:32,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 249 transitions, 2163 flow [2023-08-31 23:20:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:20:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:20:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1195 transitions. [2023-08-31 23:20:32,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691794267765999 [2023-08-31 23:20:32,349 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1195 transitions. [2023-08-31 23:20:32,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1195 transitions. [2023-08-31 23:20:32,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:32,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1195 transitions. [2023-08-31 23:20:32,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:32,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:32,354 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:32,354 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 446 flow. Second operand 9 states and 1195 transitions. [2023-08-31 23:20:32,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 249 transitions, 2163 flow [2023-08-31 23:20:32,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 249 transitions, 2047 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-31 23:20:32,824 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 857 flow [2023-08-31 23:20:32,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=857, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2023-08-31 23:20:32,825 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-31 23:20:32,825 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 857 flow [2023-08-31 23:20:32,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:32,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:32,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:32,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:20:32,825 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:32,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -659858452, now seen corresponding path program 2 times [2023-08-31 23:20:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121345988] [2023-08-31 23:20:32,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121345988] [2023-08-31 23:20:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121345988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:20:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717322454] [2023-08-31 23:20:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:33,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:20:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:20:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:20:33,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-31 23:20:33,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 857 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:33,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:33,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-31 23:20:33,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:33,716 INFO L130 PetriNetUnfolder]: 4104/6645 cut-off events. [2023-08-31 23:20:33,717 INFO L131 PetriNetUnfolder]: For 18704/19049 co-relation queries the response was YES. [2023-08-31 23:20:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27966 conditions, 6645 events. 4104/6645 cut-off events. For 18704/19049 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 42485 event pairs, 640 based on Foata normal form. 211/6727 useless extension candidates. Maximal degree in co-relation 27942. Up to 2619 conditions per place. [2023-08-31 23:20:33,740 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 85 selfloop transitions, 18 changer transitions 54/172 dead transitions. [2023-08-31 23:20:33,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 172 transitions, 1682 flow [2023-08-31 23:20:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-31 23:20:33,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47400302877334677 [2023-08-31 23:20:33,742 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-31 23:20:33,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-31 23:20:33,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:33,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-31 23:20:33,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:33,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:33,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:33,746 INFO L175 Difference]: Start difference. First operand has 82 places, 94 transitions, 857 flow. Second operand 7 states and 939 transitions. [2023-08-31 23:20:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 172 transitions, 1682 flow [2023-08-31 23:20:34,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 172 transitions, 1622 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:20:34,153 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 584 flow [2023-08-31 23:20:34,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2023-08-31 23:20:34,153 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-31 23:20:34,154 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 584 flow [2023-08-31 23:20:34,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:34,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:34,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:20:34,154 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:34,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash -944820367, now seen corresponding path program 1 times [2023-08-31 23:20:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974722884] [2023-08-31 23:20:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974722884] [2023-08-31 23:20:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974722884] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:34,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736930855] [2023-08-31 23:20:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:34,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:34,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:34,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:20:34,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 584 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:34,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:20:34,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:34,733 INFO L130 PetriNetUnfolder]: 2687/4378 cut-off events. [2023-08-31 23:20:34,734 INFO L131 PetriNetUnfolder]: For 12260/12314 co-relation queries the response was YES. [2023-08-31 23:20:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 4378 events. 2687/4378 cut-off events. For 12260/12314 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 24687 event pairs, 886 based on Foata normal form. 1/4347 useless extension candidates. Maximal degree in co-relation 18512. Up to 2004 conditions per place. [2023-08-31 23:20:34,747 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 49 selfloop transitions, 1 changer transitions 79/133 dead transitions. [2023-08-31 23:20:34,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 133 transitions, 1278 flow [2023-08-31 23:20:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-31 23:20:34,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49381625441696114 [2023-08-31 23:20:34,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-31 23:20:34,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-31 23:20:34,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:34,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-31 23:20:34,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,752 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,752 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 584 flow. Second operand 4 states and 559 transitions. [2023-08-31 23:20:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 133 transitions, 1278 flow [2023-08-31 23:20:34,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 1121 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-31 23:20:34,806 INFO L231 Difference]: Finished difference. Result has 81 places, 48 transitions, 313 flow [2023-08-31 23:20:34,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=81, PETRI_TRANSITIONS=48} [2023-08-31 23:20:34,806 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-31 23:20:34,806 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 48 transitions, 313 flow [2023-08-31 23:20:34,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:34,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:34,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:20:34,807 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:34,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1760035311, now seen corresponding path program 2 times [2023-08-31 23:20:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649692484] [2023-08-31 23:20:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649692484] [2023-08-31 23:20:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649692484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:35,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:20:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007804496] [2023-08-31 23:20:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:35,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:20:35,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:20:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:20:35,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:20:35,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 48 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:35,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:35,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:20:35,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:35,483 INFO L130 PetriNetUnfolder]: 600/1020 cut-off events. [2023-08-31 23:20:35,483 INFO L131 PetriNetUnfolder]: For 2005/2031 co-relation queries the response was YES. [2023-08-31 23:20:35,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 1020 events. 600/1020 cut-off events. For 2005/2031 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4313 event pairs, 114 based on Foata normal form. 5/1012 useless extension candidates. Maximal degree in co-relation 3984. Up to 567 conditions per place. [2023-08-31 23:20:35,487 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 63 selfloop transitions, 8 changer transitions 28/104 dead transitions. [2023-08-31 23:20:35,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 820 flow [2023-08-31 23:20:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 932 transitions. [2023-08-31 23:20:35,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47046945986875316 [2023-08-31 23:20:35,489 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 932 transitions. [2023-08-31 23:20:35,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 932 transitions. [2023-08-31 23:20:35,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:35,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 932 transitions. [2023-08-31 23:20:35,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:35,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:35,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:35,493 INFO L175 Difference]: Start difference. First operand has 81 places, 48 transitions, 313 flow. Second operand 7 states and 932 transitions. [2023-08-31 23:20:35,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 820 flow [2023-08-31 23:20:35,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 628 flow, removed 25 selfloop flow, removed 18 redundant places. [2023-08-31 23:20:35,499 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 280 flow [2023-08-31 23:20:35,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-31 23:20:35,500 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-08-31 23:20:35,500 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 280 flow [2023-08-31 23:20:35,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:35,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:35,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:35,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:20:35,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:35,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1164572983, now seen corresponding path program 3 times [2023-08-31 23:20:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393779890] [2023-08-31 23:20:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:20:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393779890] [2023-08-31 23:20:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393779890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:20:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186244738] [2023-08-31 23:20:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:20:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:20:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:20:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:20:36,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-31 23:20:36,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:36,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:36,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-31 23:20:36,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:36,395 INFO L130 PetriNetUnfolder]: 564/960 cut-off events. [2023-08-31 23:20:36,395 INFO L131 PetriNetUnfolder]: For 1539/1557 co-relation queries the response was YES. [2023-08-31 23:20:36,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3394 conditions, 960 events. 564/960 cut-off events. For 1539/1557 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3971 event pairs, 77 based on Foata normal form. 19/966 useless extension candidates. Maximal degree in co-relation 3378. Up to 612 conditions per place. [2023-08-31 23:20:36,398 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 54 selfloop transitions, 5 changer transitions 37/100 dead transitions. [2023-08-31 23:20:36,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 653 flow [2023-08-31 23:20:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-08-31 23:20:36,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659262998485613 [2023-08-31 23:20:36,400 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-08-31 23:20:36,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-08-31 23:20:36,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:36,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-08-31 23:20:36,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:36,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:36,404 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:36,404 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 280 flow. Second operand 7 states and 923 transitions. [2023-08-31 23:20:36,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 653 flow [2023-08-31 23:20:36,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 632 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-31 23:20:36,413 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 226 flow [2023-08-31 23:20:36,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-08-31 23:20:36,414 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-31 23:20:36,415 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 226 flow [2023-08-31 23:20:36,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:36,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:36,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:36,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:20:36,420 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:36,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash -396168955, now seen corresponding path program 4 times [2023-08-31 23:20:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:20:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092352865] [2023-08-31 23:20:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:20:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:20:36,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:20:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:20:36,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:20:36,545 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:20:36,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:20:36,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:20:36,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:20:36,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:20:36,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:20:36,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:20:36,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:20:36,554 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:36,557 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:20:36,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:20:36,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:20:36 BasicIcfg [2023-08-31 23:20:36,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:20:36,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:20:36,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:20:36,632 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:20:36,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:10" (3/4) ... [2023-08-31 23:20:36,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:20:36,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:20:36,634 INFO L158 Benchmark]: Toolchain (without parser) took 27286.85ms. Allocated memory was 69.2MB in the beginning and 4.3GB in the end (delta: 4.3GB). Free memory was 44.9MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-31 23:20:36,634 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:20:36,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.95ms. Allocated memory was 69.2MB in the beginning and 109.1MB in the end (delta: 39.8MB). Free memory was 44.7MB in the beginning and 77.0MB in the end (delta: -32.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-31 23:20:36,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 109.1MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:20:36,635 INFO L158 Benchmark]: Boogie Preprocessor took 44.00ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:20:36,635 INFO L158 Benchmark]: RCFGBuilder took 583.54ms. Allocated memory is still 109.1MB. Free memory was 72.8MB in the beginning and 73.1MB in the end (delta: -295.7kB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-08-31 23:20:36,636 INFO L158 Benchmark]: TraceAbstraction took 26149.76ms. Allocated memory was 109.1MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 72.3MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-31 23:20:36,636 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 4.3GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:20:36,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.95ms. Allocated memory was 69.2MB in the beginning and 109.1MB in the end (delta: 39.8MB). Free memory was 44.7MB in the beginning and 77.0MB in the end (delta: -32.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 109.1MB. Free memory was 77.0MB in the beginning and 74.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.00ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 583.54ms. Allocated memory is still 109.1MB. Free memory was 72.8MB in the beginning and 73.1MB in the end (delta: -295.7kB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26149.76ms. Allocated memory was 109.1MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 72.3MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 4.3GB. Free memory is still 2.9GB. 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.7s, 152 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 138 TotalNumberOfCompositions, 10048 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4452, independent: 4214, independent conditional: 0, independent unconditional: 4214, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1931, independent: 1875, independent conditional: 0, independent unconditional: 1875, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4452, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1931, unknown conditional: 0, unknown unconditional: 1931] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-3, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=-2, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=-1, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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 9 procedures, 183 locations, 16 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: 26.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1081 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 324 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2707 IncrementalHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 77 mSDtfsCounter, 2707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=857occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:20:36,663 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/mix039.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:20:38,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:20:38,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:20:38,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:20:38,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:20:38,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:20:38,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:20:38,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:20:38,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:20:38,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:20:38,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:20:38,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:20:38,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:20:38,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:20:38,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:20:38,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:20:38,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:20:38,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:20:38,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:20:38,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:20:38,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:20:38,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:20:38,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:20:38,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:20:38,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:20:38,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:20:38,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:20:38,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:20:38,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:20:38,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:20:38,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:20:38,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:20:38,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:20:38,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:20:38,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:20:38,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:20:38,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:20:38,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:20:38,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:20:38,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:20:38,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:20:38,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:20:38,538 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:20:38,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:20:38,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:20:38,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:20:38,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:20:38,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:20:38,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:20:38,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:20:38,540 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:20:38,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:20:38,541 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:20:38,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:20:38,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:20:38,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:20:38,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:20:38,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:20:38,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:20:38,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:20:38,543 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:20:38,544 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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:20:38,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:20:38,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:20:38,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:20:38,787 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:20:38,787 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:20:38,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-31 23:20:39,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:20:39,910 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:20:39,910 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-31 23:20:39,918 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff02202d3/a363c32542244d40812400e9284a0b34/FLAG67e082090 [2023-08-31 23:20:39,926 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff02202d3/a363c32542244d40812400e9284a0b34 [2023-08-31 23:20:39,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:20:39,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:20:39,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:20:39,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:20:39,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:20:39,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:39" (1/1) ... [2023-08-31 23:20:39,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6370fb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:39, skipping insertion in model container [2023-08-31 23:20:39,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:20:39" (1/1) ... [2023-08-31 23:20:39,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:20:40,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:20:40,132 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/mix039.oepc.i[945,958] [2023-08-31 23:20:40,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:20:40,305 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:20:40,313 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/mix039.oepc.i[945,958] [2023-08-31 23:20:40,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:20:40,419 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:20:40,420 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:20:40,424 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:20:40,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40 WrapperNode [2023-08-31 23:20:40,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:20:40,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:20:40,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:20:40,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:20:40,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,455 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-31 23:20:40,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:20:40,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:20:40,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:20:40,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:20:40,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:20:40,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:20:40,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:20:40,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:20:40,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (1/1) ... [2023-08-31 23:20:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:20:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:20:40,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:20:40,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:20:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:20:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:20:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:20:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:20:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:20:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:20:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:20:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:20:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:20:40,538 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:20:40,637 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:20:40,650 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:20:40,983 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:20:41,087 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:20:41,087 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:20:41,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:41 BoogieIcfgContainer [2023-08-31 23:20:41,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:20:41,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:20:41,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:20:41,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:20:41,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:20:39" (1/3) ... [2023-08-31 23:20:41,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b46e36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:20:41, skipping insertion in model container [2023-08-31 23:20:41,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:20:40" (2/3) ... [2023-08-31 23:20:41,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b46e36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:20:41, skipping insertion in model container [2023-08-31 23:20:41,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:41" (3/3) ... [2023-08-31 23:20:41,096 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-08-31 23:20:41,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:20:41,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:20:41,107 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:20:41,160 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:20:41,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:20:41,242 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:20:41,243 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:20:41,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:20:41,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-31 23:20:41,254 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:20:41,266 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:20:41,269 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:20:41,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-31 23:20:41,305 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:20:41,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:41,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:20:41,309 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-31 23:20:46,654 INFO L134 LiptonReduction]: Checked pairs total: 9249 [2023-08-31 23:20:46,655 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:20:46,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:20:46,667 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;@58a7865e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:20:46,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:20:46,668 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:20:46,668 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:46,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:46,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:20:46,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:46,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-31 23:20:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884668191] [2023-08-31 23:20:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:46,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:46,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:20:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:46,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:20:46,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:46,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:46,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884668191] [2023-08-31 23:20:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884668191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:46,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:20:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203964978] [2023-08-31 23:20:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:20:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:46,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:20:46,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:20:46,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-31 23:20:46,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:46,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:46,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-31 23:20:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:47,691 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-31 23:20:47,691 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:20:47,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 52492 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-31 23:20:47,747 INFO L137 encePairwiseOnDemand]: 273/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:20:47,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-31 23:20:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:20:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:20:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:20:47,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284697508896797 [2023-08-31 23:20:47,761 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:20:47,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:20:47,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:47,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:20:47,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:47,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:47,774 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:47,775 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:20:47,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-31 23:20:47,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:47,782 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:20:47,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:20:47,785 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:20:47,785 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:20:47,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:47,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:47,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:20:47,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:20:47,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:47,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:47,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:47,998 INFO L85 PathProgramCache]: Analyzing trace with hash 604401, now seen corresponding path program 1 times [2023-08-31 23:20:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939131621] [2023-08-31 23:20:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:48,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:48,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:20:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:48,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:20:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:48,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:48,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939131621] [2023-08-31 23:20:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939131621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:48,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:20:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221769079] [2023-08-31 23:20:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:48,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:20:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:20:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:20:48,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-31 23:20:48,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 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-31 23:20:48,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:48,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-31 23:20:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:48,753 INFO L130 PetriNetUnfolder]: 5879/8510 cut-off events. [2023-08-31 23:20:48,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:20:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 8510 events. 5879/8510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51046 event pairs, 1079 based on Foata normal form. 0/7854 useless extension candidates. Maximal degree in co-relation 16648. Up to 6367 conditions per place. [2023-08-31 23:20:48,790 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-31 23:20:48,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-31 23:20:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:20:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:20:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-31 23:20:48,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195729537366548 [2023-08-31 23:20:48,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-31 23:20:48,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-31 23:20:48,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:48,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-31 23:20:48,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:48,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:48,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:48,797 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 438 transitions. [2023-08-31 23:20:48,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-31 23:20:48,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:20:48,799 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:20:48,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:20:48,800 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:20:48,800 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:20:48,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 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-31 23:20:48,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:48,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:48,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:49,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:49,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:49,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1634148415, now seen corresponding path program 1 times [2023-08-31 23:20:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833824070] [2023-08-31 23:20:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:49,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:49,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:49,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:20:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:49,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:20:49,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:49,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:49,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:49,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833824070] [2023-08-31 23:20:49,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833824070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:49,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:49,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044675064] [2023-08-31 23:20:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:49,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:49,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-31 23:20:49,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:49,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:49,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-31 23:20:49,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:49,666 INFO L130 PetriNetUnfolder]: 3939/5649 cut-off events. [2023-08-31 23:20:49,666 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-31 23:20:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 5649 events. 3939/5649 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30531 event pairs, 655 based on Foata normal form. 320/5714 useless extension candidates. Maximal degree in co-relation 11794. Up to 3025 conditions per place. [2023-08-31 23:20:49,684 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 51 selfloop transitions, 6 changer transitions 1/62 dead transitions. [2023-08-31 23:20:49,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 262 flow [2023-08-31 23:20:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:20:49,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49466192170818507 [2023-08-31 23:20:49,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:20:49,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:20:49,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:49,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:20:49,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:49,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:49,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:49,690 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:20:49,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 262 flow [2023-08-31 23:20:49,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:49,691 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 108 flow [2023-08-31 23:20:49,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-31 23:20:49,692 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-31 23:20:49,692 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 108 flow [2023-08-31 23:20:49,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:49,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:49,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:49,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 23:20:49,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:49,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:49,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 791621518, now seen corresponding path program 1 times [2023-08-31 23:20:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247094941] [2023-08-31 23:20:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:49,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:49,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:49,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:49,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:20:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:49,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:20:49,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:50,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:50,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247094941] [2023-08-31 23:20:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247094941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:50,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127683035] [2023-08-31 23:20:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:50,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:20:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:20:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:20:50,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-31 23:20:50,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:50,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-31 23:20:50,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:50,397 INFO L130 PetriNetUnfolder]: 2022/3083 cut-off events. [2023-08-31 23:20:50,398 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-31 23:20:50,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 3083 events. 2022/3083 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16180 event pairs, 328 based on Foata normal form. 212/3202 useless extension candidates. Maximal degree in co-relation 7825. Up to 1044 conditions per place. [2023-08-31 23:20:50,408 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 64 selfloop transitions, 10 changer transitions 1/79 dead transitions. [2023-08-31 23:20:50,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 379 flow [2023-08-31 23:20:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:20:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:20:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-31 23:20:50,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49608540925266903 [2023-08-31 23:20:50,410 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-31 23:20:50,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-31 23:20:50,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:50,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-31 23:20:50,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,414 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,415 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 108 flow. Second operand 5 states and 697 transitions. [2023-08-31 23:20:50,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 379 flow [2023-08-31 23:20:50,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:50,418 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 160 flow [2023-08-31 23:20:50,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-31 23:20:50,418 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-31 23:20:50,418 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 160 flow [2023-08-31 23:20:50,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:50,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:50,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:50,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:50,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -914658613, now seen corresponding path program 1 times [2023-08-31 23:20:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162079020] [2023-08-31 23:20:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:50,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:50,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:50,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:20:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:50,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:20:50,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:50,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:50,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162079020] [2023-08-31 23:20:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162079020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:20:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578238166] [2023-08-31 23:20:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:50,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:20:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:20:50,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:20:50,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-31 23:20:50,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:50,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:50,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-31 23:20:50,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:51,065 INFO L130 PetriNetUnfolder]: 1176/1850 cut-off events. [2023-08-31 23:20:51,066 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-31 23:20:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 1850 events. 1176/1850 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9136 event pairs, 326 based on Foata normal form. 77/1897 useless extension candidates. Maximal degree in co-relation 5339. Up to 630 conditions per place. [2023-08-31 23:20:51,073 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 75 selfloop transitions, 14 changer transitions 1/94 dead transitions. [2023-08-31 23:20:51,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 502 flow [2023-08-31 23:20:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-31 23:20:51,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958481613285884 [2023-08-31 23:20:51,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-31 23:20:51,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-31 23:20:51,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:51,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-31 23:20:51,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,080 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 160 flow. Second operand 6 states and 836 transitions. [2023-08-31 23:20:51,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 502 flow [2023-08-31 23:20:51,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:51,089 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 210 flow [2023-08-31 23:20:51,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-31 23:20:51,090 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-31 23:20:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 210 flow [2023-08-31 23:20:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:51,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:51,103 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 (6)] Ended with exit code 0 [2023-08-31 23:20:51,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:51,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:51,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -61646761, now seen corresponding path program 1 times [2023-08-31 23:20:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405088032] [2023-08-31 23:20:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:51,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:51,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:20:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:51,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:20:51,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:51,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:51,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:51,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405088032] [2023-08-31 23:20:51,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405088032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:51,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:20:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927873278] [2023-08-31 23:20:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:51,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:20:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:20:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:20:51,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-31 23:20:51,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:51,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-31 23:20:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:51,835 INFO L130 PetriNetUnfolder]: 1011/1570 cut-off events. [2023-08-31 23:20:51,836 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-31 23:20:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 1570 events. 1011/1570 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7534 event pairs, 326 based on Foata normal form. 14/1567 useless extension candidates. Maximal degree in co-relation 4603. Up to 630 conditions per place. [2023-08-31 23:20:51,842 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 58 selfloop transitions, 18 changer transitions 1/81 dead transitions. [2023-08-31 23:20:51,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 460 flow [2023-08-31 23:20:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-31 23:20:51,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4814438230808338 [2023-08-31 23:20:51,845 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-31 23:20:51,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-31 23:20:51,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:51,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-31 23:20:51,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,849 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 210 flow. Second operand 7 states and 947 transitions. [2023-08-31 23:20:51,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 460 flow [2023-08-31 23:20:51,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 414 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-31 23:20:51,858 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 220 flow [2023-08-31 23:20:51,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-31 23:20:51,859 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:20:51,859 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 220 flow [2023-08-31 23:20:51,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:51,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:51,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:51,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:52,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:52,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 466172065, now seen corresponding path program 1 times [2023-08-31 23:20:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072001272] [2023-08-31 23:20:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:52,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:52,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:52,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:52,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:20:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:52,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:20:52,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:52,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:52,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072001272] [2023-08-31 23:20:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072001272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:20:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399588712] [2023-08-31 23:20:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:52,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:20:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:20:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:20:52,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-08-31 23:20:52,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:52,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:52,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-08-31 23:20:52,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:53,379 INFO L130 PetriNetUnfolder]: 999/1543 cut-off events. [2023-08-31 23:20:53,379 INFO L131 PetriNetUnfolder]: For 1611/1611 co-relation queries the response was YES. [2023-08-31 23:20:53,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4484 conditions, 1543 events. 999/1543 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7162 event pairs, 151 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 4475. Up to 1251 conditions per place. [2023-08-31 23:20:53,387 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 58 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-31 23:20:53,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 478 flow [2023-08-31 23:20:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:20:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:20:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:20:53,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42052194543297744 [2023-08-31 23:20:53,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:20:53,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:20:53,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:53,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:20:53,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:53,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:53,394 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:53,394 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 220 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:20:53,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 478 flow [2023-08-31 23:20:53,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 324 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-31 23:20:53,400 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 128 flow [2023-08-31 23:20:53,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-31 23:20:53,401 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:20:53,401 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 128 flow [2023-08-31 23:20:53,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:53,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:53,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:53,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:53,610 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:53,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1405210741, now seen corresponding path program 1 times [2023-08-31 23:20:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098823422] [2023-08-31 23:20:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:20:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:53,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:53,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:20:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:20:53,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:20:53,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:54,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:54,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098823422] [2023-08-31 23:20:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098823422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:20:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267883707] [2023-08-31 23:20:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:54,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:20:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:20:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:20:54,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-31 23:20:54,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:54,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-31 23:20:54,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:54,429 INFO L130 PetriNetUnfolder]: 1527/2405 cut-off events. [2023-08-31 23:20:54,430 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-31 23:20:54,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2405 events. 1527/2405 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12425 event pairs, 293 based on Foata normal form. 1/2402 useless extension candidates. Maximal degree in co-relation 5808. Up to 836 conditions per place. [2023-08-31 23:20:54,439 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 83 selfloop transitions, 6 changer transitions 45/138 dead transitions. [2023-08-31 23:20:54,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 138 transitions, 728 flow [2023-08-31 23:20:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2023-08-31 23:20:54,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860193187595323 [2023-08-31 23:20:54,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2023-08-31 23:20:54,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2023-08-31 23:20:54,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:54,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2023-08-31 23:20:54,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,447 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 128 flow. Second operand 7 states and 956 transitions. [2023-08-31 23:20:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 138 transitions, 728 flow [2023-08-31 23:20:54,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 138 transitions, 711 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:20:54,450 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 159 flow [2023-08-31 23:20:54,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-31 23:20:54,450 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:20:54,450 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 159 flow [2023-08-31 23:20:54,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:54,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:54,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:54,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:54,663 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:54,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 396946239, now seen corresponding path program 2 times [2023-08-31 23:20:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763763719] [2023-08-31 23:20:54,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:20:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:54,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:54,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:20:54,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:20:54,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:20:54,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:20:54,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:54,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:54,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:54,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763763719] [2023-08-31 23:20:54,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763763719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:54,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:54,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:54,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690429685] [2023-08-31 23:20:54,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:54,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:54,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:54,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:54,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-31 23:20:54,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:54,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:54,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-31 23:20:54,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:55,168 INFO L130 PetriNetUnfolder]: 2367/3838 cut-off events. [2023-08-31 23:20:55,168 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2023-08-31 23:20:55,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 3838 events. 2367/3838 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22942 event pairs, 250 based on Foata normal form. 1/3834 useless extension candidates. Maximal degree in co-relation 10180. Up to 1886 conditions per place. [2023-08-31 23:20:55,181 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 61 selfloop transitions, 1 changer transitions 35/100 dead transitions. [2023-08-31 23:20:55,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 100 transitions, 563 flow [2023-08-31 23:20:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-31 23:20:55,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50355871886121 [2023-08-31 23:20:55,183 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-31 23:20:55,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-31 23:20:55,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:55,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-31 23:20:55,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,186 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 159 flow. Second operand 4 states and 566 transitions. [2023-08-31 23:20:55,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 100 transitions, 563 flow [2023-08-31 23:20:55,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 556 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:20:55,189 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 161 flow [2023-08-31 23:20:55,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-31 23:20:55,189 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:20:55,190 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 161 flow [2023-08-31 23:20:55,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:55,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:55,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:55,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:55,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:55,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1170313985, now seen corresponding path program 3 times [2023-08-31 23:20:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166099125] [2023-08-31 23:20:55,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:20:55,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:55,399 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:20:55,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:20:55,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:20:55,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:20:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:55,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:55,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166099125] [2023-08-31 23:20:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166099125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:55,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:20:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91053763] [2023-08-31 23:20:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:55,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:20:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:55,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:20:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:20:55,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-08-31 23:20:55,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:55,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-08-31 23:20:55,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:55,816 INFO L130 PetriNetUnfolder]: 2486/3948 cut-off events. [2023-08-31 23:20:55,816 INFO L131 PetriNetUnfolder]: For 2839/2840 co-relation queries the response was YES. [2023-08-31 23:20:55,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10969 conditions, 3948 events. 2486/3948 cut-off events. For 2839/2840 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23027 event pairs, 906 based on Foata normal form. 1/3883 useless extension candidates. Maximal degree in co-relation 10961. Up to 2065 conditions per place. [2023-08-31 23:20:55,825 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 55 selfloop transitions, 2 changer transitions 17/77 dead transitions. [2023-08-31 23:20:55,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 432 flow [2023-08-31 23:20:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:20:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:20:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-31 23:20:55,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077105575326216 [2023-08-31 23:20:55,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-31 23:20:55,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-31 23:20:55,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:55,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-31 23:20:55,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,830 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 161 flow. Second operand 3 states and 428 transitions. [2023-08-31 23:20:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 432 flow [2023-08-31 23:20:55,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:20:55,832 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 157 flow [2023-08-31 23:20:55,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:20:55,833 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:20:55,833 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 157 flow [2023-08-31 23:20:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:55,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:55,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:55,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:56,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:56,041 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:56,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1150684573, now seen corresponding path program 4 times [2023-08-31 23:20:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361611528] [2023-08-31 23:20:56,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:20:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:56,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:20:56,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:20:56,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:20:56,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:20:56,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:56,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:56,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361611528] [2023-08-31 23:20:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361611528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:56,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:56,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:20:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200544499] [2023-08-31 23:20:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:56,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:20:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:20:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:20:56,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-31 23:20:56,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 157 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:56,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:56,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-31 23:20:56,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:56,724 INFO L130 PetriNetUnfolder]: 828/1369 cut-off events. [2023-08-31 23:20:56,724 INFO L131 PetriNetUnfolder]: For 797/841 co-relation queries the response was YES. [2023-08-31 23:20:56,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4015 conditions, 1369 events. 828/1369 cut-off events. For 797/841 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6564 event pairs, 111 based on Foata normal form. 34/1396 useless extension candidates. Maximal degree in co-relation 4007. Up to 617 conditions per place. [2023-08-31 23:20:56,728 INFO L137 encePairwiseOnDemand]: 275/281 looper letters, 56 selfloop transitions, 5 changer transitions 34/99 dead transitions. [2023-08-31 23:20:56,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 547 flow [2023-08-31 23:20:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:20:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:20:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2023-08-31 23:20:56,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47686832740213525 [2023-08-31 23:20:56,735 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2023-08-31 23:20:56,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2023-08-31 23:20:56,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:56,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2023-08-31 23:20:56,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:56,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:56,739 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:56,739 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 157 flow. Second operand 7 states and 938 transitions. [2023-08-31 23:20:56,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 547 flow [2023-08-31 23:20:56,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 99 transitions, 529 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:20:56,742 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 162 flow [2023-08-31 23:20:56,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-31 23:20:56,742 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2023-08-31 23:20:56,742 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 162 flow [2023-08-31 23:20:56,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:56,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:56,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:56,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 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:56,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:56,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:56,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1738144449, now seen corresponding path program 5 times [2023-08-31 23:20:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312509034] [2023-08-31 23:20:56,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:20:56,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:56,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:56,952 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:56,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:20:57,041 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:20:57,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:20:57,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:20:57,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:20:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:20:57,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:20:57,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:20:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312509034] [2023-08-31 23:20:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312509034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:20:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:20:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:20:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102225055] [2023-08-31 23:20:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:20:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:20:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:20:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:20:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:20:57,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-31 23:20:57,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:57,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:20:57,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-31 23:20:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:20:57,298 INFO L130 PetriNetUnfolder]: 1212/2013 cut-off events. [2023-08-31 23:20:57,299 INFO L131 PetriNetUnfolder]: For 2121/2126 co-relation queries the response was YES. [2023-08-31 23:20:57,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 2013 events. 1212/2013 cut-off events. For 2121/2126 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10060 event pairs, 430 based on Foata normal form. 1/1998 useless extension candidates. Maximal degree in co-relation 5672. Up to 791 conditions per place. [2023-08-31 23:20:57,303 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 44 selfloop transitions, 1 changer transitions 38/86 dead transitions. [2023-08-31 23:20:57,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 516 flow [2023-08-31 23:20:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:20:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:20:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:20:57,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49466192170818507 [2023-08-31 23:20:57,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:20:57,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:20:57,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:20:57,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:20:57,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:57,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:57,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:57,317 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 162 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:20:57,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 516 flow [2023-08-31 23:20:57,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 480 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:20:57,320 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 153 flow [2023-08-31 23:20:57,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-31 23:20:57,320 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-31 23:20:57,320 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 153 flow [2023-08-31 23:20:57,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:20:57,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:20:57,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:57,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:57,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:57,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:20:57,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:20:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1319320093, now seen corresponding path program 6 times [2023-08-31 23:20:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:20:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364620637] [2023-08-31 23:20:57,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:20:57,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:20:57,527 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:20:57,528 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 (14)] Waiting until timeout for monitored process [2023-08-31 23:20:57,634 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:20:57,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:20:57,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:20:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:20:57,776 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:20:57,777 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:20:57,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:20:57,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:20:57,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:20:57,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:20:57,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:20:57,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:20:57,793 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 (14)] Forceful destruction successful, exit code 0 [2023-08-31 23:20:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:20:57,988 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:20:57,992 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:20:57,992 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:20:58,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:20:58 BasicIcfg [2023-08-31 23:20:58,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:20:58,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:20:58,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:20:58,073 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:20:58,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:20:41" (3/4) ... [2023-08-31 23:20:58,075 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:20:58,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:20:58,076 INFO L158 Benchmark]: Toolchain (without parser) took 18146.46ms. Allocated memory was 79.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 56.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,076 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 79.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:20:58,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.62ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 51.3MB in the end (delta: 4.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.40ms. Allocated memory is still 79.7MB. Free memory was 51.3MB in the beginning and 48.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,078 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 79.7MB. Free memory was 48.7MB in the beginning and 46.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,078 INFO L158 Benchmark]: RCFGBuilder took 602.04ms. Allocated memory was 79.7MB in the beginning and 98.6MB in the end (delta: 18.9MB). Free memory was 46.3MB in the beginning and 65.7MB in the end (delta: -19.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,079 INFO L158 Benchmark]: TraceAbstraction took 16981.55ms. Allocated memory was 98.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 801.8MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,081 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:20:58,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 79.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.62ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 51.3MB in the end (delta: 4.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.40ms. Allocated memory is still 79.7MB. Free memory was 51.3MB in the beginning and 48.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 79.7MB. Free memory was 48.7MB in the beginning and 46.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.04ms. Allocated memory was 79.7MB in the beginning and 98.6MB in the end (delta: 18.9MB). Free memory was 46.3MB in the beginning and 65.7MB in the end (delta: -19.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16981.55ms. Allocated memory was 98.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 801.8MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 153 PlacesBefore, 52 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 9249 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4059, independent: 3855, independent conditional: 0, independent unconditional: 3855, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1950, independent: 1887, independent conditional: 0, independent unconditional: 1887, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4059, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 1950, unknown conditional: 0, unknown unconditional: 1950] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=0, t1025={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=1, t1025={-16:0}, t1026={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=2, t1025={-16:0}, t1026={-12:0}, t1027={-2:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=3, t1025={-16:0}, t1026={-12:0}, t1027={-2:0}, t1028={-4:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={-16:0}, t1026={-12:0}, t1027={-2:0}, t1028={-4:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={-16:0}, t1026={-12:0}, t1027={-2:0}, t1028={-4:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 775 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2020 IncrementalHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 33 mSDtfsCounter, 2020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 228 ConstructedInterpolants, 20 QuantifiedInterpolants, 2236 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1940 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:20:58,106 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