./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:50:12,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:50:12,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:50:12,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:50:12,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:50:12,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:50:12,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:50:12,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:50:12,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:50:12,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:50:12,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:50:12,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:50:12,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:50:12,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:50:12,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:50:12,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:50:12,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:50:12,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:50:12,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:50:12,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:50:12,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:50:12,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:50:12,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:50:12,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:50:12,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:50:12,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:50:12,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:50:12,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:50:12,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:50:12,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:50:12,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:50:12,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:50:12,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:50:12,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:50:12,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:50:12,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:50:12,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:50:12,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:50:12,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:50:12,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:50:12,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:50:12,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:50:12,970 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:50:12,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:50:12,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:50:12,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:50:12,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:50:12,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:50:12,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:50:12,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:50:12,972 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:50:12,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:50:12,972 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:50:12,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:50:12,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:50:12,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:50:12,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:12,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:50:12,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:50:12,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:50:12,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:50:12,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:50:12,975 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:50:12,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:50:12,976 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:50:12,976 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:50:13,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:50:13,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:50:13,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:50:13,246 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:50:13,246 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:50:13,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:14,297 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:50:14,487 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:50:14,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:14,495 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7addd4b/ea948e4733e44ba49ab6739a81a683ed/FLAGfcbbc601e [2023-08-29 20:50:14,504 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7addd4b/ea948e4733e44ba49ab6739a81a683ed [2023-08-29 20:50:14,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:50:14,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:50:14,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:14,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:50:14,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:50:14,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff9d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14, skipping insertion in model container [2023-08-29 20:50:14,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:50:14,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:50:14,638 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:14,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:14,813 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:50:14,822 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:14,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:14,899 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:14,899 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:14,903 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:50:14,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14 WrapperNode [2023-08-29 20:50:14,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:14,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:14,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:50:14,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:50:14,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,962 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-29 20:50:14,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:14,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:50:14,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:50:14,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:50:14,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:14,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:15,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:15,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:15,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:15,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:50:15,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:50:15,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:50:15,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:50:15,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (1/1) ... [2023-08-29 20:50:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:50:15,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:50:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:50:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:50:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:50:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:50:15,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:50:15,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:50:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:50:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:50:15,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:50:15,057 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:50:15,169 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:50:15,171 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:50:15,408 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:50:15,531 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:50:15,531 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:50:15,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:15 BoogieIcfgContainer [2023-08-29 20:50:15,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:50:15,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:50:15,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:50:15,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:50:15,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:50:14" (1/3) ... [2023-08-29 20:50:15,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea1281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:15, skipping insertion in model container [2023-08-29 20:50:15,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:14" (2/3) ... [2023-08-29 20:50:15,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea1281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:15, skipping insertion in model container [2023-08-29 20:50:15,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:15" (3/3) ... [2023-08-29 20:50:15,539 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:15,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:50:15,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:50:15,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:50:15,593 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:50:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2023-08-29 20:50:15,644 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2023-08-29 20:50:15,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:15,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-29 20:50:15,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2023-08-29 20:50:15,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2023-08-29 20:50:15,652 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:50:15,657 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-29 20:50:15,659 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-29 20:50:15,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 190 flow [2023-08-29 20:50:15,673 INFO L130 PetriNetUnfolder]: 2/92 cut-off events. [2023-08-29 20:50:15,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:15,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-29 20:50:15,675 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-29 20:50:18,385 INFO L134 LiptonReduction]: Checked pairs total: 3168 [2023-08-29 20:50:18,385 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-29 20:50:18,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:50:18,398 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;@39f9fc6a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:50:18,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:50:18,400 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:50:18,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:18,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:18,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:50:18,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:18,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 430, now seen corresponding path program 1 times [2023-08-29 20:50:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833446338] [2023-08-29 20:50:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833446338] [2023-08-29 20:50:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833446338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:50:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756443262] [2023-08-29 20:50:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:18,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:50:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:50:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:50:18,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 186 [2023-08-29 20:50:18,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:18,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 186 [2023-08-29 20:50:18,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:18,649 INFO L130 PetriNetUnfolder]: 235/414 cut-off events. [2023-08-29 20:50:18,649 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:50:18,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 414 events. 235/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1753 event pairs, 235 based on Foata normal form. 20/335 useless extension candidates. Maximal degree in co-relation 822. Up to 405 conditions per place. [2023-08-29 20:50:18,652 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-29 20:50:18,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-29 20:50:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:50:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:50:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 189 transitions. [2023-08-29 20:50:18,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2023-08-29 20:50:18,661 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 189 transitions. [2023-08-29 20:50:18,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 189 transitions. [2023-08-29 20:50:18,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:18,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 189 transitions. [2023-08-29 20:50:18,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,668 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,669 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 189 transitions. [2023-08-29 20:50:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-29 20:50:18,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:18,672 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-29 20:50:18,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-29 20:50:18,675 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:50:18,675 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-29 20:50:18,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:18,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:50:18,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:50:18,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:18,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 408486797, now seen corresponding path program 1 times [2023-08-29 20:50:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633362557] [2023-08-29 20:50:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633362557] [2023-08-29 20:50:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633362557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:50:18,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526574354] [2023-08-29 20:50:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:18,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:50:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:18,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:50:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:50:18,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 186 [2023-08-29 20:50:18,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:18,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 186 [2023-08-29 20:50:18,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:18,968 INFO L130 PetriNetUnfolder]: 183/353 cut-off events. [2023-08-29 20:50:18,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:18,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 353 events. 183/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1547 event pairs, 27 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 683. Up to 253 conditions per place. [2023-08-29 20:50:18,970 INFO L137 encePairwiseOnDemand]: 183/186 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-29 20:50:18,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 116 flow [2023-08-29 20:50:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:50:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:50:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2023-08-29 20:50:18,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910394265232975 [2023-08-29 20:50:18,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2023-08-29 20:50:18,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2023-08-29 20:50:18,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:18,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2023-08-29 20:50:18,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,975 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 274 transitions. [2023-08-29 20:50:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 116 flow [2023-08-29 20:50:18,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:18,976 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2023-08-29 20:50:18,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-08-29 20:50:18,977 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:50:18,977 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 42 flow [2023-08-29 20:50:18,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:18,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:18,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:50:18,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:18,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1589029504, now seen corresponding path program 1 times [2023-08-29 20:50:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733064029] [2023-08-29 20:50:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733064029] [2023-08-29 20:50:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733064029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199558613] [2023-08-29 20:50:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:19,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 186 [2023-08-29 20:50:19,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:19,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 186 [2023-08-29 20:50:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:19,355 INFO L130 PetriNetUnfolder]: 111/209 cut-off events. [2023-08-29 20:50:19,356 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:50:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 209 events. 111/209 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 762 event pairs, 48 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 440. Up to 195 conditions per place. [2023-08-29 20:50:19,357 INFO L137 encePairwiseOnDemand]: 183/186 looper letters, 15 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2023-08-29 20:50:19,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2023-08-29 20:50:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2023-08-29 20:50:19,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4112903225806452 [2023-08-29 20:50:19,359 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 306 transitions. [2023-08-29 20:50:19,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions. [2023-08-29 20:50:19,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:19,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions. [2023-08-29 20:50:19,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 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-29 20:50:19,362 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 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-29 20:50:19,362 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 42 flow. Second operand 4 states and 306 transitions. [2023-08-29 20:50:19,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2023-08-29 20:50:19,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:19,363 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-29 20:50:19,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-29 20:50:19,364 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -6 predicate places. [2023-08-29 20:50:19,364 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-29 20:50:19,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:19,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:50:19,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:19,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1589029486, now seen corresponding path program 1 times [2023-08-29 20:50:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649875701] [2023-08-29 20:50:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649875701] [2023-08-29 20:50:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649875701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:19,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21054655] [2023-08-29 20:50:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:19,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 186 [2023-08-29 20:50:19,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:19,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 186 [2023-08-29 20:50:19,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:19,608 INFO L130 PetriNetUnfolder]: 147/282 cut-off events. [2023-08-29 20:50:19,608 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:50:19,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 282 events. 147/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1098 event pairs, 68 based on Foata normal form. 20/302 useless extension candidates. Maximal degree in co-relation 569. Up to 229 conditions per place. [2023-08-29 20:50:19,612 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 19 selfloop transitions, 3 changer transitions 11/34 dead transitions. [2023-08-29 20:50:19,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 146 flow [2023-08-29 20:50:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2023-08-29 20:50:19,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2023-08-29 20:50:19,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 430 transitions. [2023-08-29 20:50:19,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 430 transitions. [2023-08-29 20:50:19,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:19,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 430 transitions. [2023-08-29 20:50:19,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,620 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 430 transitions. [2023-08-29 20:50:19,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 146 flow [2023-08-29 20:50:19,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:19,621 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 64 flow [2023-08-29 20:50:19,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-08-29 20:50:19,622 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-29 20:50:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 64 flow [2023-08-29 20:50:19,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:19,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:19,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:50:19,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:19,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2015295424, now seen corresponding path program 1 times [2023-08-29 20:50:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23829235] [2023-08-29 20:50:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:20,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23829235] [2023-08-29 20:50:20,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23829235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:20,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:20,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250693401] [2023-08-29 20:50:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:20,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:20,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:20,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:20,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 186 [2023-08-29 20:50:20,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:20,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 186 [2023-08-29 20:50:20,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:20,334 INFO L130 PetriNetUnfolder]: 215/387 cut-off events. [2023-08-29 20:50:20,335 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2023-08-29 20:50:20,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 387 events. 215/387 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1479 event pairs, 22 based on Foata normal form. 27/414 useless extension candidates. Maximal degree in co-relation 974. Up to 252 conditions per place. [2023-08-29 20:50:20,336 INFO L137 encePairwiseOnDemand]: 176/186 looper letters, 27 selfloop transitions, 10 changer transitions 20/57 dead transitions. [2023-08-29 20:50:20,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 57 transitions, 288 flow [2023-08-29 20:50:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:50:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:50:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 689 transitions. [2023-08-29 20:50:20,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115890083632019 [2023-08-29 20:50:20,338 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 689 transitions. [2023-08-29 20:50:20,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 689 transitions. [2023-08-29 20:50:20,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:20,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 689 transitions. [2023-08-29 20:50:20,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.55555555555556) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,342 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,342 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 64 flow. Second operand 9 states and 689 transitions. [2023-08-29 20:50:20,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 57 transitions, 288 flow [2023-08-29 20:50:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:20,344 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 138 flow [2023-08-29 20:50:20,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-29 20:50:20,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-29 20:50:20,345 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 138 flow [2023-08-29 20:50:20,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:20,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:20,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:50:20,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:20,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1378803067, now seen corresponding path program 1 times [2023-08-29 20:50:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687116822] [2023-08-29 20:50:20,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687116822] [2023-08-29 20:50:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687116822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:20,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:20,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635369475] [2023-08-29 20:50:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:20,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 186 [2023-08-29 20:50:20,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:20,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:20,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 186 [2023-08-29 20:50:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:21,129 INFO L130 PetriNetUnfolder]: 213/384 cut-off events. [2023-08-29 20:50:21,129 INFO L131 PetriNetUnfolder]: For 999/999 co-relation queries the response was YES. [2023-08-29 20:50:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 384 events. 213/384 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1438 event pairs, 40 based on Foata normal form. 18/402 useless extension candidates. Maximal degree in co-relation 1479. Up to 272 conditions per place. [2023-08-29 20:50:21,131 INFO L137 encePairwiseOnDemand]: 176/186 looper letters, 28 selfloop transitions, 13 changer transitions 13/54 dead transitions. [2023-08-29 20:50:21,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 401 flow [2023-08-29 20:50:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2023-08-29 20:50:21,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43637992831541217 [2023-08-29 20:50:21,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 487 transitions. [2023-08-29 20:50:21,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 487 transitions. [2023-08-29 20:50:21,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:21,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 487 transitions. [2023-08-29 20:50:21,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,136 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,136 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 138 flow. Second operand 6 states and 487 transitions. [2023-08-29 20:50:21,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 401 flow [2023-08-29 20:50:21,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 375 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:21,142 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 226 flow [2023-08-29 20:50:21,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-29 20:50:21,144 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-29 20:50:21,144 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 226 flow [2023-08-29 20:50:21,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:21,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:21,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:50:21,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:21,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1377217417, now seen corresponding path program 2 times [2023-08-29 20:50:21,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630176460] [2023-08-29 20:50:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:21,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630176460] [2023-08-29 20:50:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630176460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:21,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100577655] [2023-08-29 20:50:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:21,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:21,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:21,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2023-08-29 20:50:21,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:21,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2023-08-29 20:50:21,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:21,635 INFO L130 PetriNetUnfolder]: 213/394 cut-off events. [2023-08-29 20:50:21,635 INFO L131 PetriNetUnfolder]: For 1347/1355 co-relation queries the response was YES. [2023-08-29 20:50:21,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 394 events. 213/394 cut-off events. For 1347/1355 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1584 event pairs, 55 based on Foata normal form. 27/421 useless extension candidates. Maximal degree in co-relation 1763. Up to 269 conditions per place. [2023-08-29 20:50:21,638 INFO L137 encePairwiseOnDemand]: 178/186 looper letters, 40 selfloop transitions, 15 changer transitions 17/76 dead transitions. [2023-08-29 20:50:21,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 686 flow [2023-08-29 20:50:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:50:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:50:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 668 transitions. [2023-08-29 20:50:21,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489247311827957 [2023-08-29 20:50:21,640 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 668 transitions. [2023-08-29 20:50:21,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 668 transitions. [2023-08-29 20:50:21,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:21,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 668 transitions. [2023-08-29 20:50:21,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 83.5) internal successors, (668), 8 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,643 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,643 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 226 flow. Second operand 8 states and 668 transitions. [2023-08-29 20:50:21,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 686 flow [2023-08-29 20:50:21,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 667 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:21,647 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 384 flow [2023-08-29 20:50:21,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=384, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-29 20:50:21,648 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-08-29 20:50:21,648 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 384 flow [2023-08-29 20:50:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:21,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:21,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:21,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:50:21,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:21,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1950895711, now seen corresponding path program 3 times [2023-08-29 20:50:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754099631] [2023-08-29 20:50:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754099631] [2023-08-29 20:50:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754099631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524840932] [2023-08-29 20:50:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:22,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 186 [2023-08-29 20:50:22,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:22,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 186 [2023-08-29 20:50:22,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:22,144 INFO L130 PetriNetUnfolder]: 198/369 cut-off events. [2023-08-29 20:50:22,144 INFO L131 PetriNetUnfolder]: For 1976/1998 co-relation queries the response was YES. [2023-08-29 20:50:22,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 369 events. 198/369 cut-off events. For 1976/1998 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1454 event pairs, 55 based on Foata normal form. 37/406 useless extension candidates. Maximal degree in co-relation 1925. Up to 275 conditions per place. [2023-08-29 20:50:22,146 INFO L137 encePairwiseOnDemand]: 180/186 looper letters, 39 selfloop transitions, 11 changer transitions 11/65 dead transitions. [2023-08-29 20:50:22,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 685 flow [2023-08-29 20:50:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2023-08-29 20:50:22,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525089605734767 [2023-08-29 20:50:22,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 505 transitions. [2023-08-29 20:50:22,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 505 transitions. [2023-08-29 20:50:22,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:22,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 505 transitions. [2023-08-29 20:50:22,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,151 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,151 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 384 flow. Second operand 6 states and 505 transitions. [2023-08-29 20:50:22,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 685 flow [2023-08-29 20:50:22,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 661 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:22,156 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 440 flow [2023-08-29 20:50:22,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-29 20:50:22,156 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2023-08-29 20:50:22,157 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 440 flow [2023-08-29 20:50:22,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:22,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:22,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:50:22,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:22,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -287068000, now seen corresponding path program 1 times [2023-08-29 20:50:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999434695] [2023-08-29 20:50:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999434695] [2023-08-29 20:50:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999434695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:22,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:22,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404641943] [2023-08-29 20:50:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:22,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:22,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 186 [2023-08-29 20:50:22,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:22,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 186 [2023-08-29 20:50:22,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:22,835 INFO L130 PetriNetUnfolder]: 214/388 cut-off events. [2023-08-29 20:50:22,836 INFO L131 PetriNetUnfolder]: For 2105/2105 co-relation queries the response was YES. [2023-08-29 20:50:22,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 388 events. 214/388 cut-off events. For 2105/2105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1488 event pairs, 26 based on Foata normal form. 15/403 useless extension candidates. Maximal degree in co-relation 2157. Up to 262 conditions per place. [2023-08-29 20:50:22,838 INFO L137 encePairwiseOnDemand]: 176/186 looper letters, 46 selfloop transitions, 31 changer transitions 13/90 dead transitions. [2023-08-29 20:50:22,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 989 flow [2023-08-29 20:50:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:50:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:50:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 792 transitions. [2023-08-29 20:50:22,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2023-08-29 20:50:22,841 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 792 transitions. [2023-08-29 20:50:22,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 792 transitions. [2023-08-29 20:50:22,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:22,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 792 transitions. [2023-08-29 20:50:22,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.2) internal successors, (792), 10 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,846 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,846 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 440 flow. Second operand 10 states and 792 transitions. [2023-08-29 20:50:22,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 989 flow [2023-08-29 20:50:22,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 954 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:22,852 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 703 flow [2023-08-29 20:50:22,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=703, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-29 20:50:22,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2023-08-29 20:50:22,854 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 703 flow [2023-08-29 20:50:22,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:22,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:22,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:22,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:50:22,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:22,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1407351174, now seen corresponding path program 2 times [2023-08-29 20:50:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544623384] [2023-08-29 20:50:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544623384] [2023-08-29 20:50:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544623384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:50:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167847008] [2023-08-29 20:50:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:23,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:50:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:50:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:50:23,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 186 [2023-08-29 20:50:23,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 703 flow. Second operand has 8 states, 8 states have (on average 69.375) internal successors, (555), 8 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:23,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 186 [2023-08-29 20:50:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:23,607 INFO L130 PetriNetUnfolder]: 224/407 cut-off events. [2023-08-29 20:50:23,607 INFO L131 PetriNetUnfolder]: For 3567/3567 co-relation queries the response was YES. [2023-08-29 20:50:23,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 407 events. 224/407 cut-off events. For 3567/3567 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1594 event pairs, 26 based on Foata normal form. 16/423 useless extension candidates. Maximal degree in co-relation 2580. Up to 252 conditions per place. [2023-08-29 20:50:23,611 INFO L137 encePairwiseOnDemand]: 175/186 looper letters, 46 selfloop transitions, 36 changer transitions 11/93 dead transitions. [2023-08-29 20:50:23,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 1201 flow [2023-08-29 20:50:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:50:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:50:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 598 transitions. [2023-08-29 20:50:23,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4018817204301075 [2023-08-29 20:50:23,613 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 598 transitions. [2023-08-29 20:50:23,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 598 transitions. [2023-08-29 20:50:23,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:23,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 598 transitions. [2023-08-29 20:50:23,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 74.75) internal successors, (598), 8 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,616 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,616 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 703 flow. Second operand 8 states and 598 transitions. [2023-08-29 20:50:23,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 1201 flow [2023-08-29 20:50:23,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 1129 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-29 20:50:23,626 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 889 flow [2023-08-29 20:50:23,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=889, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-08-29 20:50:23,627 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2023-08-29 20:50:23,628 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 889 flow [2023-08-29 20:50:23,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 69.375) internal successors, (555), 8 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:23,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:23,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:50:23,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:23,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1946187718, now seen corresponding path program 1 times [2023-08-29 20:50:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:23,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994912151] [2023-08-29 20:50:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994912151] [2023-08-29 20:50:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994912151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290788003] [2023-08-29 20:50:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:23,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 186 [2023-08-29 20:50:23,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 889 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:23,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 186 [2023-08-29 20:50:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:23,866 INFO L130 PetriNetUnfolder]: 245/467 cut-off events. [2023-08-29 20:50:23,866 INFO L131 PetriNetUnfolder]: For 4577/4619 co-relation queries the response was YES. [2023-08-29 20:50:23,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 467 events. 245/467 cut-off events. For 4577/4619 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2056 event pairs, 62 based on Foata normal form. 53/519 useless extension candidates. Maximal degree in co-relation 3046. Up to 226 conditions per place. [2023-08-29 20:50:23,869 INFO L137 encePairwiseOnDemand]: 182/186 looper letters, 53 selfloop transitions, 6 changer transitions 22/86 dead transitions. [2023-08-29 20:50:23,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 1246 flow [2023-08-29 20:50:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2023-08-29 20:50:23,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612903225806452 [2023-08-29 20:50:23,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2023-08-29 20:50:23,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2023-08-29 20:50:23,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:23,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2023-08-29 20:50:23,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,874 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,874 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 889 flow. Second operand 5 states and 429 transitions. [2023-08-29 20:50:23,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 1246 flow [2023-08-29 20:50:23,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 1204 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-29 20:50:23,885 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 725 flow [2023-08-29 20:50:23,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=725, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-29 20:50:23,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2023-08-29 20:50:23,885 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 725 flow [2023-08-29 20:50:23,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:23,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:23,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:23,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:50:23,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:23,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash -348252294, now seen corresponding path program 3 times [2023-08-29 20:50:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202434414] [2023-08-29 20:50:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202434414] [2023-08-29 20:50:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202434414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104854549] [2023-08-29 20:50:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:24,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 186 [2023-08-29 20:50:24,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 725 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:24,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:24,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 186 [2023-08-29 20:50:24,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:24,593 INFO L130 PetriNetUnfolder]: 228/460 cut-off events. [2023-08-29 20:50:24,593 INFO L131 PetriNetUnfolder]: For 4972/4972 co-relation queries the response was YES. [2023-08-29 20:50:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 460 events. 228/460 cut-off events. For 4972/4972 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 56 based on Foata normal form. 27/487 useless extension candidates. Maximal degree in co-relation 2897. Up to 250 conditions per place. [2023-08-29 20:50:24,596 INFO L137 encePairwiseOnDemand]: 177/186 looper letters, 34 selfloop transitions, 33 changer transitions 23/90 dead transitions. [2023-08-29 20:50:24,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 1278 flow [2023-08-29 20:50:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:50:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:50:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2023-08-29 20:50:24,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260752688172043 [2023-08-29 20:50:24,598 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 634 transitions. [2023-08-29 20:50:24,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 634 transitions. [2023-08-29 20:50:24,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:24,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 634 transitions. [2023-08-29 20:50:24,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.25) internal successors, (634), 8 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:24,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:24,601 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:24,601 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 725 flow. Second operand 8 states and 634 transitions. [2023-08-29 20:50:24,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 1278 flow [2023-08-29 20:50:24,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 1208 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-29 20:50:24,611 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 800 flow [2023-08-29 20:50:24,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=800, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-08-29 20:50:24,611 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2023-08-29 20:50:24,611 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 800 flow [2023-08-29 20:50:24,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:24,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:24,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:24,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:50:24,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:24,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -38826598, now seen corresponding path program 1 times [2023-08-29 20:50:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940910204] [2023-08-29 20:50:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940910204] [2023-08-29 20:50:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940910204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:50:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592637382] [2023-08-29 20:50:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:50:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:50:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:50:25,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2023-08-29 20:50:25,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 800 flow. Second operand has 8 states, 8 states have (on average 78.5) internal successors, (628), 8 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:25,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2023-08-29 20:50:25,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:25,237 INFO L130 PetriNetUnfolder]: 187/382 cut-off events. [2023-08-29 20:50:25,237 INFO L131 PetriNetUnfolder]: For 4348/4365 co-relation queries the response was YES. [2023-08-29 20:50:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 382 events. 187/382 cut-off events. For 4348/4365 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1671 event pairs, 70 based on Foata normal form. 24/406 useless extension candidates. Maximal degree in co-relation 2605. Up to 310 conditions per place. [2023-08-29 20:50:25,240 INFO L137 encePairwiseOnDemand]: 179/186 looper letters, 44 selfloop transitions, 8 changer transitions 16/72 dead transitions. [2023-08-29 20:50:25,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 1074 flow [2023-08-29 20:50:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 575 transitions. [2023-08-29 20:50:25,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4416282642089094 [2023-08-29 20:50:25,241 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 575 transitions. [2023-08-29 20:50:25,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 575 transitions. [2023-08-29 20:50:25,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:25,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 575 transitions. [2023-08-29 20:50:25,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,244 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,244 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 800 flow. Second operand 7 states and 575 transitions. [2023-08-29 20:50:25,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 1074 flow [2023-08-29 20:50:25,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 1013 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:50:25,254 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 707 flow [2023-08-29 20:50:25,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=707, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2023-08-29 20:50:25,255 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2023-08-29 20:50:25,255 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 707 flow [2023-08-29 20:50:25,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.5) internal successors, (628), 8 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:25,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:25,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:50:25,256 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:25,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1364025144, now seen corresponding path program 2 times [2023-08-29 20:50:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457159496] [2023-08-29 20:50:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457159496] [2023-08-29 20:50:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457159496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:25,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:50:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605656477] [2023-08-29 20:50:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:50:25,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:50:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:50:25,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 186 [2023-08-29 20:50:25,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 707 flow. Second operand has 8 states, 8 states have (on average 79.5) internal successors, (636), 8 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:25,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 186 [2023-08-29 20:50:25,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:25,777 INFO L130 PetriNetUnfolder]: 173/354 cut-off events. [2023-08-29 20:50:25,777 INFO L131 PetriNetUnfolder]: For 3589/3601 co-relation queries the response was YES. [2023-08-29 20:50:25,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 354 events. 173/354 cut-off events. For 3589/3601 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1504 event pairs, 71 based on Foata normal form. 18/372 useless extension candidates. Maximal degree in co-relation 2266. Up to 302 conditions per place. [2023-08-29 20:50:25,779 INFO L137 encePairwiseOnDemand]: 180/186 looper letters, 40 selfloop transitions, 5 changer transitions 13/62 dead transitions. [2023-08-29 20:50:25,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 62 transitions, 916 flow [2023-08-29 20:50:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 500 transitions. [2023-08-29 20:50:25,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2023-08-29 20:50:25,781 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 500 transitions. [2023-08-29 20:50:25,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 500 transitions. [2023-08-29 20:50:25,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:25,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 500 transitions. [2023-08-29 20:50:25,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,783 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,783 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 707 flow. Second operand 6 states and 500 transitions. [2023-08-29 20:50:25,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 62 transitions, 916 flow [2023-08-29 20:50:25,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 872 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-29 20:50:25,790 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 635 flow [2023-08-29 20:50:25,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2023-08-29 20:50:25,791 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2023-08-29 20:50:25,791 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 635 flow [2023-08-29 20:50:25,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.5) internal successors, (636), 8 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:25,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:25,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:25,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:50:25,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:25,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2093517142, now seen corresponding path program 3 times [2023-08-29 20:50:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513730374] [2023-08-29 20:50:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513730374] [2023-08-29 20:50:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513730374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:50:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704924545] [2023-08-29 20:50:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:50:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:50:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:50:26,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 186 [2023-08-29 20:50:26,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:26,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 186 [2023-08-29 20:50:26,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:26,388 INFO L130 PetriNetUnfolder]: 176/370 cut-off events. [2023-08-29 20:50:26,388 INFO L131 PetriNetUnfolder]: For 2822/2831 co-relation queries the response was YES. [2023-08-29 20:50:26,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 370 events. 176/370 cut-off events. For 2822/2831 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1652 event pairs, 21 based on Foata normal form. 26/396 useless extension candidates. Maximal degree in co-relation 2085. Up to 169 conditions per place. [2023-08-29 20:50:26,390 INFO L137 encePairwiseOnDemand]: 180/186 looper letters, 29 selfloop transitions, 9 changer transitions 22/63 dead transitions. [2023-08-29 20:50:26,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 876 flow [2023-08-29 20:50:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 586 transitions. [2023-08-29 20:50:26,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4500768049155146 [2023-08-29 20:50:26,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 586 transitions. [2023-08-29 20:50:26,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 586 transitions. [2023-08-29 20:50:26,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:26,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 586 transitions. [2023-08-29 20:50:26,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.71428571428571) internal successors, (586), 7 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,395 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,395 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 635 flow. Second operand 7 states and 586 transitions. [2023-08-29 20:50:26,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 876 flow [2023-08-29 20:50:26,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 779 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-08-29 20:50:26,401 INFO L231 Difference]: Finished difference. Result has 67 places, 35 transitions, 420 flow [2023-08-29 20:50:26,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=67, PETRI_TRANSITIONS=35} [2023-08-29 20:50:26,402 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2023-08-29 20:50:26,402 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 35 transitions, 420 flow [2023-08-29 20:50:26,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:26,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:26,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:50:26,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:26,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -163507980, now seen corresponding path program 1 times [2023-08-29 20:50:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235020198] [2023-08-29 20:50:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235020198] [2023-08-29 20:50:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235020198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:26,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557700979] [2023-08-29 20:50:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:26,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:26,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 186 [2023-08-29 20:50:26,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 35 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:26,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 186 [2023-08-29 20:50:26,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:26,640 INFO L130 PetriNetUnfolder]: 49/132 cut-off events. [2023-08-29 20:50:26,640 INFO L131 PetriNetUnfolder]: For 883/887 co-relation queries the response was YES. [2023-08-29 20:50:26,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 132 events. 49/132 cut-off events. For 883/887 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 468 event pairs, 11 based on Foata normal form. 22/154 useless extension candidates. Maximal degree in co-relation 667. Up to 60 conditions per place. [2023-08-29 20:50:26,641 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 26 selfloop transitions, 4 changer transitions 3/36 dead transitions. [2023-08-29 20:50:26,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 36 transitions, 433 flow [2023-08-29 20:50:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-08-29 20:50:26,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45564516129032256 [2023-08-29 20:50:26,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-08-29 20:50:26,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-08-29 20:50:26,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:26,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-08-29 20:50:26,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 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-29 20:50:26,644 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 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-29 20:50:26,644 INFO L175 Difference]: Start difference. First operand has 67 places, 35 transitions, 420 flow. Second operand 4 states and 339 transitions. [2023-08-29 20:50:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 36 transitions, 433 flow [2023-08-29 20:50:26,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 324 flow, removed 22 selfloop flow, removed 23 redundant places. [2023-08-29 20:50:26,646 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 196 flow [2023-08-29 20:50:26,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2023-08-29 20:50:26,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2023-08-29 20:50:26,647 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 196 flow [2023-08-29 20:50:26,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:26,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:50:26,648 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:26,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 191831656, now seen corresponding path program 1 times [2023-08-29 20:50:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846802653] [2023-08-29 20:50:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846802653] [2023-08-29 20:50:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846802653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184385644] [2023-08-29 20:50:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:26,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 186 [2023-08-29 20:50:26,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 25 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:26,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 186 [2023-08-29 20:50:26,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:26,841 INFO L130 PetriNetUnfolder]: 14/55 cut-off events. [2023-08-29 20:50:26,841 INFO L131 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2023-08-29 20:50:26,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 55 events. 14/55 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 0 based on Foata normal form. 11/66 useless extension candidates. Maximal degree in co-relation 258. Up to 24 conditions per place. [2023-08-29 20:50:26,841 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 6 changer transitions 8/30 dead transitions. [2023-08-29 20:50:26,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 30 transitions, 294 flow [2023-08-29 20:50:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-08-29 20:50:26,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443010752688172 [2023-08-29 20:50:26,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-08-29 20:50:26,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-08-29 20:50:26,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:26,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-08-29 20:50:26,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,845 INFO L175 Difference]: Start difference. First operand has 45 places, 25 transitions, 196 flow. Second operand 5 states and 412 transitions. [2023-08-29 20:50:26,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 30 transitions, 294 flow [2023-08-29 20:50:26,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 228 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-08-29 20:50:26,847 INFO L231 Difference]: Finished difference. Result has 43 places, 20 transitions, 130 flow [2023-08-29 20:50:26,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=20} [2023-08-29 20:50:26,847 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-29 20:50:26,847 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 20 transitions, 130 flow [2023-08-29 20:50:26,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:26,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:26,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:26,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:50:26,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:26,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash -246429869, now seen corresponding path program 1 times [2023-08-29 20:50:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63324482] [2023-08-29 20:50:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:50:26,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:50:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:50:26,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:50:26,903 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:50:26,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:50:26,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:50:26,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:50:26,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:50:26,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:50:26,906 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:26,909 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:50:26,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:50:26,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:50:26 BasicIcfg [2023-08-29 20:50:26,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:50:26,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:50:26,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:50:26,956 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:50:26,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:15" (3/4) ... [2023-08-29 20:50:26,958 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:50:26,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:50:26,959 INFO L158 Benchmark]: Toolchain (without parser) took 12452.31ms. Allocated memory was 96.5MB in the beginning and 375.4MB in the end (delta: 278.9MB). Free memory was 75.7MB in the beginning and 298.9MB in the end (delta: -223.2MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2023-08-29 20:50:26,959 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:50:26,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.79ms. Allocated memory is still 96.5MB. Free memory was 75.4MB in the beginning and 53.0MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-29 20:50:26,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.09ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 75.0MB in the end (delta: -22.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2023-08-29 20:50:26,960 INFO L158 Benchmark]: Boogie Preprocessor took 42.44ms. Allocated memory is still 96.5MB. Free memory was 75.0MB in the beginning and 73.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:50:26,960 INFO L158 Benchmark]: RCFGBuilder took 520.46ms. Allocated memory is still 96.5MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2023-08-29 20:50:26,960 INFO L158 Benchmark]: TraceAbstraction took 11420.54ms. Allocated memory was 96.5MB in the beginning and 375.4MB in the end (delta: 278.9MB). Free memory was 71.7MB in the beginning and 298.9MB in the end (delta: -227.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2023-08-29 20:50:26,961 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 375.4MB. Free memory is still 298.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:50:26,962 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.12ms. Allocated memory is still 62.9MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.79ms. Allocated memory is still 96.5MB. Free memory was 75.4MB in the beginning and 53.0MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.09ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 75.0MB in the end (delta: -22.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.44ms. Allocated memory is still 96.5MB. Free memory was 75.0MB in the beginning and 73.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 520.46ms. Allocated memory is still 96.5MB. Free memory was 73.3MB in the beginning and 72.2MB in the end (delta: 1.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11420.54ms. Allocated memory was 96.5MB in the beginning and 375.4MB in the end (delta: 278.9MB). Free memory was 71.7MB in the beginning and 298.9MB in the end (delta: -227.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 375.4MB. Free memory is still 298.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 97 PlacesBefore, 31 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 3168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1429, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 622, independent: 602, independent conditional: 0, independent unconditional: 602, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1429, independent: 686, independent conditional: 0, independent unconditional: 686, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 622, unknown conditional: 0, unknown unconditional: 622] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 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, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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 [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=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: -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: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 791]: 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: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1905 IncrementalHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 67 mSDtfsCounter, 1905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=889occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:50:26,993 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/safe029_power.opt_pso.opt_rmo.opt.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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:50:28,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:50:28,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:50:28,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:50:28,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:50:28,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:50:28,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:50:28,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:50:28,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:50:28,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:50:28,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:50:28,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:50:28,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:50:28,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:50:28,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:50:28,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:50:28,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:50:28,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:50:28,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:50:28,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:50:28,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:50:28,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:50:28,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:50:28,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:50:28,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:50:28,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:50:28,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:50:28,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:50:28,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:50:28,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:50:28,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:50:28,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:50:28,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:50:28,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:50:28,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:50:28,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:50:28,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:50:28,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:50:28,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:50:28,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:50:28,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:50:28,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:50:28,587 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:50:28,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:50:28,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:50:28,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:50:28,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:50:28,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:50:28,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:50:28,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:50:28,590 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:50:28,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:50:28,591 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:50:28,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:50:28,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:28,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:50:28,593 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:50:28,594 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:50:28,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:50:28,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:50:28,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:50:28,859 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:50:28,860 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:50:28,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:29,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:50:29,968 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:50:29,969 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:29,978 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e025091/922d82d49e21493c87c4bde36ff1d210/FLAGafdf31db7 [2023-08-29 20:50:29,987 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e025091/922d82d49e21493c87c4bde36ff1d210 [2023-08-29 20:50:29,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:50:29,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:50:29,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:29,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:50:29,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:50:29,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:29" (1/1) ... [2023-08-29 20:50:29,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38248b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:29, skipping insertion in model container [2023-08-29 20:50:29,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:29" (1/1) ... [2023-08-29 20:50:30,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:50:30,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:50:30,133 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:30,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:30,308 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:50:30,317 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:30,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:30,392 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:30,392 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:30,396 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:50:30,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30 WrapperNode [2023-08-29 20:50:30,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:30,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:30,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:50:30,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:50:30,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,454 INFO L138 Inliner]: procedures = 178, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-29 20:50:30,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:30,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:50:30,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:50:30,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:50:30,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:50:30,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:50:30,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:50:30,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:50:30,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (1/1) ... [2023-08-29 20:50:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:50:30,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:50:30,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:50:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:50:30,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:50:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:50:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:50:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:50:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:50:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:50:30,555 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:50:30,652 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:50:30,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:50:30,922 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:50:31,044 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:50:31,045 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:50:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:31 BoogieIcfgContainer [2023-08-29 20:50:31,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:50:31,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:50:31,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:50:31,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:50:31,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:50:29" (1/3) ... [2023-08-29 20:50:31,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c493698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:31, skipping insertion in model container [2023-08-29 20:50:31,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:30" (2/3) ... [2023-08-29 20:50:31,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c493698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:31, skipping insertion in model container [2023-08-29 20:50:31,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:31" (3/3) ... [2023-08-29 20:50:31,051 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:31,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:50:31,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:50:31,063 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:50:31,104 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:50:31,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2023-08-29 20:50:31,175 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-29 20:50:31,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:31,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-29 20:50:31,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2023-08-29 20:50:31,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-08-29 20:50:31,185 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:50:31,192 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-29 20:50:31,194 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-08-29 20:50:31,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-08-29 20:50:31,211 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-08-29 20:50:31,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-08-29 20:50:31,212 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-29 20:50:35,339 INFO L134 LiptonReduction]: Checked pairs total: 2914 [2023-08-29 20:50:35,340 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-29 20:50:35,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:50:35,352 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;@2a64070b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:50:35,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:50:35,353 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:50:35,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:35,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:35,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:50:35,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:35,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 437, now seen corresponding path program 1 times [2023-08-29 20:50:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:35,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386300304] [2023-08-29 20:50:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:35,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:35,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:35,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:35,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:50:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:35,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:50:35,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:35,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:35,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386300304] [2023-08-29 20:50:35,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386300304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:35,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:50:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991257829] [2023-08-29 20:50:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:35,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:50:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:50:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:50:35,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192 [2023-08-29 20:50:35,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:35,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192 [2023-08-29 20:50:35,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:35,589 INFO L130 PetriNetUnfolder]: 235/414 cut-off events. [2023-08-29 20:50:35,594 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:50:35,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 414 events. 235/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1748 event pairs, 235 based on Foata normal form. 20/335 useless extension candidates. Maximal degree in co-relation 822. Up to 405 conditions per place. [2023-08-29 20:50:35,600 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-29 20:50:35,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-29 20:50:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:50:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:50:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 191 transitions. [2023-08-29 20:50:35,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2023-08-29 20:50:35,612 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 191 transitions. [2023-08-29 20:50:35,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 191 transitions. [2023-08-29 20:50:35,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:35,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 191 transitions. [2023-08-29 20:50:35,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,623 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,625 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 191 transitions. [2023-08-29 20:50:35,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-29 20:50:35,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:35,628 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-29 20:50:35,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-29 20:50:35,634 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-29 20:50:35,634 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-29 20:50:35,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:35,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:50:35,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:50:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:35,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:35,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 414088530, now seen corresponding path program 1 times [2023-08-29 20:50:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41982552] [2023-08-29 20:50:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:35,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:35,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:50:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:35,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:50:35,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:35,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:35,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:35,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41982552] [2023-08-29 20:50:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41982552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:35,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:50:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4231419] [2023-08-29 20:50:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:35,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:50:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:35,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:50:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:50:35,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192 [2023-08-29 20:50:35,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:35,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:35,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192 [2023-08-29 20:50:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:36,067 INFO L130 PetriNetUnfolder]: 183/353 cut-off events. [2023-08-29 20:50:36,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:36,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 353 events. 183/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1569 event pairs, 27 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 683. Up to 253 conditions per place. [2023-08-29 20:50:36,069 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-29 20:50:36,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 116 flow [2023-08-29 20:50:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:50:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:50:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-29 20:50:36,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809027777777778 [2023-08-29 20:50:36,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-29 20:50:36,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-29 20:50:36,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:36,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-29 20:50:36,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,082 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 277 transitions. [2023-08-29 20:50:36,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 116 flow [2023-08-29 20:50:36,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:36,083 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2023-08-29 20:50:36,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-08-29 20:50:36,083 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-29 20:50:36,083 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 42 flow [2023-08-29 20:50:36,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:36,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:36,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:36,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:36,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash 966541468, now seen corresponding path program 1 times [2023-08-29 20:50:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:36,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014300764] [2023-08-29 20:50:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:36,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:36,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:36,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:50:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:36,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:50:36,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:36,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:36,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:36,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014300764] [2023-08-29 20:50:36,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014300764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:36,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733244991] [2023-08-29 20:50:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:36,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:36,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192 [2023-08-29 20:50:36,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:36,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192 [2023-08-29 20:50:36,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:36,489 INFO L130 PetriNetUnfolder]: 62/145 cut-off events. [2023-08-29 20:50:36,489 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 20:50:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 145 events. 62/145 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 523 event pairs, 20 based on Foata normal form. 16/153 useless extension candidates. Maximal degree in co-relation 307. Up to 66 conditions per place. [2023-08-29 20:50:36,490 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 25 selfloop transitions, 4 changer transitions 1/32 dead transitions. [2023-08-29 20:50:36,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 138 flow [2023-08-29 20:50:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-08-29 20:50:36,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2023-08-29 20:50:36,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-08-29 20:50:36,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-08-29 20:50:36,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:36,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-08-29 20:50:36,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,503 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,503 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 42 flow. Second operand 4 states and 348 transitions. [2023-08-29 20:50:36,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 138 flow [2023-08-29 20:50:36,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:36,504 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 64 flow [2023-08-29 20:50:36,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-29 20:50:36,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-08-29 20:50:36,505 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 64 flow [2023-08-29 20:50:36,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:36,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:36,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:36,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:36,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:36,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -471561267, now seen corresponding path program 1 times [2023-08-29 20:50:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136818001] [2023-08-29 20:50:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:36,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:36,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:36,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:50:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:36,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:50:36,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:36,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:36,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136818001] [2023-08-29 20:50:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136818001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452418017] [2023-08-29 20:50:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:36,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:36,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192 [2023-08-29 20:50:36,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:36,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192 [2023-08-29 20:50:36,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:36,895 INFO L130 PetriNetUnfolder]: 20/61 cut-off events. [2023-08-29 20:50:36,895 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:50:36,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 61 events. 20/61 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 8 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 165. Up to 24 conditions per place. [2023-08-29 20:50:36,896 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 17 selfloop transitions, 6 changer transitions 1/26 dead transitions. [2023-08-29 20:50:36,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 131 flow [2023-08-29 20:50:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2023-08-29 20:50:36,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43854166666666666 [2023-08-29 20:50:36,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 421 transitions. [2023-08-29 20:50:36,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 421 transitions. [2023-08-29 20:50:36,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:36,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 421 transitions. [2023-08-29 20:50:36,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,903 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 64 flow. Second operand 5 states and 421 transitions. [2023-08-29 20:50:36,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 131 flow [2023-08-29 20:50:36,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 122 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:36,904 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 80 flow [2023-08-29 20:50:36,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2023-08-29 20:50:36,904 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2023-08-29 20:50:36,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 80 flow [2023-08-29 20:50:36,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:36,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:36,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:36,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:37,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:37,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:37,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1310859534, now seen corresponding path program 1 times [2023-08-29 20:50:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:37,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95103870] [2023-08-29 20:50:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:37,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:37,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:37,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:37,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:50:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:37,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:50:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:37,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:37,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95103870] [2023-08-29 20:50:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95103870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:37,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717168463] [2023-08-29 20:50:37,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:37,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 192 [2023-08-29 20:50:37,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:37,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 192 [2023-08-29 20:50:37,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:37,315 INFO L130 PetriNetUnfolder]: 21/72 cut-off events. [2023-08-29 20:50:37,315 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-29 20:50:37,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 72 events. 21/72 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 196 event pairs, 9 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 213. Up to 47 conditions per place. [2023-08-29 20:50:37,316 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 26 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-29 20:50:37,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 194 flow [2023-08-29 20:50:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2023-08-29 20:50:37,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505208333333333 [2023-08-29 20:50:37,324 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 346 transitions. [2023-08-29 20:50:37,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 346 transitions. [2023-08-29 20:50:37,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:37,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 346 transitions. [2023-08-29 20:50:37,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,326 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 80 flow. Second operand 4 states and 346 transitions. [2023-08-29 20:50:37,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 194 flow [2023-08-29 20:50:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 138 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-29 20:50:37,329 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 70 flow [2023-08-29 20:50:37,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-29 20:50:37,331 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-29 20:50:37,331 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 70 flow [2023-08-29 20:50:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:37,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:37,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:37,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:37,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:37,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -681021318, now seen corresponding path program 1 times [2023-08-29 20:50:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337258715] [2023-08-29 20:50:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:37,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:37,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:37,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:50:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:37,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:50:37,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:37,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:37,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:37,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337258715] [2023-08-29 20:50:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337258715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:37,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127255902] [2023-08-29 20:50:37,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:37,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:37,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 192 [2023-08-29 20:50:37,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:37,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 192 [2023-08-29 20:50:37,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:37,930 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2023-08-29 20:50:37,931 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-29 20:50:37,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 66 events. 19/66 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 173 event pairs, 12 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 166. Up to 55 conditions per place. [2023-08-29 20:50:37,931 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2023-08-29 20:50:37,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 120 flow [2023-08-29 20:50:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2023-08-29 20:50:37,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2023-08-29 20:50:37,933 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 306 transitions. [2023-08-29 20:50:37,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions. [2023-08-29 20:50:37,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:37,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions. [2023-08-29 20:50:37,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,934 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,935 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 70 flow. Second operand 4 states and 306 transitions. [2023-08-29 20:50:37,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 120 flow [2023-08-29 20:50:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:37,935 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 60 flow [2023-08-29 20:50:37,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2023-08-29 20:50:37,936 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-29 20:50:37,936 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2023-08-29 20:50:37,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:37,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:37,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:37,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:38,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:38,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1217701248, now seen corresponding path program 2 times [2023-08-29 20:50:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588757883] [2023-08-29 20:50:38,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:50:38,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:38,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:38,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:38,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:50:38,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:50:38,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:50:38,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-29 20:50:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:50:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:38,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:50:38,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:50:38,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588757883] [2023-08-29 20:50:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588757883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:50:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876171147] [2023-08-29 20:50:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:50:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:50:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:50:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:50:38,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 192 [2023-08-29 20:50:38,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:38,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:38,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 192 [2023-08-29 20:50:38,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:38,522 INFO L130 PetriNetUnfolder]: 9/42 cut-off events. [2023-08-29 20:50:38,522 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 20:50:38,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 42 events. 9/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 109. Up to 24 conditions per place. [2023-08-29 20:50:38,522 INFO L137 encePairwiseOnDemand]: 186/192 looper letters, 16 selfloop transitions, 3 changer transitions 10/30 dead transitions. [2023-08-29 20:50:38,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 156 flow [2023-08-29 20:50:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2023-08-29 20:50:38,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288194444444444 [2023-08-29 20:50:38,525 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 494 transitions. [2023-08-29 20:50:38,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 494 transitions. [2023-08-29 20:50:38,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:38,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 494 transitions. [2023-08-29 20:50:38,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.33333333333333) internal successors, (494), 6 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:38,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:38,528 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:38,528 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 6 states and 494 transitions. [2023-08-29 20:50:38,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 156 flow [2023-08-29 20:50:38,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 141 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:50:38,530 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 64 flow [2023-08-29 20:50:38,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-29 20:50:38,530 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-29 20:50:38,531 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 64 flow [2023-08-29 20:50:38,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.66666666666667) internal successors, (717), 9 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:38,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:38,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:38,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:38,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:38,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:50:38,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash 665521800, now seen corresponding path program 3 times [2023-08-29 20:50:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:50:38,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157027489] [2023-08-29 20:50:38,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:50:38,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:50:38,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:50:38,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:50:38,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:50:38,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:50:38,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:50:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:50:38,885 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:50:38,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:50:38,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:50:38,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:50:38,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:50:38,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:50:38,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:50:38,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:50:38,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:50:38,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:50:38,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:50:38,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:50:38,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:50:39,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:50:39,089 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:50:39,093 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:50:39,093 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:50:39,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:50:39 BasicIcfg [2023-08-29 20:50:39,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:50:39,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:50:39,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:50:39,145 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:50:39,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:31" (3/4) ... [2023-08-29 20:50:39,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:50:39,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:50:39,147 INFO L158 Benchmark]: Toolchain (without parser) took 9157.79ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 73.3MB in the beginning and 63.2MB in the end (delta: 10.1MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,147 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:50:39,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.03ms. Allocated memory is still 96.5MB. Free memory was 73.0MB in the beginning and 49.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 96.5MB. Free memory was 49.9MB in the beginning and 47.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,148 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 96.5MB. Free memory was 47.3MB in the beginning and 74.9MB in the end (delta: -27.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,148 INFO L158 Benchmark]: RCFGBuilder took 543.30ms. Allocated memory is still 96.5MB. Free memory was 74.9MB in the beginning and 69.1MB in the end (delta: 5.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,149 INFO L158 Benchmark]: TraceAbstraction took 8096.97ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 68.5MB in the beginning and 64.3MB in the end (delta: 4.3MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2023-08-29 20:50:39,149 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:50:39,150 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.03ms. Allocated memory is still 96.5MB. Free memory was 73.0MB in the beginning and 49.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 96.5MB. Free memory was 49.9MB in the beginning and 47.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 96.5MB. Free memory was 47.3MB in the beginning and 74.9MB in the end (delta: -27.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * RCFGBuilder took 543.30ms. Allocated memory is still 96.5MB. Free memory was 74.9MB in the beginning and 69.1MB in the end (delta: 5.8MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8096.97ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 68.5MB in the beginning and 64.3MB in the end (delta: 4.3MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 98 PlacesBefore, 31 PlacesAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 2914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1280, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 623, independent: 599, independent conditional: 0, independent unconditional: 599, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1280, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 623, unknown conditional: 0, unknown unconditional: 623] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={3:0}, t2476={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 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, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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 [__unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={3:0}, t2476={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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={3:0}, t2476={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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=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: -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: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 791]: 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: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 113 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 32 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 67 ConstructedInterpolants, 10 QuantifiedInterpolants, 566 SizeOfPredicates, 5 NumberOfNonLiveVariables, 661 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:50:39,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample