./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --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:15:01,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:15:01,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:15:01,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:15:01,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:15:01,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:15:01,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:15:01,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:15:01,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:15:01,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:15:01,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:15:01,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:15:01,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:15:01,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:15:01,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:15:01,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:15:01,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:15:01,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:15:01,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:15:01,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:15:01,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:15:01,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:15:01,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:15:01,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:15:01,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:15:01,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:15:01,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:15:01,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:15:01,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:15:01,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:15:01,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:15:01,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:15:01,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:15:01,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:15:01,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:15:01,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:15:01,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:15:01,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:15:01,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:15:01,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:15:01,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:15:01,967 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:15:02,000 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:15:02,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:15:02,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:15:02,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:15:02,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:15:02,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:15:02,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:15:02,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:15:02,003 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:15:02,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:15:02,004 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:15:02,005 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:15:02,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:15:02,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:15:02,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:15:02,005 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:15:02,006 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:15:02,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:15:02,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:15:02,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:15:02,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:02,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:15:02,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:15:02,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:15:02,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:15:02,008 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:15:02,008 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:15:02,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:15:02,009 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:15:02,009 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 -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 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:15:02,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:15:02,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:15:02,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:15:02,341 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:15:02,341 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:15:02,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-31 23:15:03,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:15:03,930 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:15:03,931 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-31 23:15:03,954 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afccdacb4/ba9a8b0c328e4457a4ab0da97df1016b/FLAGee38f4e56 [2023-08-31 23:15:03,967 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afccdacb4/ba9a8b0c328e4457a4ab0da97df1016b [2023-08-31 23:15:03,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:15:03,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:15:03,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:03,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:15:03,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:15:03,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:03" (1/1) ... [2023-08-31 23:15:03,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29093146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:03, skipping insertion in model container [2023-08-31 23:15:03,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:03" (1/1) ... [2023-08-31 23:15:03,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:15:04,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:15:04,206 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/mix023_tso.i[944,957] [2023-08-31 23:15:04,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:04,480 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:15:04,489 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/mix023_tso.i[944,957] [2023-08-31 23:15:04,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:04,570 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:04,570 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:04,576 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:15:04,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04 WrapperNode [2023-08-31 23:15:04,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:04,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:04,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:15:04,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:15:04,583 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:15:04" (1/1) ... [2023-08-31 23:15:04,604 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:15:04" (1/1) ... [2023-08-31 23:15:04,644 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 282 [2023-08-31 23:15:04,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:04,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:15:04,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:15:04,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:15:04,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:15:04,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:15:04,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:15:04,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:15:04,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (1/1) ... [2023-08-31 23:15:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:15:04,741 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:15:04,798 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:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:15:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:15:04,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:15:04,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:15:04,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:15:04,814 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:15:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:15:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:15:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:15:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:15:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:15:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:15:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:15:04,817 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:15:04,975 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:15:04,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:15:05,518 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:15:05,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:15:05,803 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:15:05,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:05 BoogieIcfgContainer [2023-08-31 23:15:05,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:15:05,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:15:05,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:15:05,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:15:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:15:03" (1/3) ... [2023-08-31 23:15:05,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6babb94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:05, skipping insertion in model container [2023-08-31 23:15:05,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:04" (2/3) ... [2023-08-31 23:15:05,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6babb94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:05, skipping insertion in model container [2023-08-31 23:15:05,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:05" (3/3) ... [2023-08-31 23:15:05,813 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-08-31 23:15:05,829 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:15:05,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-31 23:15:05,830 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:15:05,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:15:05,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 163 transitions, 346 flow [2023-08-31 23:15:06,030 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2023-08-31 23:15:06,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:06,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 2/159 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/145 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-31 23:15:06,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 163 transitions, 346 flow [2023-08-31 23:15:06,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 159 transitions, 330 flow [2023-08-31 23:15:06,046 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:15:06,054 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 159 transitions, 330 flow [2023-08-31 23:15:06,056 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 159 transitions, 330 flow [2023-08-31 23:15:06,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 159 transitions, 330 flow [2023-08-31 23:15:06,104 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2023-08-31 23:15:06,105 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:06,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 2/159 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/145 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-31 23:15:06,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2023-08-31 23:15:12,616 INFO L134 LiptonReduction]: Checked pairs total: 11676 [2023-08-31 23:15:12,617 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-08-31 23:15:12,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:15:12,634 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;@37a93a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:15:12,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-31 23:15:12,636 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:15:12,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:12,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:12,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:15:12,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:12,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 841, now seen corresponding path program 1 times [2023-08-31 23:15:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44316533] [2023-08-31 23:15:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:12,768 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:15:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44316533] [2023-08-31 23:15:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44316533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:12,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:15:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427715584] [2023-08-31 23:15:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:12,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:15:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:15:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:15:12,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 319 [2023-08-31 23:15:12,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:12,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:12,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 319 [2023-08-31 23:15:12,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:15,313 INFO L130 PetriNetUnfolder]: 12723/17269 cut-off events. [2023-08-31 23:15:15,314 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-08-31 23:15:15,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34529 conditions, 17269 events. 12723/17269 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 93773 event pairs, 12723 based on Foata normal form. 0/14564 useless extension candidates. Maximal degree in co-relation 34517. Up to 17005 conditions per place. [2023-08-31 23:15:15,437 INFO L137 encePairwiseOnDemand]: 310/319 looper letters, 30 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-31 23:15:15,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 140 flow [2023-08-31 23:15:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:15:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:15:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions. [2023-08-31 23:15:15,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512539184952978 [2023-08-31 23:15:15,458 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 327 transitions. [2023-08-31 23:15:15,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions. [2023-08-31 23:15:15,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:15,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions. [2023-08-31 23:15:15,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,476 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,478 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 327 transitions. [2023-08-31 23:15:15,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 140 flow [2023-08-31 23:15:15,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:15,486 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-31 23:15:15,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-31 23:15:15,491 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:15:15,491 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-31 23:15:15,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:15,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:15:15,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:15:15,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:15,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash 797849786, now seen corresponding path program 1 times [2023-08-31 23:15:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481055248] [2023-08-31 23:15:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:15,765 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:15:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481055248] [2023-08-31 23:15:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481055248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:15:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174972663] [2023-08-31 23:15:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:15,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:15,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:15,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 319 [2023-08-31 23:15:15,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:15,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 319 [2023-08-31 23:15:15,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:17,745 INFO L130 PetriNetUnfolder]: 10485/14811 cut-off events. [2023-08-31 23:15:17,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29078 conditions, 14811 events. 10485/14811 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 89867 event pairs, 1533 based on Foata normal form. 0/13262 useless extension candidates. Maximal degree in co-relation 29075. Up to 11801 conditions per place. [2023-08-31 23:15:17,817 INFO L137 encePairwiseOnDemand]: 316/319 looper letters, 48 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-31 23:15:17,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 220 flow [2023-08-31 23:15:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-31 23:15:17,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015673981191222 [2023-08-31 23:15:17,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-31 23:15:17,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-31 23:15:17,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:17,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-31 23:15:17,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:17,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:17,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:17,827 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 480 transitions. [2023-08-31 23:15:17,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 220 flow [2023-08-31 23:15:17,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:17,829 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 78 flow [2023-08-31 23:15:17,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 23:15:17,830 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-31 23:15:17,830 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 78 flow [2023-08-31 23:15:17,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:17,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:17,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:17,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:15:17,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:17,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -587218725, now seen corresponding path program 1 times [2023-08-31 23:15:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319186544] [2023-08-31 23:15:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:18,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:15:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319186544] [2023-08-31 23:15:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319186544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:15:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918325074] [2023-08-31 23:15:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:18,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 319 [2023-08-31 23:15:18,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 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:15:18,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:18,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 319 [2023-08-31 23:15:18,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:19,368 INFO L130 PetriNetUnfolder]: 8717/12327 cut-off events. [2023-08-31 23:15:19,369 INFO L131 PetriNetUnfolder]: For 597/597 co-relation queries the response was YES. [2023-08-31 23:15:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24868 conditions, 12327 events. 8717/12327 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 70420 event pairs, 1645 based on Foata normal form. 0/11506 useless extension candidates. Maximal degree in co-relation 24864. Up to 9313 conditions per place. [2023-08-31 23:15:19,442 INFO L137 encePairwiseOnDemand]: 316/319 looper letters, 40 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-31 23:15:19,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 198 flow [2023-08-31 23:15:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-08-31 23:15:19,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952978056426332 [2023-08-31 23:15:19,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-08-31 23:15:19,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-08-31 23:15:19,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:19,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-08-31 23:15:19,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,450 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 474 transitions. [2023-08-31 23:15:19,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 198 flow [2023-08-31 23:15:19,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:19,453 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-31 23:15:19,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:15:19,454 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:15:19,457 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-31 23:15:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:15:19,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:19,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:19,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:15:19,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:19,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -428248710, now seen corresponding path program 1 times [2023-08-31 23:15:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652580493] [2023-08-31 23:15:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:20,340 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:15:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652580493] [2023-08-31 23:15:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652580493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:20,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696732090] [2023-08-31 23:15:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:20,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 319 [2023-08-31 23:15:20,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:20,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:20,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 319 [2023-08-31 23:15:20,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:21,540 INFO L130 PetriNetUnfolder]: 6237/8643 cut-off events. [2023-08-31 23:15:21,541 INFO L131 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2023-08-31 23:15:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17704 conditions, 8643 events. 6237/8643 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 44434 event pairs, 2312 based on Foata normal form. 0/8523 useless extension candidates. Maximal degree in co-relation 17700. Up to 8144 conditions per place. [2023-08-31 23:15:21,587 INFO L137 encePairwiseOnDemand]: 314/319 looper letters, 42 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-31 23:15:21,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 204 flow [2023-08-31 23:15:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:15:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:15:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2023-08-31 23:15:21,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.416405433646813 [2023-08-31 23:15:21,590 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2023-08-31 23:15:21,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2023-08-31 23:15:21,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:21,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2023-08-31 23:15:21,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,597 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,597 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 6 states and 797 transitions. [2023-08-31 23:15:21,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 204 flow [2023-08-31 23:15:21,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:21,602 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 76 flow [2023-08-31 23:15:21,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-31 23:15:21,603 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-31 23:15:21,603 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 76 flow [2023-08-31 23:15:21,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:21,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:21,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:15:21,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:21,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -428248783, now seen corresponding path program 1 times [2023-08-31 23:15:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309408532] [2023-08-31 23:15:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:22,291 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:15:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309408532] [2023-08-31 23:15:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309408532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597269788] [2023-08-31 23:15:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:22,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 319 [2023-08-31 23:15:22,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:22,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:22,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 319 [2023-08-31 23:15:22,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:23,637 INFO L130 PetriNetUnfolder]: 8745/12263 cut-off events. [2023-08-31 23:15:23,637 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-31 23:15:23,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24556 conditions, 12263 events. 8745/12263 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 66767 event pairs, 2219 based on Foata normal form. 500/12758 useless extension candidates. Maximal degree in co-relation 24552. Up to 9612 conditions per place. [2023-08-31 23:15:23,686 INFO L137 encePairwiseOnDemand]: 314/319 looper letters, 38 selfloop transitions, 3 changer transitions 26/70 dead transitions. [2023-08-31 23:15:23,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 294 flow [2023-08-31 23:15:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2023-08-31 23:15:23,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884012539184953 [2023-08-31 23:15:23,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 779 transitions. [2023-08-31 23:15:23,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 779 transitions. [2023-08-31 23:15:23,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:23,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 779 transitions. [2023-08-31 23:15:23,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,695 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 76 flow. Second operand 5 states and 779 transitions. [2023-08-31 23:15:23,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 294 flow [2023-08-31 23:15:23,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:23,697 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 96 flow [2023-08-31 23:15:23,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-31 23:15:23,698 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-31 23:15:23,698 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 96 flow [2023-08-31 23:15:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:23,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:15:23,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:23,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -390863346, now seen corresponding path program 1 times [2023-08-31 23:15:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159796721] [2023-08-31 23:15:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:24,057 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:15:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159796721] [2023-08-31 23:15:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159796721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:15:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160975172] [2023-08-31 23:15:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:24,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:24,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 319 [2023-08-31 23:15:24,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:24,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:24,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 319 [2023-08-31 23:15:24,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:25,098 INFO L130 PetriNetUnfolder]: 7192/10342 cut-off events. [2023-08-31 23:15:25,099 INFO L131 PetriNetUnfolder]: For 2732/2748 co-relation queries the response was YES. [2023-08-31 23:15:25,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22545 conditions, 10342 events. 7192/10342 cut-off events. For 2732/2748 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 57756 event pairs, 2154 based on Foata normal form. 460/10781 useless extension candidates. Maximal degree in co-relation 22538. Up to 5726 conditions per place. [2023-08-31 23:15:25,145 INFO L137 encePairwiseOnDemand]: 315/319 looper letters, 37 selfloop transitions, 2 changer transitions 25/69 dead transitions. [2023-08-31 23:15:25,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 304 flow [2023-08-31 23:15:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2023-08-31 23:15:25,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48589341692789967 [2023-08-31 23:15:25,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2023-08-31 23:15:25,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2023-08-31 23:15:25,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:25,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2023-08-31 23:15:25,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:25,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:25,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:25,153 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 96 flow. Second operand 5 states and 775 transitions. [2023-08-31 23:15:25,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 304 flow [2023-08-31 23:15:25,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 295 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:25,172 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 101 flow [2023-08-31 23:15:25,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-08-31 23:15:25,172 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-08-31 23:15:25,173 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 101 flow [2023-08-31 23:15:25,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:25,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:25,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:25,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:15:25,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:25,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash 692977285, now seen corresponding path program 1 times [2023-08-31 23:15:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:25,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964967999] [2023-08-31 23:15:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:35,489 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:15:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964967999] [2023-08-31 23:15:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964967999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229727110] [2023-08-31 23:15:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:35,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 319 [2023-08-31 23:15:35,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:35,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:35,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 319 [2023-08-31 23:15:35,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:36,791 INFO L130 PetriNetUnfolder]: 9325/12799 cut-off events. [2023-08-31 23:15:36,791 INFO L131 PetriNetUnfolder]: For 5544/5556 co-relation queries the response was YES. [2023-08-31 23:15:36,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29130 conditions, 12799 events. 9325/12799 cut-off events. For 5544/5556 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 67163 event pairs, 2305 based on Foata normal form. 484/13274 useless extension candidates. Maximal degree in co-relation 29121. Up to 8429 conditions per place. [2023-08-31 23:15:36,935 INFO L137 encePairwiseOnDemand]: 315/319 looper letters, 45 selfloop transitions, 2 changer transitions 24/74 dead transitions. [2023-08-31 23:15:36,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 343 flow [2023-08-31 23:15:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2023-08-31 23:15:36,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489028213166144 [2023-08-31 23:15:36,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2023-08-31 23:15:36,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2023-08-31 23:15:36,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:36,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2023-08-31 23:15:36,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:36,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:36,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:36,945 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 101 flow. Second operand 5 states and 716 transitions. [2023-08-31 23:15:36,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 343 flow [2023-08-31 23:15:36,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 333 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:36,957 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 105 flow [2023-08-31 23:15:36,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2023-08-31 23:15:36,958 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:15:36,958 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 105 flow [2023-08-31 23:15:36,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:36,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:36,958 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:15:36,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:15:36,959 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:36,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 958647478, now seen corresponding path program 1 times [2023-08-31 23:15:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241139122] [2023-08-31 23:15:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:37,304 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:15:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:37,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241139122] [2023-08-31 23:15:37,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241139122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:37,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:37,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:37,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376457251] [2023-08-31 23:15:37,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:37,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:37,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:37,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 319 [2023-08-31 23:15:37,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:37,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:37,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 319 [2023-08-31 23:15:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:38,044 INFO L130 PetriNetUnfolder]: 4707/6819 cut-off events. [2023-08-31 23:15:38,044 INFO L131 PetriNetUnfolder]: For 1595/1611 co-relation queries the response was YES. [2023-08-31 23:15:38,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16013 conditions, 6819 events. 4707/6819 cut-off events. For 1595/1611 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 37110 event pairs, 910 based on Foata normal form. 484/7277 useless extension candidates. Maximal degree in co-relation 16003. Up to 4270 conditions per place. [2023-08-31 23:15:38,072 INFO L137 encePairwiseOnDemand]: 312/319 looper letters, 64 selfloop transitions, 9 changer transitions 6/84 dead transitions. [2023-08-31 23:15:38,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 398 flow [2023-08-31 23:15:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-31 23:15:38,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808777429467085 [2023-08-31 23:15:38,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-31 23:15:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-31 23:15:38,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:38,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-31 23:15:38,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:38,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:38,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:38,081 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 105 flow. Second operand 5 states and 767 transitions. [2023-08-31 23:15:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 398 flow [2023-08-31 23:15:38,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 384 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:38,085 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 166 flow [2023-08-31 23:15:38,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-31 23:15:38,086 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2023-08-31 23:15:38,086 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 166 flow [2023-08-31 23:15:38,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:38,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:38,086 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:15:38,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:15:38,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:38,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:38,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1532946667, now seen corresponding path program 1 times [2023-08-31 23:15:38,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067605811] [2023-08-31 23:15:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:38,455 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:15:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067605811] [2023-08-31 23:15:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067605811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:38,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:38,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56402870] [2023-08-31 23:15:38,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:38,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:38,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 319 [2023-08-31 23:15:38,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:38,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:38,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 319 [2023-08-31 23:15:38,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:39,105 INFO L130 PetriNetUnfolder]: 3602/5412 cut-off events. [2023-08-31 23:15:39,105 INFO L131 PetriNetUnfolder]: For 2554/2570 co-relation queries the response was YES. [2023-08-31 23:15:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15531 conditions, 5412 events. 3602/5412 cut-off events. For 2554/2570 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 30063 event pairs, 567 based on Foata normal form. 304/5690 useless extension candidates. Maximal degree in co-relation 15520. Up to 1591 conditions per place. [2023-08-31 23:15:39,129 INFO L137 encePairwiseOnDemand]: 312/319 looper letters, 88 selfloop transitions, 17 changer transitions 8/118 dead transitions. [2023-08-31 23:15:39,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 640 flow [2023-08-31 23:15:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1075 transitions. [2023-08-31 23:15:39,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48141513658755036 [2023-08-31 23:15:39,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1075 transitions. [2023-08-31 23:15:39,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1075 transitions. [2023-08-31 23:15:39,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:39,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1075 transitions. [2023-08-31 23:15:39,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:39,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:39,139 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:39,139 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 166 flow. Second operand 7 states and 1075 transitions. [2023-08-31 23:15:39,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 640 flow [2023-08-31 23:15:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:15:39,152 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 282 flow [2023-08-31 23:15:39,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-08-31 23:15:39,153 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-31 23:15:39,153 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 282 flow [2023-08-31 23:15:39,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:39,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:39,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:39,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:15:39,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:39,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -640333491, now seen corresponding path program 1 times [2023-08-31 23:15:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:39,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007476378] [2023-08-31 23:15:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:39,574 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:15:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007476378] [2023-08-31 23:15:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007476378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121673513] [2023-08-31 23:15:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:39,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:39,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 319 [2023-08-31 23:15:39,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:39,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:39,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 319 [2023-08-31 23:15:39,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:40,341 INFO L130 PetriNetUnfolder]: 3147/4762 cut-off events. [2023-08-31 23:15:40,341 INFO L131 PetriNetUnfolder]: For 5541/5557 co-relation queries the response was YES. [2023-08-31 23:15:40,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15512 conditions, 4762 events. 3147/4762 cut-off events. For 5541/5557 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26352 event pairs, 508 based on Foata normal form. 103/4839 useless extension candidates. Maximal degree in co-relation 15498. Up to 1382 conditions per place. [2023-08-31 23:15:40,362 INFO L137 encePairwiseOnDemand]: 312/319 looper letters, 98 selfloop transitions, 25 changer transitions 20/148 dead transitions. [2023-08-31 23:15:40,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 148 transitions, 921 flow [2023-08-31 23:15:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:15:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:15:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1381 transitions. [2023-08-31 23:15:40,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48101706722396376 [2023-08-31 23:15:40,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1381 transitions. [2023-08-31 23:15:40,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1381 transitions. [2023-08-31 23:15:40,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:40,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1381 transitions. [2023-08-31 23:15:40,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 153.44444444444446) internal successors, (1381), 9 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:40,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 319.0) internal successors, (3190), 10 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:40,374 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 319.0) internal successors, (3190), 10 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:40,375 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 282 flow. Second operand 9 states and 1381 transitions. [2023-08-31 23:15:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 148 transitions, 921 flow [2023-08-31 23:15:40,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 876 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:40,494 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 398 flow [2023-08-31 23:15:40,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2023-08-31 23:15:40,494 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2023-08-31 23:15:40,494 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 398 flow [2023-08-31 23:15:40,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:40,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:40,495 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] [2023-08-31 23:15:40,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:15:40,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:40,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash 93431856, now seen corresponding path program 1 times [2023-08-31 23:15:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:40,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735309815] [2023-08-31 23:15:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:49,572 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:15:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735309815] [2023-08-31 23:15:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735309815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:49,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277569980] [2023-08-31 23:15:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:49,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:49,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:49,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 319 [2023-08-31 23:15:49,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:49,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 319 [2023-08-31 23:15:49,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:50,936 INFO L130 PetriNetUnfolder]: 5854/8908 cut-off events. [2023-08-31 23:15:50,936 INFO L131 PetriNetUnfolder]: For 16575/16578 co-relation queries the response was YES. [2023-08-31 23:15:50,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28982 conditions, 8908 events. 5854/8908 cut-off events. For 16575/16578 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 53176 event pairs, 1273 based on Foata normal form. 14/8921 useless extension candidates. Maximal degree in co-relation 28965. Up to 5099 conditions per place. [2023-08-31 23:15:50,977 INFO L137 encePairwiseOnDemand]: 310/319 looper letters, 124 selfloop transitions, 13 changer transitions 29/169 dead transitions. [2023-08-31 23:15:50,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 169 transitions, 1467 flow [2023-08-31 23:15:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2023-08-31 23:15:50,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44290192566054637 [2023-08-31 23:15:50,983 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2023-08-31 23:15:50,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2023-08-31 23:15:50,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:50,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2023-08-31 23:15:50,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,989 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 398 flow. Second operand 7 states and 989 transitions. [2023-08-31 23:15:50,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 169 transitions, 1467 flow [2023-08-31 23:15:51,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 169 transitions, 1229 flow, removed 82 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:51,300 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 388 flow [2023-08-31 23:15:51,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2023-08-31 23:15:51,300 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2023-08-31 23:15:51,301 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 388 flow [2023-08-31 23:15:51,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:51,301 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] [2023-08-31 23:15:51,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:15:51,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:15:51,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 725038690, now seen corresponding path program 2 times [2023-08-31 23:15:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113399922] [2023-08-31 23:15:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:00,995 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:16:00,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:00,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113399922] [2023-08-31 23:16:00,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113399922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:00,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:16:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972646968] [2023-08-31 23:16:00,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:00,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:16:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:16:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:16:01,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 319 [2023-08-31 23:16:01,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 388 flow. Second operand has 8 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:01,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:01,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 319 [2023-08-31 23:16:01,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:02,879 INFO L130 PetriNetUnfolder]: 9877/14816 cut-off events. [2023-08-31 23:16:02,879 INFO L131 PetriNetUnfolder]: For 21361/21369 co-relation queries the response was YES. [2023-08-31 23:16:02,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49653 conditions, 14816 events. 9877/14816 cut-off events. For 21361/21369 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 89612 event pairs, 2093 based on Foata normal form. 24/14836 useless extension candidates. Maximal degree in co-relation 49630. Up to 9508 conditions per place. [2023-08-31 23:16:02,973 INFO L137 encePairwiseOnDemand]: 310/319 looper letters, 103 selfloop transitions, 18 changer transitions 18/141 dead transitions. [2023-08-31 23:16:02,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 141 transitions, 1146 flow [2023-08-31 23:16:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2023-08-31 23:16:02,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317062248096731 [2023-08-31 23:16:02,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 964 transitions. [2023-08-31 23:16:02,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 964 transitions. [2023-08-31 23:16:02,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:02,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 964 transitions. [2023-08-31 23:16:02,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.71428571428572) internal successors, (964), 7 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:02,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:02,981 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:02,981 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 388 flow. Second operand 7 states and 964 transitions. [2023-08-31 23:16:02,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 141 transitions, 1146 flow [2023-08-31 23:16:03,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 141 transitions, 1138 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:03,468 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 527 flow [2023-08-31 23:16:03,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-08-31 23:16:03,469 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 27 predicate places. [2023-08-31 23:16:03,469 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 527 flow [2023-08-31 23:16:03,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:03,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:03,470 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] [2023-08-31 23:16:03,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:16:03,470 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:03,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1908625660, now seen corresponding path program 3 times [2023-08-31 23:16:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238021957] [2023-08-31 23:16:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:05,268 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:16:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238021957] [2023-08-31 23:16:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238021957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:16:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159840561] [2023-08-31 23:16:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:05,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:16:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:16:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:16:05,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 319 [2023-08-31 23:16:05,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 527 flow. Second operand has 11 states, 11 states have (on average 131.1818181818182) internal successors, (1443), 11 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:05,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:05,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 319 [2023-08-31 23:16:05,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:08,552 INFO L130 PetriNetUnfolder]: 15293/23560 cut-off events. [2023-08-31 23:16:08,552 INFO L131 PetriNetUnfolder]: For 49717/49757 co-relation queries the response was YES. [2023-08-31 23:16:08,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92558 conditions, 23560 events. 15293/23560 cut-off events. For 49717/49757 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 164961 event pairs, 1759 based on Foata normal form. 53/23568 useless extension candidates. Maximal degree in co-relation 92532. Up to 10000 conditions per place. [2023-08-31 23:16:08,707 INFO L137 encePairwiseOnDemand]: 306/319 looper letters, 180 selfloop transitions, 55 changer transitions 83/321 dead transitions. [2023-08-31 23:16:08,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 321 transitions, 2715 flow [2023-08-31 23:16:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:16:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:16:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1848 transitions. [2023-08-31 23:16:08,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44562334217506633 [2023-08-31 23:16:08,711 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1848 transitions. [2023-08-31 23:16:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1848 transitions. [2023-08-31 23:16:08,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:08,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1848 transitions. [2023-08-31 23:16:08,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 142.15384615384616) internal successors, (1848), 13 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:08,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 319.0) internal successors, (4466), 14 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:08,721 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 319.0) internal successors, (4466), 14 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:08,721 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 527 flow. Second operand 13 states and 1848 transitions. [2023-08-31 23:16:08,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 321 transitions, 2715 flow [2023-08-31 23:16:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 321 transitions, 2708 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:09,842 INFO L231 Difference]: Finished difference. Result has 99 places, 113 transitions, 983 flow [2023-08-31 23:16:09,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=983, PETRI_PLACES=99, PETRI_TRANSITIONS=113} [2023-08-31 23:16:09,843 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 44 predicate places. [2023-08-31 23:16:09,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 113 transitions, 983 flow [2023-08-31 23:16:09,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 131.1818181818182) internal successors, (1443), 11 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:09,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:09,844 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] [2023-08-31 23:16:09,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:16:09,844 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:09,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1017128109, now seen corresponding path program 1 times [2023-08-31 23:16:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932556460] [2023-08-31 23:16:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:16,718 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:16:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932556460] [2023-08-31 23:16:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932556460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:16,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:16,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:16:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32978818] [2023-08-31 23:16:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:16,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:16:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:16,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:16:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:16:16,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 319 [2023-08-31 23:16:16,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 113 transitions, 983 flow. Second operand has 9 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:16,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:16,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 319 [2023-08-31 23:16:16,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:19,614 INFO L130 PetriNetUnfolder]: 13704/20852 cut-off events. [2023-08-31 23:16:19,614 INFO L131 PetriNetUnfolder]: For 87588/87865 co-relation queries the response was YES. [2023-08-31 23:16:19,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96976 conditions, 20852 events. 13704/20852 cut-off events. For 87588/87865 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 137116 event pairs, 2478 based on Foata normal form. 304/21105 useless extension candidates. Maximal degree in co-relation 96942. Up to 11566 conditions per place. [2023-08-31 23:16:19,786 INFO L137 encePairwiseOnDemand]: 306/319 looper letters, 138 selfloop transitions, 50 changer transitions 104/297 dead transitions. [2023-08-31 23:16:19,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 297 transitions, 3040 flow [2023-08-31 23:16:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:16:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:16:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1380 transitions. [2023-08-31 23:16:19,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43260188087774293 [2023-08-31 23:16:19,792 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1380 transitions. [2023-08-31 23:16:19,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1380 transitions. [2023-08-31 23:16:19,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:19,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1380 transitions. [2023-08-31 23:16:19,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:19,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 319.0) internal successors, (3509), 11 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:19,800 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 319.0) internal successors, (3509), 11 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:19,800 INFO L175 Difference]: Start difference. First operand has 99 places, 113 transitions, 983 flow. Second operand 10 states and 1380 transitions. [2023-08-31 23:16:19,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 297 transitions, 3040 flow [2023-08-31 23:16:20,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 297 transitions, 2857 flow, removed 80 selfloop flow, removed 6 redundant places. [2023-08-31 23:16:20,613 INFO L231 Difference]: Finished difference. Result has 100 places, 138 transitions, 1323 flow [2023-08-31 23:16:20,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1323, PETRI_PLACES=100, PETRI_TRANSITIONS=138} [2023-08-31 23:16:20,614 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2023-08-31 23:16:20,614 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 138 transitions, 1323 flow [2023-08-31 23:16:20,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:20,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:20,615 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] [2023-08-31 23:16:20,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:16:20,616 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:20,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -621329273, now seen corresponding path program 2 times [2023-08-31 23:16:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416308954] [2023-08-31 23:16:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:21,094 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:16:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416308954] [2023-08-31 23:16:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416308954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:21,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:16:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107784259] [2023-08-31 23:16:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:21,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:16:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:16:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:16:21,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 319 [2023-08-31 23:16:21,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 138 transitions, 1323 flow. Second operand has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:21,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:21,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 319 [2023-08-31 23:16:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:22,808 INFO L130 PetriNetUnfolder]: 8664/13321 cut-off events. [2023-08-31 23:16:22,808 INFO L131 PetriNetUnfolder]: For 70445/70956 co-relation queries the response was YES. [2023-08-31 23:16:22,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66455 conditions, 13321 events. 8664/13321 cut-off events. For 70445/70956 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 89694 event pairs, 789 based on Foata normal form. 377/13316 useless extension candidates. Maximal degree in co-relation 66420. Up to 5240 conditions per place. [2023-08-31 23:16:22,917 INFO L137 encePairwiseOnDemand]: 312/319 looper letters, 157 selfloop transitions, 18 changer transitions 112/300 dead transitions. [2023-08-31 23:16:22,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 300 transitions, 3353 flow [2023-08-31 23:16:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:16:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:16:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1201 transitions. [2023-08-31 23:16:22,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4706112852664577 [2023-08-31 23:16:22,919 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1201 transitions. [2023-08-31 23:16:22,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1201 transitions. [2023-08-31 23:16:22,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:22,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1201 transitions. [2023-08-31 23:16:22,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.125) internal successors, (1201), 8 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:22,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 319.0) internal successors, (2871), 9 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:22,926 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 319.0) internal successors, (2871), 9 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:22,926 INFO L175 Difference]: Start difference. First operand has 100 places, 138 transitions, 1323 flow. Second operand 8 states and 1201 transitions. [2023-08-31 23:16:22,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 300 transitions, 3353 flow [2023-08-31 23:16:23,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 300 transitions, 3200 flow, removed 45 selfloop flow, removed 5 redundant places. [2023-08-31 23:16:23,617 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 873 flow [2023-08-31 23:16:23,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2023-08-31 23:16:23,617 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-31 23:16:23,617 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 873 flow [2023-08-31 23:16:23,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:23,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:23,618 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, 1, 1] [2023-08-31 23:16:23,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:16:23,618 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:23,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1377280744, now seen corresponding path program 1 times [2023-08-31 23:16:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811424688] [2023-08-31 23:16:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:31,807 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:16:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811424688] [2023-08-31 23:16:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811424688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:16:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716521269] [2023-08-31 23:16:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:31,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 319 [2023-08-31 23:16:31,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 873 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:31,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 319 [2023-08-31 23:16:31,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:33,470 INFO L130 PetriNetUnfolder]: 6456/10288 cut-off events. [2023-08-31 23:16:33,471 INFO L131 PetriNetUnfolder]: For 51654/51926 co-relation queries the response was YES. [2023-08-31 23:16:33,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52417 conditions, 10288 events. 6456/10288 cut-off events. For 51654/51926 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 68856 event pairs, 929 based on Foata normal form. 148/10329 useless extension candidates. Maximal degree in co-relation 52383. Up to 5280 conditions per place. [2023-08-31 23:16:33,516 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 92 selfloop transitions, 5 changer transitions 80/182 dead transitions. [2023-08-31 23:16:33,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 182 transitions, 1856 flow [2023-08-31 23:16:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 962 transitions. [2023-08-31 23:16:33,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43081056874160323 [2023-08-31 23:16:33,519 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 962 transitions. [2023-08-31 23:16:33,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 962 transitions. [2023-08-31 23:16:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:33,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 962 transitions. [2023-08-31 23:16:33,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.42857142857142) internal successors, (962), 7 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,524 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 873 flow. Second operand 7 states and 962 transitions. [2023-08-31 23:16:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 182 transitions, 1856 flow [2023-08-31 23:16:33,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 1635 flow, removed 72 selfloop flow, removed 11 redundant places. [2023-08-31 23:16:33,794 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 557 flow [2023-08-31 23:16:33,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2023-08-31 23:16:33,794 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2023-08-31 23:16:33,795 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 557 flow [2023-08-31 23:16:33,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:33,795 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, 1, 1] [2023-08-31 23:16:33,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:16:33,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:33,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -739651416, now seen corresponding path program 2 times [2023-08-31 23:16:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724410444] [2023-08-31 23:16:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:35,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:35,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724410444] [2023-08-31 23:16:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724410444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:35,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-31 23:16:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35382111] [2023-08-31 23:16:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:35,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 23:16:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 23:16:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-31 23:16:36,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 319 [2023-08-31 23:16:36,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 557 flow. Second operand has 12 states, 12 states have (on average 132.33333333333334) internal successors, (1588), 12 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:36,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 319 [2023-08-31 23:16:36,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:37,579 INFO L130 PetriNetUnfolder]: 4529/7321 cut-off events. [2023-08-31 23:16:37,579 INFO L131 PetriNetUnfolder]: For 29263/29294 co-relation queries the response was YES. [2023-08-31 23:16:37,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33941 conditions, 7321 events. 4529/7321 cut-off events. For 29263/29294 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 45832 event pairs, 953 based on Foata normal form. 1/7232 useless extension candidates. Maximal degree in co-relation 33911. Up to 3222 conditions per place. [2023-08-31 23:16:37,616 INFO L137 encePairwiseOnDemand]: 307/319 looper letters, 122 selfloop transitions, 33 changer transitions 51/208 dead transitions. [2023-08-31 23:16:37,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 208 transitions, 1834 flow [2023-08-31 23:16:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 23:16:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 23:16:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2081 transitions. [2023-08-31 23:16:37,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349007314524556 [2023-08-31 23:16:37,619 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2081 transitions. [2023-08-31 23:16:37,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2081 transitions. [2023-08-31 23:16:37,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:37,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2081 transitions. [2023-08-31 23:16:37,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 138.73333333333332) internal successors, (2081), 15 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 319.0) internal successors, (5104), 16 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,628 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 319.0) internal successors, (5104), 16 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,628 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 557 flow. Second operand 15 states and 2081 transitions. [2023-08-31 23:16:37,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 208 transitions, 1834 flow [2023-08-31 23:16:37,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 208 transitions, 1788 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-31 23:16:37,799 INFO L231 Difference]: Finished difference. Result has 106 places, 87 transitions, 743 flow [2023-08-31 23:16:37,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=743, PETRI_PLACES=106, PETRI_TRANSITIONS=87} [2023-08-31 23:16:37,800 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2023-08-31 23:16:37,800 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 87 transitions, 743 flow [2023-08-31 23:16:37,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 132.33333333333334) internal successors, (1588), 12 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:37,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:37,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:16:37,800 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:37,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 162639894, now seen corresponding path program 3 times [2023-08-31 23:16:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:37,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958806048] [2023-08-31 23:16:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:47,445 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:16:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958806048] [2023-08-31 23:16:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958806048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:16:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445576442] [2023-08-31 23:16:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:47,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:16:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:47,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:16:47,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:16:47,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 319 [2023-08-31 23:16:47,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 87 transitions, 743 flow. Second operand has 9 states, 9 states have (on average 128.22222222222223) internal successors, (1154), 9 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:47,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:47,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 319 [2023-08-31 23:16:47,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:48,557 INFO L130 PetriNetUnfolder]: 3938/6504 cut-off events. [2023-08-31 23:16:48,557 INFO L131 PetriNetUnfolder]: For 35088/35190 co-relation queries the response was YES. [2023-08-31 23:16:48,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32496 conditions, 6504 events. 3938/6504 cut-off events. For 35088/35190 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42083 event pairs, 915 based on Foata normal form. 3/6426 useless extension candidates. Maximal degree in co-relation 32462. Up to 3842 conditions per place. [2023-08-31 23:16:48,594 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 98 selfloop transitions, 26 changer transitions 25/153 dead transitions. [2023-08-31 23:16:48,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 153 transitions, 1514 flow [2023-08-31 23:16:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2023-08-31 23:16:48,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278996865203762 [2023-08-31 23:16:48,596 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2023-08-31 23:16:48,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2023-08-31 23:16:48,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:48,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2023-08-31 23:16:48,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:48,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:48,600 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:48,600 INFO L175 Difference]: Start difference. First operand has 106 places, 87 transitions, 743 flow. Second operand 6 states and 819 transitions. [2023-08-31 23:16:48,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 153 transitions, 1514 flow [2023-08-31 23:16:48,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 153 transitions, 1448 flow, removed 22 selfloop flow, removed 8 redundant places. [2023-08-31 23:16:48,771 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 851 flow [2023-08-31 23:16:48,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2023-08-31 23:16:48,771 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2023-08-31 23:16:48,771 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 851 flow [2023-08-31 23:16:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.22222222222223) internal successors, (1154), 9 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:48,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:48,772 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, 1, 1] [2023-08-31 23:16:48,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:16:48,772 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:48,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1553597890, now seen corresponding path program 4 times [2023-08-31 23:16:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867928985] [2023-08-31 23:16:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867928985] [2023-08-31 23:16:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867928985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-31 23:16:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200102176] [2023-08-31 23:16:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 23:16:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 23:16:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-31 23:16:51,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 319 [2023-08-31 23:16:51,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 851 flow. Second operand has 13 states, 13 states have (on average 130.15384615384616) internal successors, (1692), 13 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:51,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:51,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 319 [2023-08-31 23:16:51,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:53,541 INFO L130 PetriNetUnfolder]: 6765/11201 cut-off events. [2023-08-31 23:16:53,541 INFO L131 PetriNetUnfolder]: For 77409/77461 co-relation queries the response was YES. [2023-08-31 23:16:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59059 conditions, 11201 events. 6765/11201 cut-off events. For 77409/77461 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 79552 event pairs, 2195 based on Foata normal form. 3/11044 useless extension candidates. Maximal degree in co-relation 59023. Up to 5297 conditions per place. [2023-08-31 23:16:53,597 INFO L137 encePairwiseOnDemand]: 308/319 looper letters, 178 selfloop transitions, 31 changer transitions 95/306 dead transitions. [2023-08-31 23:16:53,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 306 transitions, 3280 flow [2023-08-31 23:16:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:16:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:16:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1535 transitions. [2023-08-31 23:16:53,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43744656597321174 [2023-08-31 23:16:53,600 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1535 transitions. [2023-08-31 23:16:53,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1535 transitions. [2023-08-31 23:16:53,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:53,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1535 transitions. [2023-08-31 23:16:53,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 139.54545454545453) internal successors, (1535), 11 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:53,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 319.0) internal successors, (3828), 12 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:53,605 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 319.0) internal successors, (3828), 12 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:53,606 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 851 flow. Second operand 11 states and 1535 transitions. [2023-08-31 23:16:53,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 306 transitions, 3280 flow [2023-08-31 23:16:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 306 transitions, 3232 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-31 23:16:54,113 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 1151 flow [2023-08-31 23:16:54,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1151, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2023-08-31 23:16:54,113 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places. [2023-08-31 23:16:54,114 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 1151 flow [2023-08-31 23:16:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 130.15384615384616) internal successors, (1692), 13 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:54,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:54,114 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, 1, 1] [2023-08-31 23:16:54,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:16:54,114 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:54,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2086076412, now seen corresponding path program 5 times [2023-08-31 23:16:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222298775] [2023-08-31 23:16:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:56,934 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:16:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222298775] [2023-08-31 23:16:56,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222298775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:56,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:56,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:16:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059732262] [2023-08-31 23:16:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:56,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:16:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:16:56,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:16:57,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 319 [2023-08-31 23:16:57,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 1151 flow. Second operand has 9 states, 9 states have (on average 133.22222222222223) internal successors, (1199), 9 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:57,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 319 [2023-08-31 23:16:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:58,437 INFO L130 PetriNetUnfolder]: 5871/9889 cut-off events. [2023-08-31 23:16:58,437 INFO L131 PetriNetUnfolder]: For 81063/81320 co-relation queries the response was YES. [2023-08-31 23:16:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54659 conditions, 9889 events. 5871/9889 cut-off events. For 81063/81320 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 71521 event pairs, 1715 based on Foata normal form. 9/9749 useless extension candidates. Maximal degree in co-relation 54618. Up to 6579 conditions per place. [2023-08-31 23:16:58,613 INFO L137 encePairwiseOnDemand]: 310/319 looper letters, 104 selfloop transitions, 36 changer transitions 18/163 dead transitions. [2023-08-31 23:16:58,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 163 transitions, 1869 flow [2023-08-31 23:16:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:16:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:16:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1109 transitions. [2023-08-31 23:16:58,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43456112852664575 [2023-08-31 23:16:58,614 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1109 transitions. [2023-08-31 23:16:58,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1109 transitions. [2023-08-31 23:16:58,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:58,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1109 transitions. [2023-08-31 23:16:58,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.625) internal successors, (1109), 8 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 319.0) internal successors, (2871), 9 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,619 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 319.0) internal successors, (2871), 9 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,619 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 1151 flow. Second operand 8 states and 1109 transitions. [2023-08-31 23:16:58,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 163 transitions, 1869 flow [2023-08-31 23:16:58,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 163 transitions, 1814 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-31 23:16:58,928 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 1352 flow [2023-08-31 23:16:58,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1352, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2023-08-31 23:16:58,929 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 60 predicate places. [2023-08-31 23:16:58,929 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 1352 flow [2023-08-31 23:16:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.22222222222223) internal successors, (1199), 9 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:58,929 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, 1, 1] [2023-08-31 23:16:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:16:58,930 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:16:58,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1184475530, now seen corresponding path program 6 times [2023-08-31 23:16:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915307199] [2023-08-31 23:16:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:17:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915307199] [2023-08-31 23:17:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915307199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-31 23:17:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510369411] [2023-08-31 23:17:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:01,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 23:17:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:17:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 23:17:01,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-08-31 23:17:01,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 319 [2023-08-31 23:17:02,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 1352 flow. Second operand has 12 states, 12 states have (on average 133.33333333333334) internal successors, (1600), 12 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:02,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:02,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 319 [2023-08-31 23:17:02,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:04,367 INFO L130 PetriNetUnfolder]: 8486/14178 cut-off events. [2023-08-31 23:17:04,367 INFO L131 PetriNetUnfolder]: For 136413/136489 co-relation queries the response was YES. [2023-08-31 23:17:04,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81396 conditions, 14178 events. 8486/14178 cut-off events. For 136413/136489 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 105979 event pairs, 3412 based on Foata normal form. 2/13983 useless extension candidates. Maximal degree in co-relation 81355. Up to 6331 conditions per place. [2023-08-31 23:17:04,432 INFO L137 encePairwiseOnDemand]: 308/319 looper letters, 155 selfloop transitions, 39 changer transitions 51/247 dead transitions. [2023-08-31 23:17:04,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 247 transitions, 3097 flow [2023-08-31 23:17:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:17:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:17:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1547 transitions. [2023-08-31 23:17:04,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4408663436876603 [2023-08-31 23:17:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1547 transitions. [2023-08-31 23:17:04,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1547 transitions. [2023-08-31 23:17:04,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:04,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1547 transitions. [2023-08-31 23:17:04,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.63636363636363) internal successors, (1547), 11 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 319.0) internal successors, (3828), 12 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,437 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 319.0) internal successors, (3828), 12 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:04,437 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 1352 flow. Second operand 11 states and 1547 transitions. [2023-08-31 23:17:04,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 247 transitions, 3097 flow [2023-08-31 23:17:05,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 247 transitions, 3075 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-31 23:17:05,147 INFO L231 Difference]: Finished difference. Result has 124 places, 130 transitions, 1808 flow [2023-08-31 23:17:05,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1808, PETRI_PLACES=124, PETRI_TRANSITIONS=130} [2023-08-31 23:17:05,147 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2023-08-31 23:17:05,148 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 130 transitions, 1808 flow [2023-08-31 23:17:05,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 133.33333333333334) internal successors, (1600), 12 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:05,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:05,148 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, 1, 1] [2023-08-31 23:17:05,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:17:05,148 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:05,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash -605091478, now seen corresponding path program 7 times [2023-08-31 23:17:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931972639] [2023-08-31 23:17:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:05,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:05,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:17:05,346 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:05,347 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2023-08-31 23:17:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2023-08-31 23:17:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2023-08-31 23:17:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2023-08-31 23:17:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2023-08-31 23:17:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2023-08-31 23:17:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2023-08-31 23:17:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2023-08-31 23:17:05,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2023-08-31 23:17:05,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2023-08-31 23:17:05,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2023-08-31 23:17:05,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2023-08-31 23:17:05,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2023-08-31 23:17:05,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2023-08-31 23:17:05,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2023-08-31 23:17:05,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2023-08-31 23:17:05,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2023-08-31 23:17:05,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2023-08-31 23:17:05,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:17:05,352 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:05,356 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:05,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:05,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:05 BasicIcfg [2023-08-31 23:17:05,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:05,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:05,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:05,446 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:05,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:05" (3/4) ... [2023-08-31 23:17:05,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:05,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:05,452 INFO L158 Benchmark]: Toolchain (without parser) took 121477.63ms. Allocated memory was 67.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 43.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 744.9MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,453 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:05,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.74ms. Allocated memory is still 67.1MB. Free memory was 42.9MB in the beginning and 30.6MB in the end (delta: 12.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.92ms. Allocated memory is still 67.1MB. Free memory was 30.6MB in the beginning and 43.8MB in the end (delta: -13.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,454 INFO L158 Benchmark]: Boogie Preprocessor took 36.77ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 41.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,454 INFO L158 Benchmark]: RCFGBuilder took 1123.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.0MB in the beginning and 43.9MB in the end (delta: -2.9MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,454 INFO L158 Benchmark]: TraceAbstraction took 119637.55ms. Allocated memory was 81.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 43.4MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 724.8MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,454 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 2.7GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:05,459 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.18ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.74ms. Allocated memory is still 67.1MB. Free memory was 42.9MB in the beginning and 30.6MB in the end (delta: 12.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.92ms. Allocated memory is still 67.1MB. Free memory was 30.6MB in the beginning and 43.8MB in the end (delta: -13.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.77ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 41.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.0MB in the beginning and 43.9MB in the end (delta: -2.9MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 119637.55ms. Allocated memory was 81.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 43.4MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 724.8MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 2.7GB. Free memory was 1.9GB in the beginning and 1.9GB 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: 6.6s, 170 PlacesBefore, 55 PlacesAfterwards, 159 TransitionsBefore, 43 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 7 FixpointIterations, 74 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 156 TotalNumberOfCompositions, 11676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4813, independent: 4553, independent conditional: 0, independent unconditional: 4553, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1917, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4813, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 1917, unknown conditional: 0, unknown unconditional: 1917] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-3, t625={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-2, t625={5:0}, t626={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L890] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L770] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 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: 918]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 923]: 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: 927]: 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: 925]: 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: 921]: 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, 202 locations, 18 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: 119.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2581 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2137 mSDsluCounter, 3095 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2971 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6813 IncrementalHoareTripleChecker+Invalid, 7452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 124 mSDtfsCounter, 6813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1808occurred in iteration=21, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 68.5s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 11636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:05,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/mix023_tso.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:17:07,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:17:07,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:17:07,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:17:07,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:17:07,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:17:07,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:17:07,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:17:07,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:17:07,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:17:07,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:17:07,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:17:07,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:17:07,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:17:07,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:17:07,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:17:07,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:17:07,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:17:07,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:17:07,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:17:07,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:17:07,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:17:07,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:17:07,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:17:07,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:17:07,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:17:07,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:17:07,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:17:07,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:17:07,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:17:07,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:17:07,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:17:07,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:17:07,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:17:07,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:17:07,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:17:07,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:17:07,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:17:07,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:17:07,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:17:07,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:17:07,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:17:07,633 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:17:07,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:17:07,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:17:07,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:17:07,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:17:07,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:17:07,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:17:07,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:17:07,637 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:17:07,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:17:07,638 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:17:07,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:17:07,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:17:07,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:17:07,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:17:07,639 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:17:07,639 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:17:07,639 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:17:07,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:17:07,640 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:17:07,640 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:17:07,640 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:17:07,640 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:17:07,641 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:17:07,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:17:07,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:17:07,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:17:07,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:07,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:17:07,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:17:07,642 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:17:07,642 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:17:07,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:17:07,643 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:17:07,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:17:07,643 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:17:07,644 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:17:07,644 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 -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:17:07,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:17:07,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:17:07,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:17:07,948 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:17:07,949 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:17:07,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-31 23:17:09,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:17:09,449 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:17:09,455 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-31 23:17:09,474 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3109100/cccb5614bf9d463182c47e69edff0e67/FLAG725a7cea3 [2023-08-31 23:17:09,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3109100/cccb5614bf9d463182c47e69edff0e67 [2023-08-31 23:17:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:17:09,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:17:09,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:09,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:17:09,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:17:09,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:09" (1/1) ... [2023-08-31 23:17:09,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1a0c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:09, skipping insertion in model container [2023-08-31 23:17:09,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:09" (1/1) ... [2023-08-31 23:17:09,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:17:09,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:17:09,692 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/mix023_tso.i[944,957] [2023-08-31 23:17:09,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:09,965 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:17:09,978 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/mix023_tso.i[944,957] [2023-08-31 23:17:10,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:10,116 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:10,116 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:10,122 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:17:10,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10 WrapperNode [2023-08-31 23:17:10,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:10,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:10,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:17:10,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:17:10,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,204 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 283 [2023-08-31 23:17:10,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:10,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:17:10,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:17:10,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:17:10,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,267 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:17:10,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:17:10,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:17:10,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:17:10,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (1/1) ... [2023-08-31 23:17:10,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:17:10,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:17:10,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:17:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:17:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:17:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:17:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:17:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:17:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:17:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:17:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:17:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:17:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:17:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:17:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:17:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:17:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:17:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:17:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:17:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:17:10,355 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:17:10,563 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:17:10,565 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:17:11,033 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:17:11,307 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:17:11,307 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:17:11,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11 BoogieIcfgContainer [2023-08-31 23:17:11,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:17:11,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:17:11,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:17:11,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:17:11,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:17:09" (1/3) ... [2023-08-31 23:17:11,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2a59e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:11, skipping insertion in model container [2023-08-31 23:17:11,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:10" (2/3) ... [2023-08-31 23:17:11,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2a59e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:11, skipping insertion in model container [2023-08-31 23:17:11,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11" (3/3) ... [2023-08-31 23:17:11,318 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-08-31 23:17:11,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:17:11,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-31 23:17:11,333 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:17:11,419 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:17:11,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 164 transitions, 348 flow [2023-08-31 23:17:11,542 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:17:11,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 2/160 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/146 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-31 23:17:11,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 164 transitions, 348 flow [2023-08-31 23:17:11,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 160 transitions, 332 flow [2023-08-31 23:17:11,560 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:17:11,580 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 160 transitions, 332 flow [2023-08-31 23:17:11,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 160 transitions, 332 flow [2023-08-31 23:17:11,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 160 transitions, 332 flow [2023-08-31 23:17:11,632 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:17:11,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:11,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 2/160 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/146 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-31 23:17:11,638 INFO L119 LiptonReduction]: Number of co-enabled transitions 3768 [2023-08-31 23:17:20,822 INFO L134 LiptonReduction]: Checked pairs total: 11689 [2023-08-31 23:17:20,822 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-31 23:17:20,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:17:20,838 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;@73dd84b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:17:20,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-31 23:17:20,841 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:17:20,841 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:20,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:20,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:17:20,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:20,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 844, now seen corresponding path program 1 times [2023-08-31 23:17:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:20,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273379648] [2023-08-31 23:17:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:20,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:20,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:17:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:20,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:17:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:20,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:20,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273379648] [2023-08-31 23:17:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273379648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:17:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006737477] [2023-08-31 23:17:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:17:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:17:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:17:20,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 321 [2023-08-31 23:17:20,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:20,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 321 [2023-08-31 23:17:20,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:23,446 INFO L130 PetriNetUnfolder]: 12723/17269 cut-off events. [2023-08-31 23:17:23,446 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-08-31 23:17:23,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34529 conditions, 17269 events. 12723/17269 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 93866 event pairs, 12723 based on Foata normal form. 0/14564 useless extension candidates. Maximal degree in co-relation 34517. Up to 17005 conditions per place. [2023-08-31 23:17:23,574 INFO L137 encePairwiseOnDemand]: 312/321 looper letters, 30 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-31 23:17:23,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 140 flow [2023-08-31 23:17:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:17:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:17:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 329 transitions. [2023-08-31 23:17:23,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124610591900312 [2023-08-31 23:17:23,667 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 329 transitions. [2023-08-31 23:17:23,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 329 transitions. [2023-08-31 23:17:23,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:23,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 329 transitions. [2023-08-31 23:17:23,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 164.5) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,705 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,707 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 329 transitions. [2023-08-31 23:17:23,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 140 flow [2023-08-31 23:17:23,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:23,727 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-31 23:17:23,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-31 23:17:23,732 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:17:23,745 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-31 23:17:23,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:23,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:17:23,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:23,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:23,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 801615048, now seen corresponding path program 1 times [2023-08-31 23:17:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167418743] [2023-08-31 23:17:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:23,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:23,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:23,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:17:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:24,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:24,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:24,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:24,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167418743] [2023-08-31 23:17:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167418743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:17:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030118417] [2023-08-31 23:17:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:24,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 321 [2023-08-31 23:17:24,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:24,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:24,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 321 [2023-08-31 23:17:24,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:25,907 INFO L130 PetriNetUnfolder]: 10485/14347 cut-off events. [2023-08-31 23:17:25,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28614 conditions, 14347 events. 10485/14347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 77246 event pairs, 3373 based on Foata normal form. 0/12798 useless extension candidates. Maximal degree in co-relation 28611. Up to 11801 conditions per place. [2023-08-31 23:17:25,974 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 48 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-31 23:17:25,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 220 flow [2023-08-31 23:17:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-31 23:17:25,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015576323987538 [2023-08-31 23:17:25,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-31 23:17:25,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-31 23:17:25,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:25,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-31 23:17:25,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,983 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 483 transitions. [2023-08-31 23:17:25,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 220 flow [2023-08-31 23:17:25,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:17:25,985 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 78 flow [2023-08-31 23:17:25,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 23:17:25,986 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-31 23:17:25,986 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 78 flow [2023-08-31 23:17:25,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:25,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:25,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:17:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:26,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:26,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2089276192, now seen corresponding path program 1 times [2023-08-31 23:17:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166310406] [2023-08-31 23:17:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:26,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:26,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:26,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:26,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:17:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:26,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:26,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:26,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:26,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166310406] [2023-08-31 23:17:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166310406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:17:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110183695] [2023-08-31 23:17:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:26,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:26,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 321 [2023-08-31 23:17:26,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:26,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 321 [2023-08-31 23:17:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:27,645 INFO L130 PetriNetUnfolder]: 8717/12327 cut-off events. [2023-08-31 23:17:27,645 INFO L131 PetriNetUnfolder]: For 597/597 co-relation queries the response was YES. [2023-08-31 23:17:27,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24868 conditions, 12327 events. 8717/12327 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 70420 event pairs, 1645 based on Foata normal form. 0/11506 useless extension candidates. Maximal degree in co-relation 24864. Up to 9313 conditions per place. [2023-08-31 23:17:27,716 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 40 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-31 23:17:27,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 198 flow [2023-08-31 23:17:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-08-31 23:17:27,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953271028037383 [2023-08-31 23:17:27,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-08-31 23:17:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-08-31 23:17:27,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:27,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-08-31 23:17:27,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,733 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 477 transitions. [2023-08-31 23:17:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 198 flow [2023-08-31 23:17:27,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:27,738 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-31 23:17:27,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:17:27,740 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:17:27,741 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-31 23:17:27,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:27,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:27,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:27,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:27,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1035814124, now seen corresponding path program 1 times [2023-08-31 23:17:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739429935] [2023-08-31 23:17:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:27,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:27,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:27,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:17:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:28,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:28,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:28,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:28,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739429935] [2023-08-31 23:17:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739429935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:28,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640774195] [2023-08-31 23:17:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:28,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:28,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 321 [2023-08-31 23:17:28,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:28,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:28,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 321 [2023-08-31 23:17:28,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:29,233 INFO L130 PetriNetUnfolder]: 5581/7937 cut-off events. [2023-08-31 23:17:29,233 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2023-08-31 23:17:29,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16402 conditions, 7937 events. 5581/7937 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43237 event pairs, 1007 based on Foata normal form. 400/8056 useless extension candidates. Maximal degree in co-relation 16398. Up to 5787 conditions per place. [2023-08-31 23:17:29,260 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 42 selfloop transitions, 5 changer transitions 29/80 dead transitions. [2023-08-31 23:17:29,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 336 flow [2023-08-31 23:17:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2023-08-31 23:17:29,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48161993769470407 [2023-08-31 23:17:29,264 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2023-08-31 23:17:29,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2023-08-31 23:17:29,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:29,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2023-08-31 23:17:29,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,270 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 773 transitions. [2023-08-31 23:17:29,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 336 flow [2023-08-31 23:17:29,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:29,277 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-31 23:17:29,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-31 23:17:29,278 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-31 23:17:29,279 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-31 23:17:29,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:29,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:29,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:29,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:29,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:29,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 715323530, now seen corresponding path program 1 times [2023-08-31 23:17:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707170583] [2023-08-31 23:17:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:29,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:29,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:17:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:29,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:29,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:29,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:29,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707170583] [2023-08-31 23:17:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707170583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019033323] [2023-08-31 23:17:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:29,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:29,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 321 [2023-08-31 23:17:29,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:29,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 321 [2023-08-31 23:17:29,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:30,250 INFO L130 PetriNetUnfolder]: 2653/4025 cut-off events. [2023-08-31 23:17:30,250 INFO L131 PetriNetUnfolder]: For 1334/1334 co-relation queries the response was YES. [2023-08-31 23:17:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 4025 events. 2653/4025 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 21335 event pairs, 535 based on Foata normal form. 256/4168 useless extension candidates. Maximal degree in co-relation 10454. Up to 1635 conditions per place. [2023-08-31 23:17:30,265 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 56 selfloop transitions, 9 changer transitions 29/98 dead transitions. [2023-08-31 23:17:30,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 489 flow [2023-08-31 23:17:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2023-08-31 23:17:30,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48286604361370716 [2023-08-31 23:17:30,270 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 930 transitions. [2023-08-31 23:17:30,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 930 transitions. [2023-08-31 23:17:30,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:30,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 930 transitions. [2023-08-31 23:17:30,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:30,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:30,277 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:30,277 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 930 transitions. [2023-08-31 23:17:30,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 489 flow [2023-08-31 23:17:30,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 482 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:30,287 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-31 23:17:30,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:17:30,288 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:17:30,288 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-31 23:17:30,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:30,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:30,289 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:17:30,298 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:17:30,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:30,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:30,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -905443420, now seen corresponding path program 1 times [2023-08-31 23:17:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057785050] [2023-08-31 23:17:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:30,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:30,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:30,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:30,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:17:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:30,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:17:30,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:30,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:30,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057785050] [2023-08-31 23:17:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057785050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528549264] [2023-08-31 23:17:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:30,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 321 [2023-08-31 23:17:30,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:30,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:30,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 321 [2023-08-31 23:17:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:31,185 INFO L130 PetriNetUnfolder]: 1492/2331 cut-off events. [2023-08-31 23:17:31,185 INFO L131 PetriNetUnfolder]: For 2084/2084 co-relation queries the response was YES. [2023-08-31 23:17:31,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2331 events. 1492/2331 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11657 event pairs, 458 based on Foata normal form. 88/2379 useless extension candidates. Maximal degree in co-relation 6760. Up to 792 conditions per place. [2023-08-31 23:17:31,195 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 68 selfloop transitions, 13 changer transitions 29/114 dead transitions. [2023-08-31 23:17:31,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 114 transitions, 662 flow [2023-08-31 23:17:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2023-08-31 23:17:31,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48286604361370716 [2023-08-31 23:17:31,199 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1085 transitions. [2023-08-31 23:17:31,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1085 transitions. [2023-08-31 23:17:31,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:31,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1085 transitions. [2023-08-31 23:17:31,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:31,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:31,206 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:31,206 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 1085 transitions. [2023-08-31 23:17:31,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 114 transitions, 662 flow [2023-08-31 23:17:31,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 114 transitions, 600 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:31,222 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-31 23:17:31,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-31 23:17:31,223 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2023-08-31 23:17:31,223 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-31 23:17:31,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:31,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:31,224 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] [2023-08-31 23:17:31,236 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 (7)] Ended with exit code 0 [2023-08-31 23:17:31,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:31,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:31,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -813860488, now seen corresponding path program 1 times [2023-08-31 23:17:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868907459] [2023-08-31 23:17:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:31,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:31,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:17:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:31,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:17:31,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:31,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:31,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868907459] [2023-08-31 23:17:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868907459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:17:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077300790] [2023-08-31 23:17:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:31,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 321 [2023-08-31 23:17:31,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:31,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:31,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 321 [2023-08-31 23:17:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:32,144 INFO L130 PetriNetUnfolder]: 1290/1986 cut-off events. [2023-08-31 23:17:32,144 INFO L131 PetriNetUnfolder]: For 1695/1695 co-relation queries the response was YES. [2023-08-31 23:17:32,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 1986 events. 1290/1986 cut-off events. For 1695/1695 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9717 event pairs, 453 based on Foata normal form. 15/1975 useless extension candidates. Maximal degree in co-relation 5575. Up to 792 conditions per place. [2023-08-31 23:17:32,152 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 64 selfloop transitions, 17 changer transitions 15/100 dead transitions. [2023-08-31 23:17:32,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 594 flow [2023-08-31 23:17:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:17:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:17:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1210 transitions. [2023-08-31 23:17:32,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471183800623053 [2023-08-31 23:17:32,160 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1210 transitions. [2023-08-31 23:17:32,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1210 transitions. [2023-08-31 23:17:32,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:32,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1210 transitions. [2023-08-31 23:17:32,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.25) internal successors, (1210), 8 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:32,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:32,167 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 321.0) internal successors, (2889), 9 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:32,168 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1210 transitions. [2023-08-31 23:17:32,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 594 flow [2023-08-31 23:17:32,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 532 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:17:32,186 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-31 23:17:32,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-31 23:17:32,187 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-31 23:17:32,187 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-31 23:17:32,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:32,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:32,188 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, 1, 1] [2023-08-31 23:17:32,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:32,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:32,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:32,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1931038612, now seen corresponding path program 1 times [2023-08-31 23:17:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116347680] [2023-08-31 23:17:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:32,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:32,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:32,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:17:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:32,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:17:32,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:33,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:33,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116347680] [2023-08-31 23:17:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116347680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:33,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490732654] [2023-08-31 23:17:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:33,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:33,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:33,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-31 23:17:33,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:33,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:33,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-31 23:17:33,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:34,332 INFO L130 PetriNetUnfolder]: 1277/1967 cut-off events. [2023-08-31 23:17:34,332 INFO L131 PetriNetUnfolder]: For 1821/1821 co-relation queries the response was YES. [2023-08-31 23:17:34,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 1967 events. 1277/1967 cut-off events. For 1821/1821 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9394 event pairs, 208 based on Foata normal form. 0/1955 useless extension candidates. Maximal degree in co-relation 5516. Up to 1588 conditions per place. [2023-08-31 23:17:34,341 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 62 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-08-31 23:17:34,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 491 flow [2023-08-31 23:17:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2023-08-31 23:17:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4138110072689512 [2023-08-31 23:17:34,345 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2023-08-31 23:17:34,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2023-08-31 23:17:34,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:34,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2023-08-31 23:17:34,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:34,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:34,350 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:34,350 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 6 states and 797 transitions. [2023-08-31 23:17:34,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 491 flow [2023-08-31 23:17:34,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 402 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 23:17:34,359 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 166 flow [2023-08-31 23:17:34,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:17:34,360 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2023-08-31 23:17:34,360 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 166 flow [2023-08-31 23:17:34,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:34,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:34,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:34,375 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 (9)] Ended with exit code 0 [2023-08-31 23:17:34,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:34,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:34,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash -539926149, now seen corresponding path program 1 times [2023-08-31 23:17:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335952315] [2023-08-31 23:17:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:34,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:34,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:17:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:34,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:34,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:54,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:54,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335952315] [2023-08-31 23:17:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335952315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279759368] [2023-08-31 23:17:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:54,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:54,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 321 [2023-08-31 23:17:54,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:54,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:54,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 321 [2023-08-31 23:17:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:55,011 INFO L130 PetriNetUnfolder]: 1800/2843 cut-off events. [2023-08-31 23:17:55,011 INFO L131 PetriNetUnfolder]: For 1497/1497 co-relation queries the response was YES. [2023-08-31 23:17:55,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7341 conditions, 2843 events. 1800/2843 cut-off events. For 1497/1497 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15858 event pairs, 236 based on Foata normal form. 1/2839 useless extension candidates. Maximal degree in co-relation 7333. Up to 1684 conditions per place. [2023-08-31 23:17:55,017 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 53 selfloop transitions, 1 changer transitions 35/92 dead transitions. [2023-08-31 23:17:55,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 556 flow [2023-08-31 23:17:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-08-31 23:17:55,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735202492211838 [2023-08-31 23:17:55,023 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-08-31 23:17:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-08-31 23:17:55,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:55,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-08-31 23:17:55,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:55,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:55,028 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:55,028 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 166 flow. Second operand 5 states and 760 transitions. [2023-08-31 23:17:55,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 556 flow [2023-08-31 23:17:55,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 544 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:55,043 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 168 flow [2023-08-31 23:17:55,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-31 23:17:55,043 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2023-08-31 23:17:55,044 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 168 flow [2023-08-31 23:17:55,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:55,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:55,044 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, 1, 1] [2023-08-31 23:17:55,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:55,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:55,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:55,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2111739129, now seen corresponding path program 2 times [2023-08-31 23:17:55,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:55,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110209416] [2023-08-31 23:17:55,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:17:55,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:55,257 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:55,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:17:55,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:55,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:55,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 23:17:55,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:56,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:56,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110209416] [2023-08-31 23:17:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110209416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229862648] [2023-08-31 23:17:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:56,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 321 [2023-08-31 23:17:56,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 144.85714285714286) internal successors, (1014), 7 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:56,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:56,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 321 [2023-08-31 23:17:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:56,810 INFO L130 PetriNetUnfolder]: 2546/3876 cut-off events. [2023-08-31 23:17:56,810 INFO L131 PetriNetUnfolder]: For 2487/2487 co-relation queries the response was YES. [2023-08-31 23:17:56,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10536 conditions, 3876 events. 2546/3876 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20761 event pairs, 1108 based on Foata normal form. 1/3849 useless extension candidates. Maximal degree in co-relation 10525. Up to 2521 conditions per place. [2023-08-31 23:17:56,823 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 52 selfloop transitions, 6 changer transitions 15/76 dead transitions. [2023-08-31 23:17:56,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 455 flow [2023-08-31 23:17:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-08-31 23:17:56,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2023-08-31 23:17:56,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-08-31 23:17:56,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-08-31 23:17:56,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:56,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-08-31 23:17:56,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:56,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:56,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:56,831 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 168 flow. Second operand 5 states and 755 transitions. [2023-08-31 23:17:56,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 455 flow [2023-08-31 23:17:56,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 448 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:56,865 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 200 flow [2023-08-31 23:17:56,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-31 23:17:56,866 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-31 23:17:56,866 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 200 flow [2023-08-31 23:17:56,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.85714285714286) internal successors, (1014), 7 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:56,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:56,867 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, 1, 1] [2023-08-31 23:17:56,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:57,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:57,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:57,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1383411189, now seen corresponding path program 3 times [2023-08-31 23:17:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279290327] [2023-08-31 23:17:57,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:17:57,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:57,071 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:17:57,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 (12)] Waiting until timeout for monitored process [2023-08-31 23:17:57,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:17:57,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:57,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 23:17:57,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:57,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:57,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:57,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279290327] [2023-08-31 23:17:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279290327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:57,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:17:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087531621] [2023-08-31 23:17:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:57,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:17:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:17:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:17:57,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 321 [2023-08-31 23:17:57,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 144.375) internal successors, (1155), 8 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:57,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:57,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 321 [2023-08-31 23:17:57,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:58,051 INFO L130 PetriNetUnfolder]: 2700/4130 cut-off events. [2023-08-31 23:17:58,052 INFO L131 PetriNetUnfolder]: For 3509/3534 co-relation queries the response was YES. [2023-08-31 23:17:58,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12842 conditions, 4130 events. 2700/4130 cut-off events. For 3509/3534 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22133 event pairs, 1144 based on Foata normal form. 21/4123 useless extension candidates. Maximal degree in co-relation 12831. Up to 2463 conditions per place. [2023-08-31 23:17:58,070 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 53 selfloop transitions, 8 changer transitions 15/79 dead transitions. [2023-08-31 23:17:58,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 497 flow [2023-08-31 23:17:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-08-31 23:17:58,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2023-08-31 23:17:58,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-08-31 23:17:58,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-08-31 23:17:58,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:58,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-08-31 23:17:58,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:58,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:58,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:58,082 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 200 flow. Second operand 5 states and 755 transitions. [2023-08-31 23:17:58,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 497 flow [2023-08-31 23:17:58,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 488 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:58,121 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 236 flow [2023-08-31 23:17:58,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-31 23:17:58,122 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-31 23:17:58,122 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 236 flow [2023-08-31 23:17:58,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.375) internal successors, (1155), 8 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:58,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:58,123 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, 1, 1] [2023-08-31 23:17:58,135 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:17:58,328 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:17:58,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:58,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -617131397, now seen corresponding path program 4 times [2023-08-31 23:17:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839812800] [2023-08-31 23:17:58,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:17:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:58,332 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:17:58,332 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:17:58,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:17:58,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:58,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-31 23:17:58,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:59,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:59,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839812800] [2023-08-31 23:17:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839812800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:59,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:17:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675654120] [2023-08-31 23:17:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:59,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:17:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:17:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:17:59,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 321 [2023-08-31 23:17:59,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:59,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:59,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 321 [2023-08-31 23:17:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:59,642 INFO L130 PetriNetUnfolder]: 2928/4514 cut-off events. [2023-08-31 23:17:59,642 INFO L131 PetriNetUnfolder]: For 5604/5654 co-relation queries the response was YES. [2023-08-31 23:17:59,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15160 conditions, 4514 events. 2928/4514 cut-off events. For 5604/5654 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24844 event pairs, 1144 based on Foata normal form. 41/4527 useless extension candidates. Maximal degree in co-relation 15148. Up to 2316 conditions per place. [2023-08-31 23:17:59,654 INFO L137 encePairwiseOnDemand]: 315/321 looper letters, 53 selfloop transitions, 8 changer transitions 18/82 dead transitions. [2023-08-31 23:17:59,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 545 flow [2023-08-31 23:17:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-08-31 23:17:59,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2023-08-31 23:17:59,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-08-31 23:17:59,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-08-31 23:17:59,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:59,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-08-31 23:17:59,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:59,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:59,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:59,661 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 236 flow. Second operand 5 states and 755 transitions. [2023-08-31 23:17:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 545 flow [2023-08-31 23:17:59,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 534 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:17:59,711 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 268 flow [2023-08-31 23:17:59,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-31 23:17:59,712 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-31 23:17:59,712 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 268 flow [2023-08-31 23:17:59,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:59,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:59,713 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, 1, 1] [2023-08-31 23:17:59,727 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:17:59,923 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:17:59,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-08-31 23:17:59,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash -959055991, now seen corresponding path program 5 times [2023-08-31 23:17:59,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:59,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955157270] [2023-08-31 23:17:59,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:17:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:59,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:59,926 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:17:59,926 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:18:00,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:18:00,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:18:00,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:18:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:18:00,305 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:18:00,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:18:00,306 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2023-08-31 23:18:00,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2023-08-31 23:18:00,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2023-08-31 23:18:00,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2023-08-31 23:18:00,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2023-08-31 23:18:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2023-08-31 23:18:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2023-08-31 23:18:00,326 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:18:00,523 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:18:00,524 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:18:00,528 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:18:00,528 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:18:00,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:18:00 BasicIcfg [2023-08-31 23:18:00,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:18:00,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:18:00,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:18:00,660 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:18:00,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:11" (3/4) ... [2023-08-31 23:18:00,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:18:00,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:18:00,664 INFO L158 Benchmark]: Toolchain (without parser) took 51171.62ms. Allocated memory was 62.9MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 28.7MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 333.4MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,664 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:18:00,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.16ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 28.6MB in the beginning and 63.5MB in the end (delta: -35.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.02ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 59.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,666 INFO L158 Benchmark]: Boogie Preprocessor took 76.62ms. Allocated memory is still 88.1MB. Free memory was 59.7MB in the beginning and 56.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,666 INFO L158 Benchmark]: RCFGBuilder took 1024.61ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 56.9MB in the beginning and 55.5MB in the end (delta: 1.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,667 INFO L158 Benchmark]: TraceAbstraction took 49346.97ms. Allocated memory was 113.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 54.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. [2023-08-31 23:18:00,667 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 2.5GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:18:00,669 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.17ms. Allocated memory is still 62.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.16ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 28.6MB in the beginning and 63.5MB in the end (delta: -35.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.02ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 59.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.62ms. Allocated memory is still 88.1MB. Free memory was 59.7MB in the beginning and 56.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1024.61ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 56.9MB in the beginning and 55.5MB in the end (delta: 1.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49346.97ms. Allocated memory was 113.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 54.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 2.5GB. Free memory is still 2.1GB. 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: 9.2s, 171 PlacesBefore, 55 PlacesAfterwards, 160 TransitionsBefore, 43 TransitionsAfterwards, 3768 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 157 TotalNumberOfCompositions, 11689 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4999, independent: 4739, independent conditional: 0, independent unconditional: 4739, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1937, independent: 1892, independent conditional: 0, independent unconditional: 1892, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4999, independent: 2847, independent conditional: 0, independent unconditional: 2847, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 1937, unknown conditional: 0, unknown unconditional: 1937] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 223, Positive conditional cache size: 0, Positive unconditional cache size: 223, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=0, t625={-16777232:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=1, t625={-16777232:0}, t626={-16777228:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=2, t625={-16777232:0}, t626={-16777228:0}, t627={-16777218:0}, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L926] 0 pthread_t t628; [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=3, t625={-16777232:0}, t626={-16777228:0}, t627={-16777218:0}, t628={-16777220:0}, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={-16777232:0}, t626={-16777228:0}, t627={-16777218:0}, t628={-16777220:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 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: 918]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 923]: 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: 927]: 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: 925]: 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: 921]: 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, 203 locations, 18 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: 49.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 672 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2533 IncrementalHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 35 mSDtfsCounter, 2533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=12, InterpolantAutomatonStates: 60, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 21 QuantifiedInterpolants, 2872 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2453 ConjunctsInSsa, 108 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:18:00,691 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